Some problems in optimally stable Lagrangian differentiation
HTML articles powered by AMS MathViewer
- by Herbert E. Salzer PDF
- Math. Comp. 28 (1974), 1105-1115 Request permission
Abstract:
In many practical problems in numerical differentiation of a function $f(x)$ 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., ${f^{(k)}}(x) \sim \Sigma _{i = 1}^nL_i^{n(k)}(x)f({x_i})$, a criterion for optimal stability is minimization of $\Sigma _{i = 1}^n|L_i^{n(k)}(x)|$. Let $L \equiv L(n,k,{x_1}, \ldots ,{x_n};x\;{\text {or}}\;{x_0}) = \Sigma _{i = 1}^n|L_i^{n(k)}(x\;{\text {or}}\;{x_0})|$. For ${x_i}$ and fixed $x = {x_0}$ in $[ - 1,1]$, one problem is to find the n ${x_i}$’s to give ${L_0} \equiv {L_0}(n,k,{x_0}) = \min L$. When the truncation error is negligible for any ${x_0}$ within $[ - 1,1]$, a second problem is to find ${x_0} = {x^\ast }$ to obtain ${L^\ast } \equiv {L^\ast }(n,k) = \min {L_0} = \min \min L$. A third much simpler problem, for ${x_i}$ equally spaced, ${x_1} = - 1,{x_n} = 1$, is to find $\bar x$ to give $\bar L \equiv \bar L(n,k) = \min L$. For lower values of n, some results were obtained on ${L_0}$ and ${L^\ast }$ when $k = 1$, and on $\bar L$ when $k = 1$ and 2 by direct calculation from available tables of $L_i^{n(k)}(x)$. The relation of ${L_0},{L^\ast }$ and $\bar L$ to equally spaced points, Chebyshev points, Chebyshev polynomials ${T_m}(x)$ for $m \leqslant n - 1$, minimax solutions, and central difference formulas, considering also larger values of n, is indicated sketchily.References
- L. M. Milne-Thomson, The Calculus of Finite Differences, Macmillan & Co., Ltd., London, 1951. MR 0043339 J. F. STEFFENSEN, Interpolation, Williams and Wilkins, Baltimore, Md., 1927, pp. 60-68.
- Herbert E. Salzer, Optimal points for numerical differentiation, Numer. Math. 2 (1960), 214–227. MR 117884, DOI 10.1007/BF01386225
- 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
- Theodore J. Rivlin, An introduction to the approximation of functions, Blaisdell Publishing Co. [Ginn and Co.], Waltham, Mass.-Toronto, Ont.-London, 1969. MR 0249885
- 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 5942, DOI 10.1090/S0002-9947-1941-0005942-4
- 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
- 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, DOI 10.1007/BF01456902
- H. E. Salzer, Lagrangian interpolation at the Chebyshev points $X_{n,\nu }\equiv \textrm {cos}(\nu \pi /n)$, $\nu =0(1)n$; some unnoted advantages, Comput. J. 15 (1972), 156–159. MR 315865, DOI 10.1093/comjnl/15.2.156
- 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
- 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
- W. G. Bickley, Formulae for numerical differentiation, Math. Gaz. 25 (1941), 19–27. MR 3580, DOI 10.2307/3606475
- Herbert E. Salzer, Coefficients for numerical differentiation with central differences, J. Math. Phys. Mass. Inst. Tech. 22 (1943), 115–135. MR 8720, DOI 10.1002/sapm1943221115
Additional Information
- © Copyright 1974 American Mathematical Society
- Journal: Math. Comp. 28 (1974), 1105-1115
- MSC: Primary 65D25
- DOI: https://doi.org/10.1090/S0025-5718-1974-0368391-0
- MathSciNet review: 0368391