An Improved Algorithm for Computing the Singular Value Decomposition
From MaRDI portal
Cited in
(37)- Vector versions of Prony's algorithm and vector-valued rational approximations
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
- Direction of arrival tracking for signals with known waveforms based on block least squares techniques
- Bidiagonalization and diagonalization
- BLOCK-JACOBI SVD ALGORITHMS FOR DISTRIBUTED MEMORY SYSTEMS I: HYPERCUBES AND RINGS*
- Implicitly-weighted total least squares
- A gradient-type algorithm optimizing the coupling between matrices
- The matrix nearness problem for symmetric matrices associated with the matrix equation \([A^{T}XA, B^{T}XB] = [C, D]\)
- Fast linear inversion for highly overdetermined inverse scattering problems
- Note on the quadratic convergence of Kogbetliantz's algorithm for computing the singular value decomposition
- An efficient numerical method for condition number constrained covariance matrix approximation
- Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices
- Parametric domain decomposition for accurate reduced order models: applications of MP-LROM methodology
- Large scale least squares scattered data fitting
- A new stable bidiagonal reduction algorithm
- One-sided reduction to bidiagonal form
- A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices
- Split-and-combine singular value decomposition for large-scale matrix
- Partial singular value decomposition algorithm
- Comparison of total least squares and instrumental variable methods for parameter estimation of transfer function models
- Partial total least squares algorithm
- Tangent estimation from point samples
- A note on the recursive calculation of dominant singular subspaces
- A contribution to the theory and practice of the block Kogbetliantz method for computing the SVD
- Systolic SVD and QR Decomposition by Householder Reflections
- Two-dimensional DOA estimation by cross-correlation matrix stacking
- Data Driven Modal Decompositions: Analysis and Enhancements
- Squeezing the most out of eigenvalue solvers on high-performance computers
- 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
- A triangular processor array for computing singular values
- The ERES method for computing the approximate GCD of several polynomials
- scientific article; zbMATH DE number 1138082 (Why is no real title available?)
- Linear convergence of the row cyclic Jacobi and Kogbetliantz methods
- Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
- Parallel codes for computing the numerical rank
- The singular value decomposition: anatomy of optimizing an algorithm for extreme scale
This page was built for publication: An Improved Algorithm for Computing the Singular Value Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3935379)
