We present a set of Fortran subroutines which implement the least-squares algorithm described in Part I (Barrodale and Erickson, 1980, this issue) for solving three variants of the linear prediction problem. When combined with a suitable driver program, these subroutines can be used to calculate maximum entropy spectra without imposing a Toeplitz structure on the model.

This content is PDF only. Please click on the PDF icon to access.

First Page Preview

First page PDF preview
You do not currently have access to this article.