Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Note on osculatory rational interpolation
HTML articles powered by AMS MathViewer

by Herbert E. Salzer PDF
Math. Comp. 16 (1962), 486-491 Request permission

Abstract:

In n-point osculatory interpolation of order ${r_i} - 1$ at points ${x_i}$, $i = 1, 2, \cdots , n,$, by a rational expression ${N(x)}/{D(x)}$, where $N(x)$ and $D(x)$ are polynomials $\sum {{a_j}{x^j}}$ and $\sum {{b_j}{x^j}}$, We use the lemma that the system (1) ${{\{N({{x}_{i}})/D({{x}_{i}})\}}^{(m)}} = {{f}^{(m)}}({{x}_{i}}), m=0,1,\cdots ,{{r}_{i}}-1$, is equivalent to (2) ${N^{(m)}}({{x_i}}) = {\{{f({{x_i}})D({{x_i}})}\}^{(m)}}, m = 0, 1, \cdots , {r_i} - 1, D({{x_i}}) \ne 0$. This equivalence does not require $N(x)$ or $D(x)$ to be a polynomial or even a linear combination of given functions. The lemma implies that (1), superficially non-linear in ${a_j}$ and ${b_j}$, being the same as (2), is actually linear. For the n-point interpolation problem, the linear system, of order $\sum \limits _{i = 1}^n {{r_i}}$, which might be large, is replaceable by separate linear Systems of orders ${r_i}$ (or even ${r_i} + {r_{i + 1}} + \cdots + {r_{i + j}}$ when conveniently small) by applying the lemma to the continued fraction (3) ${N(x)}/{D(x) = {{a}_{1,0}} + \tfrac {x- {{x}_{1}}|}{| {{a}_{1,1}} } + \tfrac {x- {{x}_{1}} |}{| {{a}_{1,2}} } + \cdots + \tfrac {x- {{x}_{1}} |}{| {{a}_{1,{{r}_{1}}-1}} } + \tfrac {x- {{x}_{1}} |}{| {{a}_{2,0}} } + \tfrac {x- {{x}_{1}} |}{| {{a}_{2,1}} } + \cdots + \tfrac {x- {{x}_{1}} |}{| {{a}_{2,{{r}_{2}}-1}} } + \tfrac {x- {{x}_{1}} |}{| {{a}_{3,0}} } + \cdots + \tfrac {x- {{x}_{n-1}} |}{| {{a}_{n,0}} } + \tfrac {x-\ {{x}_{n}} |}{| {{a}_{n,1}} } + \cdots +\tfrac {x- {{x}_{n}} |}{| {{a}_{n,{{r}_{n}}-1}} }}\;$. In (3), which has the property (proven in two ways) that the determination of ${a_{i,m}}$ is independent of all a’s that follow, we find ${a_{i,m}}$ stepwise, but several at a time (instead of singly which is more tedious), retrieving them readily from the solutions of those lower-order linear systems.
References
  • L. M. Milne-Thomson, The Calculus of Finite Differences, Macmillan & Co., Ltd., London, 1951. MR 0043339
  • Paul I. Richards, Manual of mathematical physics, Pergamon Press, New York-London-Paris-Los Angeles, 1959. MR 0108988
  • Oskar Perron, Die Lehre von den Kettenbrüchen. Bd I. Elementare Kettenbrüche, B. G. Teubner Verlagsgesellschaft, Stuttgart, 1954 (German). 3te Aufl. MR 0064172
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65.20
  • Retrieve articles in all journals with MSC: 65.20
Additional Information
  • © Copyright 1962 American Mathematical Society
  • Journal: Math. Comp. 16 (1962), 486-491
  • MSC: Primary 65.20
  • DOI: https://doi.org/10.1090/S0025-5718-1962-0149648-7
  • MathSciNet review: 0149648