ACM Home Page
Please provide us with feedback. Feedback
FORTRAN subroutines for general Toeplitz systems
Full text PdfPdf (1.14 MB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 18 ,  Issue 3  (September 1992) table of contents
Pages: 256 - 273  
Year of Publication: 1992
ISSN:0098-3500
Authors
Per Christian Hansen  Technical Univ. of Denmark, Lyngby, Denmark
Tony F. Chan  Univ. of California, Los Angeles
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 59,   Citation Count: 0
Additional Information:

abstract   references   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/131766.131768
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
ARUSHANIAN, O. B., SAMARIN, M. K., VOEVODIN, V. V., TYRTYSHNIKOV, E. ~}., GARBOW, B. S., BOYLE, J. M., COWELL, W. R., AND DRI?Z, K.W. The Toeplitz Package Users' Guide. Rep. ANL-83-16, Argonne National Lab., 1983.
 
3
BRENT, R.P. Old and new algorithms for Toeplitz systems. In Advanced Algorithms and Architectures for Signal Processing III, F. T. Luk, Ed., Proc. SPIE 975 (1988), 2-9.
 
4
BRENT, R. P.~ LUK, F. T., AND VAN LOAN, C.F. Computation of the singular value decomposition using mesh-connected processors. J VLSI Coraput. Syst. I (1985), 242-270.
 
5
BUNCH, J.R. Stability of methods for solving Toeplitz systems. SIAM J Sci. Stat. Comput. 6, 2 (Mar. 1985), 349-364.
 
6
CADZOW, J. A., AND CHEN~ T.-C. Application of Toeplitz eigenvalue decomposition in digital filter synthesis. IEEE ASSSP-37 (1989), 655-664.
 
7
 
8
CHAN, T. F., AND HANSEN, P. C. A lookahead Levinson algorithm for general Toeplitz systems. CAM Rep. 90-11, Dept. of Mathematics, UCLA; to appear in IEEE $P
 
9
 
10
DAHLQUIST, G.. BJGRCK, A, AND ANDERSON, N. Numerical Methods. Prentme Hall, Englewood Cliffs, N.J., 1974.
 
11
DELSARTE, P., GEN1N, Y. V., AND KAMP, Y.G. A generalization of the Levinson algorithm for Hermitian Toeplltz matrices with any rank profile. IEEE ASSP-33, 4 (Aug. 1987), 964-971.
 
12
DEMEURE, C. J., AND SCHARF, L.L. Linear statistical methods for stationary sequences and related algorithms for Cholesky factorization of Toeplitz matrices. IEEE ASSP-35, 1 (Jan. 1987)~ 29 42.
 
13
DONGARRA, J. J., BUNCH, J. R., MOLER, C. B., AND STEWART, G.W. Linpack Users' Guide. SIAM, Philadelphia, Pa., 1979.
 
14
GOLUB, G. H., AND VAN LOAN, C.F. Matrix ComputatLons, 2rid ed.. Johns Hopkins University Press, Baltimore, Md., 1989.
 
15
COVER, M. J. C., AND BARNETT, S. Inversion of Toeplitz matrices which are not strongly non-singular. IMA J. Numer. Anal. 5~ 1 (Jan. 1985), 101-110.
 
16
GRIMES, R. G., AND LEWIS, J.G. Condition number estimation for sparse matrices. SIAM J. Sct. Stat. Comput. 2, 4 (Dec. 1981), 384-388.
 
17
IMSL Math/Library User's Manual. IMSL, 1987.
 
18
KAILATH, T. A view of three decades of linear filtering theory. IEEE IT-20 (1974), 145-181.
19
 
20
LEVINSON, N. The Wiener rms (root mean square) error criterion in filter design and prediction. J. Moth. Phys. 25 (1947l, 261-278.
 
21
PRESS, W. H., FLANNERY, g. P., TEUKOLSKI, S. A., AND VETTERLING, W.T. Numerical Rectpes. Cambridge University Press, 1987.
 
22
SWEET, D.R. The use of pivoting to improve the numerical performance of Toeplitz solvers. In Advanced Algorithms and Architectures for Signal Processing, J. M. Speiser, Ed., Proceedings SPIE 696 (1986), 8-18.
 
23
 
24
TYRTYSHNIKOV, E.E. New cost-efficient and fast algorithms for special classes of Toeplitz systems. Soy. J. Numer. Anal. Model. 3, i (Jan. 1988), 63 76.


REVIEW

"Robert James Plemmons : Reviewer"

Some FORTRAN 77 implementations of direct algorithms are given for solving systems of linear equations where the coefficient matrix T is Toeplitz. Such systems arise in a variety of applica  more...

Collaborative Colleagues:
Per Christian Hansen: colleagues
Tony F. Chan: colleagues