An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form

DOI10.1137/S0895479803428229MaRDI QIDQ5317659zbMATH OpenFDO

Authors Marc van Barel, Raf Vandebril, Nicola Mastronardi

Publication date 19 September 2005

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895479803428229

zbMATH Keywords

Householder reductionLanczos algorithmnumerical experimentsQR algorithmRitz valuessemiseparable matrixsimilarity transformation

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• Orthogonal similarity transformation into block-semiseparable matrices of semiseparability rankk
• Fast and stable reduction of diagonal plus semi-separable matrices to tridiagonal and bidiagonal form
• A Lanczos-like reduction of symmetric structured matrices to semiseparable form
• Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal
• Structural properties of matrix unitary reduction to semiseparable form

Cited in

(28)

• The extended Krylov subspace method and orthogonal Laurent polynomials
• A multiple shift \(QR\)-step for structured rank matrices
• Two fast algorithms for solving diagonal-plus-semiseparable linear systems.
• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
• Necessary and sufficient conditions for orthogonal similarity transformations to obtain the Arnoli(Lanczos)-Ritz values
• Computations with quasiseparable polynomials and matrices
• A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices
• A small note on the scaling of symmetric positive definite semiseparable matrices
• Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices
• On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form
• Structural properties of matrix unitary reduction to semiseparable form
• A Lanczos-like reduction of symmetric structured matrices to semiseparable form
• A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
• Structures preserved by the QR-algorithm
• Orthogonal similarity transformation into block-semiseparable matrices of semiseparability rankk
• scientific article; zbMATH DE number 4143353 (Why is no real title available?)
• An implicit QR algorithm for symmetric semiseparable matrices
• Tridiagonal-Diagonal Reduction of Symmetric Indefinite Pairs
• Semiseparable matrices based on orthogonal factorization of inverted Krylov matrices
• Transformations to rank structures by unitary similarity
• A unification of unitary similarity transforms to compressed representations
• A QR-method for computing the singular values via semiseparable matrices
• Coefficient-free adaptations of polynomial root-finders
• On computing the eigenvectors of a class of structured matrices
• 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
• Eigen-solving via reduction to DPR1 matrices
• A new iteration for computing the eigenvalues of semiseparable (plus diagonal) matrices

This page was built for publication: An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317659)