An Improved Algorithm for Computing the Singular Value Decomposition
From MaRDI portal
Publication:3935379
DOI10.1145/355984.355990zbMath0477.65032OpenAlexW2117026915WikidataQ57397485 ScholiaQ57397485MaRDI QIDQ3935379
Publication date: 1982
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/355984.355990
singular value decompositioncomparisonsHouseholder transformationsGivens transformationsGolub-Reinsch algorithmEISPACK SVD routine
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Computer aspects of numerical algorithms (65Y99) Software, source code, etc. for problems pertaining to numerical analysis (65-04)
Related Items
Unnamed Item, Systolic SVD and QR Decomposition by Householder Reflections, Split-and-combine singular value decomposition for large-scale matrix, Data Driven Modal Decompositions: Analysis and Enhancements, Parametric domain decomposition for accurate reduced order models: applications of MP-LROM methodology, An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values, Bidiagonalization and diagonalization, The partial total least squares algorithm, Partial singular value decomposition algorithm, Tangent estimation from point samples, The Singular Value Decomposition: Anatomy of Optimizing an Algorithm for Extreme Scale, The matrix nearness problem for symmetric matrices associated with the matrix equation \([A^{T}XA, B^{T}XB = [C, D]\)], Note on the quadratic convergence of Kogbetliantz's algorithm for computing the singular value decomposition, Two-dimensional DOA estimation by cross-correlation matrix stacking, Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices, A gradient-type algorithm optimizing the coupling between matrices, Vector versions of Prony's algorithm and vector-valued rational approximations, An efficient numerical method for condition number constrained covariance matrix approximation, Direction of arrival tracking for signals with known waveforms based on block least squares techniques, A contribution to the theory and practice of the block Kogbetliantz method for computing the SVD, Implicitly-weighted total least squares, The ERES method for computing the approximate GCD of several polynomials, A note on the recursive calculation of dominant singular subspaces, A new stable bidiagonal reduction algorithm, Fast linear inversion for highly overdetermined inverse scattering problems, A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices, Partial total least squares algorithm, Linear convergence of the row cyclic Jacobi and Kogbetliantz methods, Comparison of total least squares and instrumental variable methods for parameter estimation of transfer function models, Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases, Parallel codes for computing the numerical rank, One-sided reduction to bidiagonal form, Large scale least squares scattered data fitting, BLOCK-JACOBI SVD ALGORITHMS FOR DISTRIBUTED MEMORY SYSTEMS I: HYPERCUBES AND RINGS*, Squeezing the most out of eigenvalue solvers on high-performance computers, A triangular processor array for computing singular values
Uses Software
