A power method for computing singular value decomposition

DOI10.1016/J.CAM.2026.117451MaRDI QIDQ7257072zbMATH OpenFDO

Authors Doulaye Dembélé

Publication date 3 June 2026

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.CAM.2026.117451

zbMATH Keywords

autoencodersingular valuesneural networkpower methodsingular vectorseigen values

Mathematics Subject Classification ID

Basic linear algebra (15Axx) Artificial intelligence (68Txx) Numerical linear algebra (65Fxx)

Cites work

• scientific article; zbMATH DE number 1460605 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A Chebyshev–Davidson Algorithm for Large Symmetric Eigenproblems
• A Survey of Eigenvector Methods for Web Information Retrieval
• A method for computing the Perron root for primitive matrices
• A simplified neuron model as a principal component analyzer
• An interval perturbation method for singular value decomposition (SVD) with unknown-but-bounded (UBB) parameters
• Analysis of a complex of statistical variables into principal components.
• Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
• Auto-association by multilayer perceptrons and singular value decomposition
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• Computing the singular value decomposition with high relative accuracy
• Convex set-oriented singular value decomposition with bounded uncertainties
• Eigenvalue computation in the 20th century
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• Fast monte-carlo algorithms for finding low-rank approximations
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• Iterative refinement for singular value decomposition based on matrix multiplication
• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
• On the Early History of the Singular Value Decomposition
• Pattern recognition and machine learning.
• Preconditioned Gradient-Type Iterative Methods in a Subspace for Partial Generalized Symmetric Eigenvalue Problems
• Randomized algorithms for the low-rank approximation of matrices
• Subspace Iteration Randomization and Singular Value Problems
• The approximation of one matrix by another of lower rank.
• The principle of minimized iterations in the solution of the matrix eigenvalue problem

This page was built for publication: A power method for computing singular value decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7257072)