Abstract
For an arbitrary matrix, we prove the existence of a skeleton approximation of rank r whose accuracy estimate is only r + 1 times worse than the estimate of the optimal approximation of rank r in the Frobenius norm.
Similar content being viewed by others
References
I. Oseledets and E. Tyrtyshnikov, Linear Algebra Appl. 432 (1), 70–88 (2010).
A. V. Sulimov, D. A. Zheltkov, I. V. Oferkin, D. C. Kutov, E. V. Katkova, E. E. Tyrtyshnikov, and V. B. Sulimov, Comput. Struct. Biotechnol. J. 15, 275–285 (2017).
S. A. Goreinov and E. E. Tyrtyshnikov, Contemp. Math. 208, 47–51 (1997).
A. I. Osinsky and N. L. Zamarashkin, Linear Algebra Appl. 537, 221–249 (2018).
N. L. Zamarashkin and A. I. Osinskii, Dokl. Math. 94 (3), 643–645 (2016).
E. Tyrtyshnikov, Computing 64 (4), 367–380 (2000).
A. Deshpande, L. Rademacher, S. Vempala, and G. Wang, Theory Comput. 2, 225–247 (2006).
A. Deshpande and L. Rademacher, IEEE 51st Annual Symposium on Foundations of Computer Science (2010), pp. 329–338.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © N.L. Zamarashkin, A.I. Osinsky, 2018, published in Doklady Akademii Nauk, 2018, Vol. 479, No. 5, pp. 489–492.
Rights and permissions
About this article
Cite this article
Zamarashkin, N.L., Osinsky, A.I. On the Existence of a Nearly Optimal Skeleton Approximation of a Matrix in the Frobenius Norm. Dokl. Math. 97, 164–166 (2018). https://doi.org/10.1134/S1064562418020205
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064562418020205