On best rank \(n\) matrix approximations

DOI10.1016/j.laa.2012.05.016zbMath1251.15027OpenAlexW2116488529MaRDI QIDQ448365

Allan Pinkus

Publication date: 6 September 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2012.05.016

zbMATH Keywords

totally positive matricesrank \(n\) approximationrow and column interpolation

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Positive matrices and their generalizations; cones of matrices (15B48) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items

On best uniform approximation by low-rank matrices ⋮ A ROM-accelerated parallel-in-time preconditioner for solving all-at-once systems in unsteady convection-diffusion PDEs ⋮ Best Low-rank Approximations and Kolmogorov $n$-widths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Error estimates for two-dimensional cross approximation
• Perfect splines of minimum norm for monotone norms and norms induced by inner products, with applications to tensor product approximations and n- widths of integral operators
• Some problems in the approximation of functions of two variables and n- widths of integral operators
• s-Numbers of operators in Banach spaces
• A Simple Proof of the Hobby-Rice Theorem
• On n-Widths in L ∞
• On the Early History of the Singular Value Decomposition