Enhancing polynomial approximation of continuous functions by composition with homeomorphisms
Álvaro Fernández Corral, Yahya Saleh
TL;DR
The paper develops a theory showing that composing polynomials with a homeomorphism induces dense sets in C(Omega) and enables finite-degree polynomials to approximate broad classes of continuous functions, especially those with finitely many local extrema. It proves existence (and minimal degree) results for univariate approximations p ∘ h with degree M+1 and demonstrates that h can be represented by invertible neural networks in practice. Numerical experiments validate the theory across univariate cases with one or multiple extrema and extend to higher-dimensional problems, including 2-D fitting and potential energy surface modeling, where the induced dense sets yield large accuracy gains with far fewer basis functions. The framework offers a principled approach to overcoming dimensionality challenges in polynomial approximation, with concrete benefits for molecular PES computations and related applications.
Abstract
We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate approximations. For univariate continuous functions exhibiting a finite number of local extrema, we prove that there exist a polynomial of finite degree and a homeomorphism whose composition approximates the target function to arbitrary accuracy. The construction is especially relevant for multivariate approximation problems, where standard numerical methods often suffer from the curse of dimensionality. To support our theoretical results, we investigate both regression tasks and the construction of molecular potential-energy surfaces, parametrizing the underlying homeomorphism using invertible neural networks. The numerical experiments show strong agreement with our theoretical analysis.
