Some problems in optimally stable Lagrangian differentiation

Author:
Herbert E. Salzer

Journal:
Math. Comp. **28** (1974), 1105-1115

MSC:
Primary 65D25

DOI:
https://doi.org/10.1090/S0025-5718-1974-0368391-0

MathSciNet review:
0368391

Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: In many practical problems in numerical differentiation of a function that is known, observed, measured, or found experimentally to limited accuracy, the computing error is often much more significant than the truncating error. In numerical differentiation of the *n*-point Lagrangian interpolation polynomial, i.e., , a criterion for optimal stability is minimization of . Let . For and *fixed* in , one problem is to find the *n* 's to give . When the truncation error is negligible for any within , a second problem is to find to obtain . A third much simpler problem, for equally spaced, , is to find to give . For lower values of *n*, some results were obtained on and when , and on when and 2 by direct calculation from available tables of . The relation of and to equally spaced points, Chebyshev points, Chebyshev polynomials for , minimax solutions, and central difference formulas, considering also larger values of *n*, is indicated sketchily.

**[1]**L. M. Milne-Thomson,*The Calculus of Finite Differences*, Macmillan and Co., Ltd., London, 1951. MR**0043339****[2]**J. F. STEFFENSEN,*Interpolation*, Williams and Wilkins, Baltimore, Md., 1927, pp. 60-68.**[3]**Herbert E. Salzer,*Optimal points for numerical differentiation*, Numer. Math.**2**(1960), 214–227. MR**0117884**, https://doi.org/10.1007/BF01386225**[4]**D. L. Berman,*Solution of an extremal problem of the theory of interpolation*, Doklady Akad. Nauk SSSR (N.S.)**87**(1952), 167–170 (Russian). MR**0051889****[5]**Theodore J. Rivlin,*An introduction to the approximation of functions*, Blaisdell Publishing Co. Ginn and Co., Waltham, Mass.-Toronto, Ont.-London, 1969. MR**0249885****[6]**R. J. Duffin and A. C. Schaeffer,*A refinement of an inequality of the brothers Markoff*, Trans. Amer. Math. Soc.**50**(1941), 517–528. MR**0005942**, https://doi.org/10.1090/S0002-9947-1941-0005942-4**[7]**D. L. Berman,*The solution of an extremal problem in the theory of interpolation*, Izv. Vysš. Učebn. Zaved. Matematika**1964**(1964), no. 6 (43), 10–14 (Russian). MR**0173117****[8]**Wladimir Markoff and J. Grossmann,*Über Polynome, die in einem gegebenen Intervalle möglichst wenig von Null abweichen*, Math. Ann.**77**(1916), no. 2, 213–258 (German). MR**1511855**, https://doi.org/10.1007/BF01456902**[9]**H. E. Salzer,*Lagrangian interpolation at the Chebyshev points 𝑋_{𝑛,𝜈}≡𝑐𝑜𝑠(𝜈𝜋/𝑛), 𝜈=0(1)𝑛; some unnoted advantages*, Comput. J.**15**(1972), 156–159. MR**0315865**, https://doi.org/10.1093/comjnl/15.2.156**[10]**Herbert E. Salzer,*Table of coefficients for obtaining the first derivative without differences*, National Bureau of Standards. Appl. Math. Ser.,**1948**(1948), no. 2, 20. MR**0025808****[11]**Herbert E. Salzer and Peggy T. Roberson,*Table of coefficients for obtaining the second derivative without differences*, Convair-Astronautics, San Diego, Calif., 1957. MR**0089521****[12]**W. G. Bickley,*Formulae for numerical differentiation*, Math. Gaz.**25**(1941), 19–27. MR**0003580**, https://doi.org/10.2307/3606475**[13]**Herbert E. Salzer,*Coefficients for numerical differentiation with central differences*, J. Math. Phys. Mass. Inst. Tech.**22**(1943), 115–135. MR**0008720**, https://doi.org/10.1002/sapm1943221115

Retrieve articles in *Mathematics of Computation*
with MSC:
65D25

Retrieve articles in all journals with MSC: 65D25

Additional Information

DOI:
https://doi.org/10.1090/S0025-5718-1974-0368391-0

Keywords:
Numerical differentiation,
Lagrangian interpolation,
optimally stable numerical differentiation,
criteria for optimal stability,
minimin and minimax solutions,
Chebyshev points,
Chebyshev polynomials,
central difference formulas

Article copyright:
© Copyright 1974
American Mathematical Society