arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.16337math.NAcs.NAmath.OC
收藏

关于热带离散最佳逼近问题的求解

On solution of tropical discrete best approximation problems

Nikolai Krivulin

AI总结:

研究热带代数框架下的离散最佳逼近问题,通过基于凝聚聚类的计算过程求解系数与指数,并应用于实函数的 Chebyshev 逼近。

摘要:

我们考虑一个在热带代数框架下表述的离散最佳逼近问题,热带代数处理具有幂等运算的代数系统的理论与应用。给定一个未知函数的输入和输出样本集合,问题是构造一个广义热带 Puiseux 多项式,使其在热带距离函数的意义下最佳逼近该函数。近似多项式的构造涉及对多项式中每个单项式的未知系数和指数的评估。为了求解该逼近问题,我们首先将其转化为关于未知系数向量的方程,该方程由一个元素以未知指数为参数的矩阵给出。我们推导了该方程的最佳近似解,由此得到了系数向量和以指数为参数的逼近误差。通过最小化逼近误差,找到指数的最优值,这被转化为在有限集合的所有划分上对指数函数的最小化问题。我们利用基于凝聚聚类技术的计算过程,以 max-plus 代数(其中加法定义为取最大值,乘法定义为算术加法)的形式求解了该最小化问题。该解被扩展到以 max-代数(其中加法定义为取最大值)形式求解多项式中寻找最优指数的最小化问题。所获结果被应用于为实函数的分段线性函数和分段 Puiseux 多项式的离散最佳 Chebyshev 逼近等传统问题开发新解。我们讨论了所提解的计算复杂度,并估计了计算时间的上界。我们展示了以 max-plus 和 max-代数形式求解逼近问题的实例。

英文摘要:

We consider a discrete best approximation problem formulated in the framework of tropical algebra, which deals with the theory and applications of algebraic systems with idempotent operations. Given a set of samples of input and output of an unknown function, the problem is to construct a generalized tropical Puiseux polynomial that best approximates the function in the sense of a tropical distance function. The construction of an approximate polynomial involves the evaluation of both unknown coefficient and exponent of each monomial in the polynomial. To solve the approximation problem, we first reduce the problem to an equation in unknown vector of coefficients, which is given by a matrix with entries parameterized by unknown exponents. We derive a best approximate solution of the equation, which yields both vector of coefficients and approximation error parameterized by the exponents. Optimal values of exponents are found by minimization of the approximation error, which is transformed into minimization of a function of exponents over all partitions of a finite set. We solve this minimization problem in terms of max-plus algebra (where addition is defined as maximum and multiplication as arithmetic addition) by using a computational procedure based on the agglomerative clustering technique. This solution is extended to the minimization problem of finding optimal exponents in the polynomial in terms of max-algebra (where addition is defined as maximum). The results obtained are applied to develop new solutions for conventional problems of discrete best Chebyshev approximation of real functions by piecewise linear functions and piecewise Puiseux polynomials. We discuss computational complexity of the proposed solution and estimate upper bounds on the computational time. We demonstrate examples of approximation problems solved in terms of max-plus and max-algebra.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑