The QIF Singular Value Decomposition Method
At first, the author describes the quadrant interlocking factorization (QIF) method for solving systems of linear equations \(Ax=b\) [see also \textit{D. J. Evans} and \textit{M. Hatzopoulos}, Int. J. Comput. Math. 7, 227-238 (1979; Zbl 0442.65019); \textit{D. J. Evans} and \textit{A. Hadjidimos}, Int. J. Comput. Math. 8, 149-166 (1980; Zbl 0439.65017)]. For avoiding a breakdown of the factorization process a strategy based on interchanges of columns of the corresponding matrices is discussed. Finally, an iterative method for computing the singular values of a non-singular matrix is presented. In each iteration step QIF factorizations are used. The presented numerical results show the convergence properties of this algorithm.
- scientific article; zbMATH DE number 176183
- A singular value decomposition algorithm based on solving hyperplane constrained nonlinear systems
- A QR-method for computing the singular values via semiseparable matrices
- scientific article; zbMATH DE number 782062
- On Jacobi Methods for Singular Value Decompositions
- A modification of the quadrant interlocking factorisation parallel method
- A parallel linear system solver
- Further analysis of the quadrant interlocking factorisation (Q.I.F.) method
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- The parallel calculation of the eigenvalues of a real matrix A
This page was built for publication: The QIF Singular Value Decomposition Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4543525)