On the optimal rank-1 approximation of matrices in the Chebyshev norm

DOI10.1016/j.laa.2023.09.007zbMath1528.65026arXiv2212.01438MaRDI QIDQ6084872

Nikolai L. Zamarashkin, Matvey Smirnov, Stanislav Morozov

Publication date: 6 November 2023

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

Full work available at URL: https://arxiv.org/abs/2212.01438

zbMATH Keywords

alternating minimizationChebyshev normlow-rank matrix approximations

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Related Items (1)

On the distance to low-rank matrices in the maximum norm

Cites Work

• Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
• Musings on multilinear fitting
• On the best approximation algorithm by low-rank matrices in Chebyshev's norm
• Low-rank matrix approximation in the infinity norm
• Reducibility Among Combinatorial Problems
• Why Are Big Data Matrices Approximately Low Rank?
• Uniform approximation of a function of two variables, tabulated as the product of functions of a single variable

This page was built for publication: On the optimal rank-1 approximation of matrices in the Chebyshev norm