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

DOI10.1016/S0024-3795(00)00106-3zbMath0959.65057MaRDI QIDQ1579515

Shivkumar Chandrasekaran, Ming Gu

Publication date: 22 November 2000

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

Green functionssymmetric matrixtwo point boundary value problemseigendecompositionorthogonal Givens rotationssymmetric banded plus semi-separable matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Orthogonalization in numerical linear algebra (65F25)

Related Items

Minimal quasi-separable realizations for the inverse of a quasi-separable operator, On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms, Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations, Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations, The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order, Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations, Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices

Cites Work

• Unnamed Item
• The numerically stable reconstruction of Jacobi matrices from spectral data
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
• Tridiagonalization of a symmetric band matrix
• Parameter Estimation in the Presence of Bounded Data Uncertainties
• An Efficient Algorithm for a Bounded Errors-in-Variables Model