A QR-method for computing the singular values via semiseparable matrices

DOI10.1007/S00211-004-0550-9MaRDI QIDQ706231zbMATHOpenAlexFDO

Authors Raf Vandebril, Marc van Barel, Nicola Mastronardi

Publication date 8 February 2005

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00211-004-0550-9

zbMATH Keywords

iterative algorithmsingular value decompositionnumerical experimentssemiseparable matricesQR-methodorthogonal transformtions

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Recommendations

• Using semiseparable matrices to compute the SVD of a general matrix product/quotient
• An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
• scientific article; zbMATH DE number 5527834
• More accurate bidiagonal reduction for computing the singular value decomposition
• A Lanczos-like reduction of symmetric structured matrices to semiseparable form

Cites work

• scientific article; zbMATH DE number 1012640 (Why is no real title available?)
• scientific article; zbMATH DE number 1793704 (Why is no real title available?)
• scientific article; zbMATH DE number 953050 (Why is no real title available?)
• A note on the representation and definition of semiseparable matrices
• Accurate Singular Values of Bidiagonal Matrices
• An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
• An implicit QR algorithm for symmetric semiseparable matrices
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• Chasing Algorithms for the Eigenvalue Problem
• Convergence of algorithms of decomposition type for the eigenvalue problem
• Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
• Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
• Linear complexity algorithm for semiseparable matrices
• Linear complexity algorithms for semiseparable matrices
• On Rank-Revealing Factorisations
• Some Applications of the Rank Revealing QR Factorization
• Some algorithms for solving special tridiagonal block Toeplitz linear systems
• The Interplay of Ranks of Submatrices
• The QLP Approximation to the Singular Value Decomposition
• Theory of Decomposition and Bulge-Chasing Algorithms for the Generalized Eigenvalue Problem
• Two fast algorithms for solving diagonal-plus-semiseparable linear systems.

Cited in

(10)

• Exponential dichotomy on the real line: SVD and QR methods
• Fast QR factorization of Cauchy-like matrices
• A Lanczos-like reduction of symmetric structured matrices to semiseparable form
• A block QR algorithm and the singular value decomposition
• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
• An implicit QR algorithm for symmetric semiseparable matrices
• A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
• Using semiseparable matrices to compute the SVD of a general matrix product/quotient
• The QIF Singular Value Decomposition Method
• A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices

Describes a project that uses

Uses Software

• SVDMAN

This page was built for publication: A QR-method for computing the singular values via semiseparable matrices

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