A minimum norm approach for low-rank approximations of a matrix

DOI10.1016/J.CAM.2010.02.002MaRDI QIDQ989119zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

convergencenumerical experimentslow-rank approximationspower methoddominant eigenvectorline search accelerationdominant pair of singular vectorsFrobenius matrix normlarge scale matrix computationsminimum norm approachorthogonalization via deflationpoint relaxationrectangular iterations

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Recommendations

• scientific article; zbMATH DE number 741152
• scientific article; zbMATH DE number 89042
• A Schur Method for Low-Rank Matrix Approximation
• Generalized low rank approximations of matrices
• Minimum rank solutions to the matrix approximation problems in the spectral norm

Cites work

• scientific article; zbMATH DE number 3540601 (Why is no real title available?)
• scientific article; zbMATH DE number 1049347 (Why is no real title available?)
• scientific article; zbMATH DE number 1148205 (Why is no real title available?)
• scientific article; zbMATH DE number 852536 (Why is no real title available?)
• scientific article; zbMATH DE number 3892457 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• scientific article; zbMATH DE number 3325215 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• A Survey of Eigenvector Methods for Web Information Retrieval
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• A simultaneous reconstruction of missing data in DNA microarrays
• Algorithms and applications for approximate nonnegative matrix factorization
• Estimating the Largest Eigenvalue of a Positive Definite Matrix
• Global Convergence of Newton–Gauss–Seidel Methods
• Iteration Methods for Nonlinear Problems
• Learning the parts of objects by non-negative matrix factorization
• Line search acceleration of iterative methods
• Matrix algorithms. Vol. 2: Eigensystems
• Nonlinear Generalizations of Matrix Diagonal Dominance with Application to Gauss–Seidel Iterations
• Nonnegative matrix factorization for spectral data analysis
• Orthogonalization Via Deflation: A Minimum Norm Approach for Low-Rank Approximations of a Matrix
• Rates of Convergence for a Class of Iterative Procedures
• Relaxation Methods for Convex Problems
• Some New Methods in Matrix Calculation
• The Convergence of Linear Stationary Iterative Processes for Solving Singular Unstructured Systems of Linear Equations

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
• An approximation theory of matrix rank minimization and its application to quadratic equations
• Orthogonalization Via Deflation: A Minimum Norm Approach for Low-Rank Approximations of a Matrix
• Low-Rank Matrix Approximations Do Not Need a Singular Value Gap
• On low rank approximation of linear operators in \(p\)-norms and some algorithms

Describes a project that uses

Uses Software

• impute

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)