Generalized low rank approximations of matrices

From MaRDI portal





The author describes a novel approach to evaluate the expensive computation of the singular value decompositions for the low rank approximations of matrices. The problem is formulated as an optimization one, which approximates a collection of matrices with matrices of lower rank. An iterative algorithm is derived in this sense and a performance study presented.




Cited in
(69)


Describes a project that uses

Uses Software






This page was built for publication: Generalized low rank approximations of matrices

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