How different is rational approximation from piecewise polynomial approximation?
Abstract
The first aim of this paper is to show that there is merit to the question posed in the title. Indeed, for certain function classes, approximation by rational functions and by piecewise polynomials are surprisingly similar. Between these two, polynomials are more widely studied and more widely used. One setting in which both approaches are equally well understood, and equally practical in use, is that of approximating univariate functions with point singularities. In this context we can fully ad...
Description / Details
The first aim of this paper is to show that there is merit to the question posed in the title. Indeed, for certain function classes, approximation by rational functions and by piecewise polynomials are surprisingly similar. Between these two, polynomials are more widely studied and more widely used. One setting in which both approaches are equally well understood, and equally practical in use, is that of approximating univariate functions with point singularities. In this context we can fully address the question. We review classical literature on the topic which shows that both approaches do indeed achieve similar convergence rates. However, rational approximations come with significantly smaller constants. Owing to recent advances in practical rational approximation, we can augment the discussion with a comparison of modern numerical techniques that achieve the optimal rates. We end by showing numerically that the difference becomes even more pronounced in several variables.
Source: arXiv:2608.11120v1 - http://arxiv.org/abs/2608.11120v1 PDF: https://arxiv.org/pdf/2608.11120v1 Original Link: http://arxiv.org/abs/2608.11120v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Aug 12, 2026
Mathematics
Mathematics
0