A minimum norm approach for low-rank approximations of a matrix
DOI10.1016/J.CAM.2010.02.002zbMATH Open1196.65077OpenAlexW2085999947MaRDI QIDQ989119FDOQ989119
Authors: Achiya Dax 
Publication date: 27 August 2010
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.2010.02.002
Recommendations
convergencenumerical experimentslow-rank approximationspower methoddominant eigenvectorline search accelerationdominant pair of singular vectorsFrobenius matrix normlarge scale matrix computationsminimum norm approachorthogonalization via deflationpoint relaxationrectangular iterations
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Cites Work
- Title not available (Why is that?)
- Algorithms and applications for approximate nonnegative matrix factorization
- Learning the parts of objects by non-negative matrix factorization
- Title not available (Why is that?)
- Matrix algorithms. Vol. 2: Eigensystems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some New Methods in Matrix Calculation
- A Survey of Eigenvector Methods for Web Information Retrieval
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Iteration Methods for Nonlinear Problems
- The Convergence of Linear Stationary Iterative Processes for Solving Singular Unstructured Systems of Linear Equations
- Nonnegative matrix factorization for spectral data analysis
- Line search acceleration of iterative methods
- Estimating the Largest Eigenvalue of a Positive Definite Matrix
- Nonlinear Generalizations of Matrix Diagonal Dominance with Application to Gauss–Seidel Iterations
- Orthogonalization Via Deflation: A Minimum Norm Approach for Low-Rank Approximations of a Matrix
- Global Convergence of Newton–Gauss–Seidel Methods
- A simultaneous reconstruction of missing data in DNA microarrays
- Title not available (Why is that?)
- Relaxation Methods for Convex Problems
- Rates of Convergence for a Class of Iterative Procedures
Cited In (7)
- Approximating minimum norm solutions of rank-deficient least squares problems
- Low rank approximation of a Hankel matrix by structured total least norm
- Minimum rank Hermitian solution to the matrix approximation problem in the spectral norm and its application
- Orthogonalization Via Deflation: A Minimum Norm Approach for Low-Rank Approximations of a Matrix
- An approximation theory of matrix rank minimization and its application to quadratic equations
- Low-Rank Matrix Approximations Do Not Need a Singular Value Gap
- On low rank approximation of linear operators in \(p\)-norms and some algorithms
Uses Software
This page was built for publication: A minimum norm approach for low-rank approximations of a matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989119)
