Abstract:This paper studies algorithms for computing the minimal monomial basis for multivariate Birkhoff interpolation problems. Our approach is built around the notion of a reverse reduced set, which serves as the key tool for bridging the interpolation conditions to the monomial basis, thereby avoiding the construction and evaluation of Vandermonde matrices required in existing algorithms. For the single-node case, we prove that after Gaussian elimination on the incidence matrix, the least monomials of the polynomial set corresponding to the interpolation conditions precisely constitute the minimal monomial basis. To handle the multi-node case, we exploit the one-to-one correspondence between interpolation functionals and formal power series, whereby interpolation conditions at arbitrary nonzero nodes can all be converted to the origin. This provides both a coherent theoretical framework and a constructive algorithm for determining a proper minimal monomial basis for the general multivariate Birkhoff interpolation problem. Numerical examples demonstrate the effectiveness of the proposed algorithm.
From: Xue Jiang [view email]
[v1]
Tue, 23 Jun 2026 01:53:39 UTC (19 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。