Refining uniform approximation algorithm for low-rank Chebyshev embeddings

DOI10.1515/RNAM-2024-0027MaRDI QIDQ6636772FDOQ6636772

Authors: Stanislav Morozov, D. A. Zheltkov, Alexander Osinsky 

Publication date: 12 November 2024

Published in: Russian Journal of Numerical Analysis and Mathematical Modelling (Search for Journal in Brave)

Recommendations

• On the best approximation algorithm by low-rank matrices in Chebyshev's norm
• On the optimal rank-1 approximation of matrices in the Chebyshev norm
• On best uniform approximation by low-rank matrices
• On low rank approximation of linear operators in \(p\)-norms and some algorithms
• Novel alternating update method for low rank approximation of structured matrices

zbMATH Keywords

uniform approximationalternating minimizationChebyshev norm

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites Work

• Why Are Big Data Matrices Approximately Low Rank?
• Title not available (Why is that?)
• A fast numerical method for the Cauchy problem for the Smoluchowski equation
• Title not available (Why is that?)
• On the best approximation algorithm by low-rank matrices in Chebyshev's norm
• Low-rank matrix approximation in the infinity norm
• Uniform approximation of a function of two variables, tabulated as the product of functions of a single variable
• On the optimal rank-1 approximation of matrices in the Chebyshev norm
• On the distance to low-rank matrices in the maximum norm

Cited In (1)

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

This page was built for publication: Refining uniform approximation algorithm for low-rank Chebyshev embeddings

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