Computing thr minimum eigenvalue of a symmetric positive definite Toeplitz matrix
SIAM Journal on Scientific and Statistical Computing
Numerical solution of the eigenvalue problem for symmetric rationally generated Toeplitz matrices
SIAM Journal on Matrix Analysis and Applications
LAPACK's user's guide
A look-ahead Levinson algorithm for indefinite Toeplitz systems
SIAM Journal on Matrix Analysis and Applications
Basic Linear Algebra Subprograms for Fortran Usage
ACM Transactions on Mathematical Software (TOMS)
A fast solver for linear systems with displacement structure
Numerical Algorithms
smt: a Matlab toolbox for structured matrices
Numerical Algorithms
| Hi-index | 0.00 |
This paper presents FORTRAN 77 implementations of the lookahead Levinson algorithm of Chan and Hansen [7, 8] for solving symmetric indefinite and general Toeplitz systems. The algorithms are numerically stable for all Toeplitz matrices that do not have many consecutive ill-conditioned leading principal submatrices, and also produce estimates of the algorithm and matrix condition numbers. In contrast, the classical Levinson algorithm is only guaranteed to be numerically stable for symmetric positive definite Toeplitz matrices, and no condition estimate is produced.