Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices

DOI10.1007/s11075-004-6998-yzbMath1105.65035MaRDI QIDQ2501234

Marc Van Barel, Nicola Mastronardi, Ellen Van Camp

Publication date: 4 September 2006

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-004-6998-y

zbMATH Keywords

eigenvalues; eigenvectors; semiseparable matrix

Mathematics Subject Classification ID

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

15B57: Hermitian, skew-Hermitian, and related matrices

Related Items

Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal, AQZ-method based on semiseparable matrices, Computations with quasiseparable polynomials and matrices, A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices, A Cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem, 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, On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form, A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices

Cites Work

• Unnamed Item
• Unnamed Item
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• Rank-one modification of the symmetric eigenproblem
• Fast algorithms with preprocessing for matrix-vector multiplication problems
• Direct and inverse eigenvalue problems for diagonal-plus-semiseparable matrices
• A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
• Fast and stable eigendecomposition of symmetric banded plus semi-separable matrices
• Characterization of integral operators with semi-separable kernels with symmetries
• The Lanczos Algorithm With Partial Reorthogonalization
• Quasi-Newton Methods, Motivation and Theory
• A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
• A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
• An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
• Fast and stable reduction of diagonal plus semi-separable matrices to tridiagonal and bidiagonal form