Partial singular value decomposition algorithm
From MaRDI portal
Publication:2641073
DOI10.1016/0377-0427(90)90260-7zbMath0721.65016OpenAlexW1561569551MaRDI QIDQ2641073
Publication date: 1990
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(90)90260-7
null spacetotal least squarespartial singular value decomposition algorithmleft/right singular subspaceslibrary description
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Related Items
On condition numbers of the total least squares problem with linear equality constraint ⋮ An implicitly restarted block Lanczos bidiagonalization method using Leja shifts ⋮ Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming ⋮ An Ensemble-Proper Orthogonal Decomposition Method for the Nonstationary Navier--Stokes Equations ⋮ A hybrid method for computing the intersection and tangency points of plane curves ⋮ The ERES method for computing the approximate GCD of several polynomials ⋮ On rank and null space computation of the generalized Sylvester matrix ⋮ The Weierstrass Canonical Form of a Regular Matrix Pencil: Numerical Issues and Computational Techniques ⋮ On the computation of the rank of block bidiagonal Toeplitz matrices
Uses Software
Cites Work
- Unnamed Item
- An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values
- The partial total least squares algorithm
- An Improved Algorithm for Computing the Singular Value Decomposition
- Basic Linear Algebra Subprograms for Fortran Usage
This page was built for publication: Partial singular value decomposition algorithm