An implicit QR algorithm for symmetric semiseparable matrices
From MaRDI portal
Publication:3599992
DOI10.1002/nla.425zbMath1164.65368OpenAlexW2141992912MaRDI QIDQ3599992
Marc Van Barel, Raf Vandebril, Nicola Mastronardi
Publication date: 9 February 2009
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.425
complexityconvergencenumerical examplessymmetric matrixGivens transformationssemiseparable matrix\(QR\) algorithmsimilarity reduction to semiseparable form
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complexity and performance of numerical algorithms (65Y20)
Related Items (22)
Rank structures preserved by the \(QR\)-algorithm: the singular case ⋮ 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 ⋮ Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications ⋮ Computations with quasiseparable polynomials and matrices ⋮ On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms ⋮ The LR Cholesky algorithm for symmetric hierarchical matrices ⋮ A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices ⋮ AQZ-method based on semiseparable matrices ⋮ Structured eigenvalue problems for rational Gauss quadrature ⋮ A Cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem ⋮ Neville elimination for rank-structured matrices ⋮ Rational \(QR\)-iteration without inversion ⋮ Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations ⋮ The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order ⋮ A QR-method for computing the singular values via semiseparable matrices ⋮ On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form ⋮ Implicit double shift \(QR\)-algorithm for companion matrices ⋮ A multiple shift \(QR\)-step for structured rank matrices ⋮ A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices ⋮ Structures preserved by the QR-algorithm ⋮ Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems
Cites Work
This page was built for publication: An implicit QR algorithm for symmetric semiseparable matrices