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.


Formulas for bivariate hyperosculatory interpolation
HTML articles powered by AMS MathViewer

by Herbert E. Salzer PDF
Math. Comp. 25 (1971), 119-133 Request permission


For a given function $f(x,y)$, bivariate hyperosculatory interpolation formulas are obtained by employing a suitably constructed binary nic ${p_n}(x,y)$ that is fitted to the values of $f(x,y)$ and its first and second partial derivatives at the m points $({x_i},{y_i})$ of a rectangular $h \times k$ Cartesian grid, where ($({x_i},{y_i}) = ({x_0} + {p_i}h,{y_0} + {q_i}k),{p_i}$ and ${q_i}$ are small integers $\geqq 0,i = 0(1)m - 1,m \geqq 2$. In terms of the variables (p, q), where $x = {x_0} + ph,y = {y_0} + qk$ (and $f(x,y) = F(p,q)$), we have ${p_n}(x,y) = {P_n}(p,q)$. Often, for ${P_n}(p,q)$ having a specified desirable form, this problem turns out to be insoluble for every configuration of the points $({x_i},{y_i})$. When this is not the case, it generally requires considerable investigation to find a practical configuration of points $({x_i},{y_i})$ for which there is a solution of the form ${P_n}(p,q)$. Formulas are found for choices of ${P_n}(p,q)$, and soluble configurations of points $({x_i},{y_i})$, that have dominant remainder terms in \[ {h^r}{k^s}{f_{x \ldots x(r\;{\text {times}})y \ldots y(s\;{\text {times}})}}({x_0},{y_0})\] whose orders $r + s$ are as high as possible. Three two-point formulas, two three-point formulas and one four-point formula, including all remainder terms through the order \[ r + s = \left ( {\begin {array}{*{20}{c}} {n,} \hfill & {{\text {for}}\;m = 2} \hfill \\ {n + 1,} \hfill & {{\text {for}}\;m = 3,4} \hfill \\ \end {array} } \right ),\] are given here in convenient matrix form.
  • Herbert E. Salzer and Genevieve M. Kimbro, Tables for bivariate osculatory interpolation over a Cartesian grid. , Convair Division of General Dynamics Corporation, San Diego, Calif., 1958. MR 0099106
  • Herbert E. Salzer, Some new divided difference algorithms for two variables, On numerical approximation. Proceedings of a Symposium, Madison, April 21-23, 1958, Publication of the Mathematics Research Center, U.S. Army, the University of Wisconsin, no. 1, University of Wisconsin Press, Madison, Wis., 1959, pp. 61–98. Edited by R. E. Langer. MR 0102166
  • Herbert E. Salzer, Divided differences for functions of two variables for irregularly spaced arguments, Numer. Math. 6 (1964), 68–77. MR 165659, DOI 10.1007/BF01386056
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65.20
  • Retrieve articles in all journals with MSC: 65.20
Additional Information
  • © Copyright 1971 American Mathematical Society
  • Journal: Math. Comp. 25 (1971), 119-133
  • MSC: Primary 65.20
  • DOI:
  • MathSciNet review: 0287671