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

DOI10.1007/S11075-004-6998-YzbMath1105.65035OpenAlexW2078929648MaRDI QIDQ2501234

Nicola Mastronardi, Marc Van Barel, 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

eigenvalueseigenvectorssemiseparable matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Hermitian, skew-Hermitian, and related matrices (15B57)

Related Items (10)

Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal ⋮ Computations with quasiseparable polynomials and matrices ⋮ A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices ⋮ AQZ-method based on semiseparable 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 multiple shift \(QR\)-step for structured rank matrices ⋮ 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

This page was built for publication: Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices