An implicit QR algorithm for symmetric semiseparable matrices

DOI10.1002/NLA.425zbMATH Open1164.65368OpenAlexW2141992912MaRDI QIDQ3599992FDOQ3599992

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

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

zbMATH Keywords

convergencenumerical examplescomplexitysymmetric matrixGivens transformationssemiseparable matrix\(QR\) algorithmsimilarity reduction to semiseparable form

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Inverse acoustic and electromagnetic scattering theory.
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the inverse of band matrices
• Some algorithms for solving special tridiagonal block Toeplitz linear systems

Cited In (30)

• Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems
• A new iteration for computing the eigenvalues of semiseparable (plus diagonal) matrices
• On computing the eigenvectors of a class of structured matrices
• Rank structures preserved by the \(QR\)-algorithm: the singular case
• AQZ-method based on semiseparable matrices
• Rational \(QR\)-iteration without inversion
• Implicit double shift \(QR\)-algorithm for companion matrices
• A QR-method for computing the singular values via semiseparable matrices
• Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications
• On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form
• A fast implicit QR eigenvalue algorithm for companion matrices
• On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
• A multiple shift \(QR\)-step for structured rank matrices
• A Cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem
• Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
• Structures preserved by the QR-algorithm
• Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
• Implicit QR for rank-structured matrix pencils
• Title not available (Why is that?)
• Neville elimination for rank-structured matrices
• A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
• The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
• QR-Like Algorithms for Symmetric Arrow 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
• A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices
• Structured eigenvalue problems for rational Gauss quadrature
• A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
• The LR Cholesky algorithm for symmetric hierarchical matrices
• Computations with quasiseparable polynomials and matrices

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)