.png){kind=icon}
.png){kind=icon}
Return
A nested Bernstein form approximation method by interval partitioning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jmaa.2025.130192.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
For a real valued continuous function, we propose a Bernstein form approximation method based on dividing a given interval. We employ traditional Bernstein polynomials on the divided subintervals, and then use a sigmoid function to smoothly combine Bernstein polynomials at the matching endpoints of the subintervals. In general, for any integer p >= 1, we develop p-fold nested Bernstein form approximation method by repeating this approximation process. We prove the asymptotic uniform convergence of the proposed method and its derivatives for sufficiently large order of the sigmoid function used, as well as the asymptotic interpolation property at division nodes. The usefulness of the proposed method is demonstrated through numerical implementations on some selected test functions. (c) 2025 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
Keywords:
Bernstein polynomial
Weierstrass approximation theorem
Sigmoid function
Nested Bernstein form approximation
Interval partitioning
Journal
J
IF:
1.2
Papers:
418
Citations:
0