An efficient method of spline approximation for power function
Petro Kolosov
TL;DR
This work introduces $P(m,X,N)$, an $m$-degree polynomial in $X$ derived from a Faulhaber-based rearrangement in Knuth’s framework, which can exactly represent $X^{2m+1}$ when evaluated at $X$ itself ($P(m,X,X)=X^{2m+1}$). It shows that $P(m,X,N)$ can approximate odd powers near a fixed integer $N$ with errors under $1\%$, and that enlarging $N$ increases the convergence interval; it also extends the approach to even powers via multiplication by $X$. The paper generalizes to arbitrary exponents $j$ using spline constructions, yielding piecewise approximations with controllable accuracy over user-defined intervals, demonstrated with explicit $j=3$ and $j=4$ splines on $[10,15]$. This yields an efficient, tunable framework for accurate low-degree polynomial approximations of power functions, with potential benefits for numerical computations requiring controlled interval coverage and error bounds.
Abstract
Let $P(m, X, N)$ be an $m$-degree polynomial in $X\in\mathbb{R}$ having fixed non-negative integers $m$ and $N$. The polynomial $P(m, X, N)$ is derived from a rearrangement of Faulhaber's formula in the context of Knuth's work entitled "Johann Faulhaber and sums of powers". In this manuscript we discuss the approximation properties of polynomial $P(m,X,N)$. In particular, the polynomial $P(m,X,N)$ approximates the odd power function $X^{2m+1}$ in a certain neighborhood of a fixed non-negative integer $N$ with a percentage error under $1\%$. By increasing the value of $N$ the length of convergence interval with odd-power $X^{2m+1}$ also increases. Furthermore, this approximation technique is generalized for arbitrary non-negative exponent $j$ of the power function $X^j$ by using splines.
