An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
From MaRDI portal
Publication:5317659
DOI10.1137/S0895479803428229zbMath1089.65032MaRDI QIDQ5317659
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)
numerical experimentsRitz valuesLanczos algorithmsimilarity transformationQR algorithmsemiseparable matrixHouseholder reduction
Related Items
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 ⋮ 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 unification of unitary similarity transforms to compressed representations ⋮ Two fast algorithms for solving diagonal-plus-semiseparable linear systems. ⋮ AQZ-method based on semiseparable matrices ⋮ Eigen-solving via reduction to DPR1 matrices ⋮ A QR-method for computing the singular values via semiseparable matrices ⋮ Transformations to rank structures by unitary similarity ⋮ A small note on the scaling of symmetric positive definite semiseparable matrices ⋮ 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 ⋮ On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form ⋮ The extended Krylov subspace method and orthogonal Laurent polynomials ⋮ A multiple shift \(QR\)-step for structured rank matrices ⋮ A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices ⋮ Structures preserved by the QR-algorithm ⋮ Coefficient-free adaptations of polynomial root-finders
