Abstract
Recurrences are derived for the elements of the differentiating matrix, which is used to obtain nondifference numerical differentiation formulas with equally spaced interpolation nodes. The proposed algorithm is easily implemented on a computer and can be used to automate construction of multipoint numerical differentiation formulas.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. S. Berezin and N. P. Zhidkov, Computational Methods [in Russian], Moscow (1962).
A. F. Kalaida, "Matrix numerical differentiation algorithms," Vychisl. Prikl. Mat., No. 46, 7–13 (1982).
A. F. Kalaida and V. A. Chirikalov, "Zeroth-rank approximation of a superposition of functions and matrix numerical differentiation algorithms," Vychisl. Prikl. Mat., No. 52, 10–17 (1984).
Additional information
Kiev University. Translated from Vychislitel'naya i Prikladnaya Matematika, No. 68, pp. 22–26, 1989.
Rights and permissions
About this article
Cite this article
Chirikalov, V.A. Using the Aitken scheme to compute the differentiating matrix with equidistant nodes. J Math Sci 69, 1385–1388 (1994). https://doi.org/10.1007/BF01250580
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01250580