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 of Algorithms for least-squares linear prediction and maximum entropy spectral analysis; Part II; Fortran program
You do not have access to this content, please speak to your institutional administrator if you feel you should have access.