Fast and stable eigendecomposition of symmetric banded plus semi-separable matrices

Linear Algebra and Its Applications

Volumn 313, Issue 1-3, 2000, Pages 107-114

  Chandrasekaran, S ^a   Gu, M ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

15A09; 15A23; 65F05; 65L10; 65R20; Banded matrix; Fast algorithms; Semi separable matrix; Stable algorithms

Indexed keywords

EID: 0034394306     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(00)00106-3     Document Type: Article

References (8)

1. Allegro CL User Guide, version 4.3 (Franz Inc., 1995), University Ave., Berkeley, CA 94704, USA, March 1996.
2. S. Chandrasekaran, M. Gu, A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semi-separable matrices, Numer. Math., to appear.
3. Chandrasekaran S., Golub G., Gu M., Sayed A.H. Parameter estimation in the presence of bounded data uncertainties. SIAM J. Matrix Anal. Appl. 19(1):1998;235-252.
4. Chandrasekaran S., Golub G., Gu M., Sayed A.H. An efficient algorithm for a bounded errors-in-variables model. SIAM J. Matrix Anal. Appl. 20(4):1999;839-859.
5. Golub G.H., Van Loan C.F. Matrix Computations. third ed. 1996;Johns Hopkins University Press, Baltimore, MD.
6. Gragg W.B., Harrod W.J. The numerically stable reconstruction of Jacobi matrices from spectral data. Numer. Math. 44:1984;317-335.
7. Parlett B.N. The Symmetric Eigenvalue Problem. 1980;Prentice-Hall, Englewood Cliffs, NJ.
8. Schwarz H.R. Tridiagonalization of a symmetric banded matrix. Numer. Math. 12:1968;231-241.