A contribution to the theory and practice of the block Kogbetliantz method for computing the SVD
type: Item
instance of: scholarly article
title: A contribution to the theory and practice of the block Kogbetliantz method for computing the SVD
zbMATH Open document ID: 1264.65059
author: Zvonimir Bujanović
author: Zlatko Drmač
published in: BIT
publication date: 2012-12-20T00:00:00Z
review text: The Kogbetliantz method is a procedure considered for the singular value decompositon (SVD). It generalizes the Jacobi diagonalization method (initially just for symmetric matrices). Although this method showed a promising potential on parallel computation, a theoretical convergence of the block algorithm was missing up to this paper. The quadratic convergence of the block version of the Kogbetliantz method is proved. Consistent examples and implementation remarks are provided.
reviewed by: Ştefan M. Şoltuz
Mathematics Subject Classification ID: 65F20
Mathematics Subject Classification ID: 15A18
zbMATH DE Number: 6117466
zbMATH Keywords: Kogbetliantz method
zbMATH Keywords: singular value decomposition
zbMATH Keywords: convergence
zbMATH Keywords: numerical examples
zbMATH Keywords: Jacobi diagonalization method
zbMATH Keywords: parallel computation
describes a project that uses: LAPACK
describes a project that uses: CLAPACK
MaRDI profile type: Publication
full work available at URL: s10543-012-0388-y
OpenAlex ID: W2006514326
cites work: Q4841244
cites work: Note on the quadratic convergence of Kogbetliantz's algorithm for computing the singular value decomposition
cites work: More accurate bidiagonal reduction for computing the singular value decomposition
cites work: Computing Accurate Eigensystems of Scaled Diagonally Dominant Matrices
cites work: Dynamic ordering for a parallel block-Jacobi SVD algorithm
cites work: Q3730938
cites work: Handbook series linear algebra. Linear least squares solutions by Householder transformations
cites work: Convergence of approximate eigenvectors in Jacobi methods
cites work: An Improved Algorithm for Computing the Singular Value Decomposition
cites work: On efficient implementations of Kogbetliantz's algorithm for computing the singular value decomposition
cites work: Jacobi’s Method is More Accurate than QR
cites work: A Global Convergence Proof for Cyclic Jacobi Methods with Block Rotations
cites work: New Fast and Accurate Jacobi SVD Algorithm. I
cites work: New Fast and Accurate Jacobi SVD Algorithm. II
cites work: Linear convergence of the row cyclic Jacobi and Kogbetliantz methods
cites work: The Cyclic Jacobi Method for Computing the Principal Values of a Complex Matrix
cites work: On the Quadratic Convergence of the Serial Singular Value Decomposition Jacobi Methods for Triangular Matrices
cites work: On Jacobi Methods for Singular Value Decompositions
cites work: Q5422038
cites work: Solution of linear equations by diagonalization of coefficients matrix
cites work: A triangular processor array for computing singular values
cites work: On Parallel Jacobi Orderings
cites work: Accuracy of the Kogbetliantz method for scaled diagonally dominant triangular matrices
cites work: Special Issue: A systolic block-Jacobi SVD solver for processor meshes
cites work: Computing the Generalized Singular Value Decomposition
cites work: On the quadratic convergence of Kogbetliantz's algorithm for computing the singular value decomposition
cites work: History and generality of the CS decomposition
cites work: Computing the CS decomposition of a partitioned orthonormal matrix
cites work: A Jacobi-Like Algorithm for Computing the Schur Decomposition of a Nonhermitian Matrix
cites work: The QLP Approximation to the Singular Value Decomposition
cites work: Q3998482
DOI: 10.1007/S10543-012-0388-Y
description: scientific article; zbMATH DE number 6117466