Error formulas for divided difference expansions and numerical differentiation
نویسنده
چکیده
Here, and throughout the paper, we will assume that x0 ≤ x1 ≤ . . . ≤ xn are arbitrarily spaced real values and x is any real value in the interval [x0, xn]. We refer the reader to Conte and de Boor [1 ] for basic properties of divided differences. Two things are required: evaluation of the coefficients ck; and a bound on the remainder term Rp in terms of the maximum grid spacing h := max 0≤i≤n−1 (xi+1 − xi).
منابع مشابه
New Iterative Methods for Interpolation, Numerical Differentiation and Numerical Integration
Through introducing a new iterative formula for divided difference using Neville's and Aitken's algorithms, we study new iterative methods for interpolation, numerical differentiation and numerical integration formulas with arbitrary order of accuracy for evenly or unevenly spaced data. Basic computer algorithms for new methods are given.
متن کاملAccuracy of Decoupled Implicit Integration Formulas
Dynamical systems can often be decomposed into loosely coupled subsystems. The system of ordinary differential equations (ODEs) modelling such a problem can then be partitioned corresponding to the subsystems, and the loose couplings can be exploited by special integration methods to solve the problem using a parallel computer or just solve the problem more efficiently than by standard methods....
متن کاملPresentation, error analysis and numerical experiments on a group of 1-step-ahead numerical differentiation formulas
In order to achieve higher computational precision in approximating the first-order derivative of the target point, the 1-step-ahead numerical differentiation formulas are presented. These formulas greatly remedy some intrinsic weaknesses of the backward numerical differentiation formulas, and overcome the limitation of the central numerical differentiation formulas. In addition, a group of for...
متن کاملError bounds for kernel-based numerical differentiation
The literature on meshless methods observed that kernel-based numerical differentiation formulae are robust and provide high accuracy at low cost. This paper analyzes the error of such formulas, using the new technique of growth functions. It allows to bypass certain technical assumptions that were needed to prove the standard error bounds on interpolants and their derivatives. Since differenti...
متن کاملError Bounds on Derivatives during Simulations
The methods commonly used for numerical differentiation, such as the “center-difference formula” and “four-points formula” are unusable in simulations or real-time data analysis because they require knowledge of the future. In Bard’11, an algorithm was shown that generates formulas that require knowledge only of the past and present values of f(t) to estimate f ′(t). Furthermore, the algorithm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Approximation Theory
دوره 122 شماره
صفحات -
تاریخ انتشار 2003