Partial singular value decomposition algorithm
From MaRDI portal
Publication:2641073
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
Cites work
- scientific article; zbMATH DE number 3748409 (Why is no real title available?)
- 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
- Basic Linear Algebra Subprograms for Fortran Usage
- 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
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- On condition numbers of the total least squares problem with linear equality constraint
- A Simple SVD Algorithm for Finding Hidden Partitions
- 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
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)