One-sided reduction to bidiagonal form
type: Item
instance of: scholarly article
title: One-sided reduction to bidiagonal form
zbMATH Open document ID: 1035.65045
DOI: 10.1016/S0024-3795(01)00569-9
author: Rui Ralha
published in: Linear Algebra and its Applications
publication date: 2003-02-05T00:00:00Z
review text: The author presents an idea for reducing a rectangular matrix \(A\) to bidiagonal form which is based on the implicit reduction of the symmetric positive semidefinite matrix \(A^t A\) to tridiagonal form. A method based upon this idea may become a serious competitor (in terms of speed) for computing the singular values of large matrices and it is well suited for parallel processing. He gives also numerical evidence of the ability of his algorithm to accurately reduce to bidiagonal form \(A = DX\), where \(D\) is diagonal and \(X\) is wellconditioned.
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 15A21
Mathematics Subject Classification ID: 65F20
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 1864798
zbMATH Keywords: reduction to bidiagonal form
zbMATH Keywords: rectangular matrix
zbMATH Keywords: singular values
zbMATH Keywords: parallel processing
zbMATH Keywords: algorithm
reviewed by: Stanislav Míka
MaRDI profile type: Publication
cites work: Computing Accurate Eigensystems of Scaled Diagonally Dominant Matrices
cites work: More accurate bidiagonal reduction for computing the singular value decomposition
cites work: Solving linear least squares problems by Gram-Schmidt orthogonalization
cites work: Loss and Recapture of Orthogonality in the Modified Gram–Schmidt Algorithm
cites work: Numerics of Gram-Schmidt orthogonalization
cites work: Q4868585
cites work: An Improved Algorithm for Computing the Singular Value Decomposition
cites work: Rang revealing QR factorizations
cites work: Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
cites work: Accurate Singular Values of Bidiagonal Matrices
cites work: Jacobi’s Method is More Accurate than QR
cites work: Q4348513
cites work: Accurate singular values and differential qd algorithms
cites work: Calculating the Singular Values and Pseudo-Inverse of a Matrix
cites work: Singular value decomposition and least squares solutions
cites work: Q3359644
cites work: Algorithm 694
cites work: Iterative algorithms for Gram-Schmidt orthogonalization
cites work: Q4868577
cites work: An efficient and accurate parallel algorithm for the singular value problem of bidiagonal matrices
cites work: Accurate Eigensystem Computations by Jacobi Methods
cites work: A new look at the Lanczos algorithm for solving symmetric systems of linear equations
cites work: Experiments on Gram-Schmidt Orthogonalization
cites work: Numerical aspects of Gram-Schmidt orthogonalization of vectors
cites work: Tridiagonalization of a symmetric band matrix
cites work: Q5674306
description: scientific article; zbMATH DE number 1864798