### Abstract

The general form of Taylor's theorem for a function f:K→K, where K is the real line or the complex plane, gives the formula, f = P_{n}+R_{n}, where P_{n} is the Newton interpolating polynomial computed with respect to a confluent vector of nodes, and R_{n} is the remainder. Whenever f′≠0, for each m = 2,...,n+1, we describe a `determinantal interpolation formula', f = P_{m,n}+R_{m,n}, where P_{m,n} is a rational function in x and f itself. These formulas play a dual role in the approximation of f or its inverse. For m = 2, the formula is Taylor's and for m = 3 is a new expansion formula and a Pade approximant. By applying the formulas to P_{n}, for each m≥2, P_{m,m-1},...,P_{m,m+n-2} is a set of n rational approximations that includes P_{n}, and may provide a better approximation to f, than P_{n}. Hence each Taylor polynomial unfolds into an infinite spectrum of rational approximations. The formulas also give an infinite spectrum of rational inverse approximations, as well as a fundamental k-point iteration function B_{m}^{(k)}, for each k≤m, defined as the ratio of two determinants that depend on the first m - k derivatives. Application of our formulas have motivated several new results obtained in sequel papers: (i) theoretical analysis of the order of B_{m}^{(k)}, k = 1,...,m, proving that it ranges from m to the limiting ratio of generalized Fibonacci numbers of order m; (ii) computational results with the first few members of B_{m}^{(k)} indicating that they outperform traditional root finding methods, e.g., Newton's; (iii) a novel polynomial rootfinding method requiring only a single input and the evaluation of the sequence of iteration functions B_{m}^{(1)} at that input. This amounts to the evaluation of special Toeplitz determinants that are also computable via a recursive formula; (iv) a new strategy for general root finding; (v) new formulas for approximation of π,e, and other special numbers.

Original language | English (US) |
---|---|

Pages (from-to) | 287-318 |

Number of pages | 32 |

Journal | Journal of Computational and Applied Mathematics |

Volume | 126 |

Issue number | 1-2 |

DOIs | |

State | Published - Dec 30 2000 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computational Mathematics
- Applied Mathematics

### Cite this

}

**Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications.** / Kalantari, Bahman.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications

AU - Kalantari, Bahman

PY - 2000/12/30

Y1 - 2000/12/30

N2 - The general form of Taylor's theorem for a function f:K→K, where K is the real line or the complex plane, gives the formula, f = Pn+Rn, where Pn is the Newton interpolating polynomial computed with respect to a confluent vector of nodes, and Rn is the remainder. Whenever f′≠0, for each m = 2,...,n+1, we describe a `determinantal interpolation formula', f = Pm,n+Rm,n, where Pm,n is a rational function in x and f itself. These formulas play a dual role in the approximation of f or its inverse. For m = 2, the formula is Taylor's and for m = 3 is a new expansion formula and a Pade approximant. By applying the formulas to Pn, for each m≥2, Pm,m-1,...,Pm,m+n-2 is a set of n rational approximations that includes Pn, and may provide a better approximation to f, than Pn. Hence each Taylor polynomial unfolds into an infinite spectrum of rational approximations. The formulas also give an infinite spectrum of rational inverse approximations, as well as a fundamental k-point iteration function Bm(k), for each k≤m, defined as the ratio of two determinants that depend on the first m - k derivatives. Application of our formulas have motivated several new results obtained in sequel papers: (i) theoretical analysis of the order of Bm(k), k = 1,...,m, proving that it ranges from m to the limiting ratio of generalized Fibonacci numbers of order m; (ii) computational results with the first few members of Bm(k) indicating that they outperform traditional root finding methods, e.g., Newton's; (iii) a novel polynomial rootfinding method requiring only a single input and the evaluation of the sequence of iteration functions Bm(1) at that input. This amounts to the evaluation of special Toeplitz determinants that are also computable via a recursive formula; (iv) a new strategy for general root finding; (v) new formulas for approximation of π,e, and other special numbers.

AB - The general form of Taylor's theorem for a function f:K→K, where K is the real line or the complex plane, gives the formula, f = Pn+Rn, where Pn is the Newton interpolating polynomial computed with respect to a confluent vector of nodes, and Rn is the remainder. Whenever f′≠0, for each m = 2,...,n+1, we describe a `determinantal interpolation formula', f = Pm,n+Rm,n, where Pm,n is a rational function in x and f itself. These formulas play a dual role in the approximation of f or its inverse. For m = 2, the formula is Taylor's and for m = 3 is a new expansion formula and a Pade approximant. By applying the formulas to Pn, for each m≥2, Pm,m-1,...,Pm,m+n-2 is a set of n rational approximations that includes Pn, and may provide a better approximation to f, than Pn. Hence each Taylor polynomial unfolds into an infinite spectrum of rational approximations. The formulas also give an infinite spectrum of rational inverse approximations, as well as a fundamental k-point iteration function Bm(k), for each k≤m, defined as the ratio of two determinants that depend on the first m - k derivatives. Application of our formulas have motivated several new results obtained in sequel papers: (i) theoretical analysis of the order of Bm(k), k = 1,...,m, proving that it ranges from m to the limiting ratio of generalized Fibonacci numbers of order m; (ii) computational results with the first few members of Bm(k) indicating that they outperform traditional root finding methods, e.g., Newton's; (iii) a novel polynomial rootfinding method requiring only a single input and the evaluation of the sequence of iteration functions Bm(1) at that input. This amounts to the evaluation of special Toeplitz determinants that are also computable via a recursive formula; (iv) a new strategy for general root finding; (v) new formulas for approximation of π,e, and other special numbers.

UR - http://www.scopus.com/inward/record.url?scp=0034497216&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034497216&partnerID=8YFLogxK

U2 - 10.1016/S0377-0427(99)00360-X

DO - 10.1016/S0377-0427(99)00360-X

M3 - Article

AN - SCOPUS:0034497216

VL - 126

SP - 287

EP - 318

JO - Journal of Computational and Applied Mathematics

JF - Journal of Computational and Applied Mathematics

SN - 0377-0427

IS - 1-2

ER -