On Low Rank Approximation of Linear Operators in p-Norms and Some Algorithms

DOI10.1142/S0217595916500238zbMath1416.65523MaRDI QIDQ2821088

Yang Liu

Publication date: 16 September 2016

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

matricesnormed spacessingular valuesoperator theory

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical methods for integral transforms (65R10) Matrix completion problems (15A83)

Cites Work

• Unnamed Item
• A fast randomized algorithm for the approximation of matrices
• Randomized algorithms for the low-rank approximation of matrices
• Matrix p-Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$
• Decoding by Linear Programming
• The probabilistic estimates on the largest and smallest $q$-singular values of random matrices
• History of Banach Spaces and Linear Operators
• A Theorem of the Hahn-Banach Type for Linear Transformations

This page was built for publication: On Low Rank Approximation of Linear Operators in p-Norms and Some Algorithms