No CrossRef data available.
Article contents
On the Computation of a Lagrangian Interpolation
Published online by Cambridge University Press: 20 January 2009
Extract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Interpolation is one of the most frequent processes in calculation, and yet it is the process in which most computers find the ordinary methods least satisfactory and most troublesome. Indeed, whenever linear interpolation is not practicable, it is usually worth while to find out a method depending on the nature the functions involved in the calculation, and use it in preference to the ordinary difference or Lagrangian formulae. In interpolation by differences there is the want of adequate tables of the coefficients, and worse than that, the necessity for watching the signs and the decimal points, a necessity which in these days calculating machines is relatively a great trouble. There is usually, moreover, a lack of system about interpolation by differences that makes it peculiarly susceptible to slips of working. In this connection I might mention a useful and not too well-known arrangement of the work for Newton's formula which Legendre gives in his Traité des fonctions elliptiqueg.
- Type
- Research Article
- Information
- Copyright
- Copyright © Edinburgh Mathematical Society 1917
References
page 78 note * A serviceable table is given by G. W. Jones, of Cornell, in his collection of Tables (London, Macmillan & Co.). It contains the first five Binomial and also Bessel coefficients to five decimal places for every ·01 of the argument.
page 78 note † Tome II., p. 36.
page 79 note * Pointed out to me by my friend, Mr A. T. Doodson.
page 79 note † Cambridge University Press, 1914. For another slightly different form of the rule see the “Errata” issued recently.
You have
Access