A One-Sided Jacobi Algorithm for Computing the Singular Value Decomposition on a Vector Computer
Author:
- P. P. M. de RijkPRP. P. M. de Rijk
- 1 March 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 10 (2) , 359-371
Abstract
An old algorithm for computing the singular value decomposition, which was first mentioned by Hestenes [SIAM J. Appl. Math., 6 (1958), pp. 51–90], has gained renewed interest because of its properties of parallelism and vectorizability. Some computational modifications are given and a comparison with the well-known Golub–Reinsch algorithm is made. Comparative experiments on a CYBER 205 are reported.Keywords
This publication has 15 references indexed in Scilit:
- The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor ArraysSIAM Journal on Scientific and Statistical Computing, 1985
- An Improved Algorithm for Computing the Singular Value DecompositionACM Transactions on Mathematical Software, 1982
- LINPACK Users' Guide1979
- A Note on Modifications to the Givens Plane RotationIMA Journal of Applied Mathematics, 1974
- Singular value decomposition and least squares solutionsNumerische Mathematik, 1970
- On the quadratic convergence of the special cyclic Jacobi methodNumerische Mathematik, 1966
- Adaptation of the Jacobi Method for a Computer with Magnetic-tape Backing StoreThe Computer Journal, 1962
- The cyclic Jacobi method for computing the principal values of a complex matrixTransactions of the American Mathematical Society, 1960
- On the Speed of Convergence of Cyclic and Quasicyclic Jacobi Methods for Computing Eigenvalues of Hermitian MatricesJournal of the Society for Industrial and Applied Mathematics, 1958
- Inversion of Matrices by Biorthogonalization and Related ResultsJournal of the Society for Industrial and Applied Mathematics, 1958