Rank-One Approximation of Positive Matrices Based on Methods of Tropical Mathematics


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

Low-rank matrix approximation finds wide application in the analysis of big data, in recommendation systems on the Internet, for the approximate solution of some equations of mechanics, and in other fields. In this paper, a method for approximating positive matrices by rank-one matrices on the basis of minimization of log-Chebyshev distance is proposed. The problem of approximation reduces to an optimization problem having a compact representation in terms of an idempotent semifield in which the operation of taking the maximum plays the role of addition and which is often referred to as max-algebra. The necessary definitions and preliminary results of tropical mathematics are given, on the basis of which the solution of the original problem is constructed. Using the methods and results of tropical optimization, all positive matrices at which the minimum of approximation error is reached are found in explicit form. A numerical example illustrating the application of the rank-one approximation is considered.

作者简介

N. Krivulin

Saint Petersburg State University

编辑信件的主要联系方式.
Email: nkk@math.spbu.ru
俄罗斯联邦, St. Petersburg, 199034

E. Romanova

Saint Petersburg State University

Email: nkk@math.spbu.ru
俄罗斯联邦, St. Petersburg, 199034

补充文件

附件文件
动作
1. JATS XML

版权所有 © Allerton Press, Inc., 2018