Partial singular value decomposition algorithm
DOI10.1016/0377-0427(90)90260-7zbMATH Open0721.65016OpenAlexW1561569551MaRDI QIDQ2641073FDOQ2641073
Authors: Sabine Van Huffel 
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
Recommendations
- An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values
- Gradient-Type Algorithms for Partial Singular Value Decomposition
- Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values
- scientific article; zbMATH DE number 3886984
- scientific article; zbMATH DE number 663830
total least squaresnull spacepartial singular value decomposition algorithmleft/right singular subspaceslibrary description
Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Cites Work
- Title not available (Why is that?)
- Basic Linear Algebra Subprograms for Fortran Usage
- An Improved Algorithm for Computing the Singular Value Decomposition
- 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
Cited In (10)
- A hybrid method for computing the intersection and tangency points of plane curves
- An ensemble-proper orthogonal decomposition method for the nonstationary Navier-Stokes equations
- Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming
- On the computation of the rank of block bidiagonal Toeplitz matrices
- A Simple SVD Algorithm for Finding Hidden Partitions
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- On condition numbers of the total least squares problem with linear equality constraint
- The Weierstrass Canonical Form of a Regular Matrix Pencil: Numerical Issues and Computational Techniques
- The ERES method for computing the approximate GCD of several polynomials
- On rank and null space computation of the generalized Sylvester matrix
Uses Software
This page was built for publication: Partial singular value decomposition algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641073)
