An implicit QR algorithm for symmetric semiseparable matrices

DOI10.1002/NLA.425MaRDI QIDQ3599992zbMATH OpenOpenAlexFDO

Authors 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

convergence numerical examples complexity symmetric matrix Givens transformations semiseparable matrix \(QR\) algorithm similarity reduction to semiseparable form

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
A new iteration for computing the eigenvalues of semiseparable (plus diagonal) matrices
Orthogonal similarity transformation into block-semiseparable matrices of semiseparability rankk
A QR-method for computing the singular values via semiseparable matrices

Cites work

scientific article; zbMATH DE number 1183880 (Why is no real title available?)
scientific article; zbMATH DE number 1049353 (Why is no real title available?)
scientific article; zbMATH DE number 961607 (Why is no real title available?)
Inverse acoustic and electromagnetic scattering theory.
On the inverse of band matrices
Some algorithms for solving special tridiagonal block Toeplitz linear systems

Cited in

(30)

Implicit QR for rank-structured matrix pencils
A new iteration for computing the eigenvalues of semiseparable (plus diagonal) matrices
Structures preserved by the QR-algorithm
Structured eigenvalue problems for rational Gauss quadrature
On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form
Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications
A fast implicit QR eigenvalue algorithm for companion matrices
Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
Deflation for the symmetric arrowhead and diagonal-plus-rank-one eigenvalue problems
Rational \(QR\)-iteration without inversion
A multiple shift \(QR\)-step for structured rank matrices
On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
A Cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem
A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
Computations with quasiseparable polynomials and matrices
Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
On computing the eigenvectors of a class of structured matrices
Rank structures preserved by the \(QR\)-algorithm: the singular case
The LR Cholesky algorithm for symmetric hierarchical matrices
scientific article; zbMATH DE number 24380 (Why is no real title available?)
Implicit double shift \(QR\)-algorithm for companion matrices
AQZ-method based on semiseparable matrices
A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
A QR-method for computing the singular values via semiseparable matrices
QR-Like Algorithms for Symmetric Arrow Matrices
Neville elimination for rank-structured matrices
The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices
Matrix shapes invariant under the symmetric QR algorithm
Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal

This page was built for publication: An implicit QR algorithm for symmetric semiseparable matrices

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