Taylor Polynomials in High Arithmetic Precision as Universal Approximators

09/30/2019
by   Nikolaos P. Bakas, et al.
0

Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is demonstrated, by utilizing partial sums of Taylor series in high arithmetic precision. In particular, the proposed method is capable of interpolation, extrapolation, numerical differentiation, numerical integration, solution of ordinary and partial differential equations, and system identification. The method is based on the utilization of Taylor polynomials, by exploiting some hundreds of computer digits, resulting in highly accurate calculations. Interestingly, some well-known problems were found to reason by calculations accuracy, and not methodological inefficiencies, as supposed. In particular, the approximation errors are precisely predictable, the Runge phenomenon is eliminated and the extrapolation extent may a-priory be anticipated. The attained polynomials offer a precise representation of the unknown system as well as its radius of convergence, which provide a rigor estimation of the prediction ability. The approximation errors have comprehensively been analyzed, for a variety of calculation digits and test problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/02/2020

New wavelet method based on Shifted Lucas polynomials: A tau approach

In current work, non-familiar shifted Lucas polynomials are introduced. ...
research
08/03/2020

A new technique to solve linear integro-differential equations (IDEs) with modified Bernoulli polynomials

In this work, a new technique has been presented to find approximate sol...
research
04/13/2023

Application of the Bell polynomials for the solution of some differential-algebraic equations

The differential transform method is used to find numerical approximatio...
research
12/27/2018

The Wynn identity as the long sought criterion for the choice of the optimal Padé approximant

The performed numerical analysis reveals that Wynn's identity for the co...
research
04/09/2017

Solving Parameter Estimation Problems with Discrete Adjoint Exponential Integrators

The solution of inverse problems in a variational setting finds best est...
research
09/07/2018

Secure Generators of q-valued Pseudo-Random Sequences on Arithmetic Polynomials

A technique for controlling errors in the functioning of nodes for the f...
research
09/30/2019

Training-Free Artificial Neural Networks

We present a numerical scheme for the computation of Artificial Neural N...

Please sign up or login with your details

Forgot password? Click here to reset