Supra-convergent schemes on irregular grids

As Tikhonov and Samarskil showed for k = 2, it is not essential that k th-order compact difference schemes be centered at the arithmetic mean of the stencil's points to yield second-order convergence (although it does suffice). For stable schemes and even k, the main point is seen when the k th difference quotient is set equal to the value of the k th derivative at the middle point of the stencil; the proof is particularly transparent for k = 2. For any k, in fact, there is a ( k/2J -parameter family of symmetric averages of the values of the k th derivative at the points of the stencil which, when similarly used, yield second-order convergence. The result extends to stable compact schemes for equations with lower-order terms under general boundary conditions. Although the extension of Numerov's tridiagonal scheme (approximating D2y = f with third-order truncation error) yields fourth-order con- vergence on meshes consisting of a bounded number of pieces in which the mesh size changes monotonically, it yields only third-order convergence to quintic polynomials on any three- periodic mesh with unequal adjacent mesh sizes and fixed adjacent mesh ratios. A result of some independent interest is appended (and applied): it characterizes, simply, those functions of k variables which possess the property that their average value, as one translates over one period of an arbitrary periodic sequence of arguments, is zero; i.e., those bounded functions whose average value, as one translates over arbitrary finite sequences of arguments, goes to zero as the length of the sequences increases.

[1]  L. M. Milne-Thomson,et al.  The Calculus Of Finite Differences , 1934 .

[2]  A. A. Samarskii,et al.  Homogeneous difference schemes , 1962 .

[3]  A. A. Samarskii Homogeneous difference schemes on non-uniform nets for equations of parabolic type , 1963 .

[4]  A. A. Samarskii Local one dimensional difference schemes on non-uniform nets☆ , 1963 .

[5]  M. R. Osborne Minimising truncation error in finite difference approximations to ordinary differential equations , 1967 .

[6]  V. Zhurin,et al.  Introduction to the theory of difference schemes: A. A. Samarskii, 552p. Nauka, Editor-in-chief of physical-mathematical literature, Moscow, 1971☆ , 1973 .

[7]  H. Stetter Analysis of Discretization Methods for Ordinary Differential Equations , 1973 .

[8]  Burton Wendroff,et al.  The Relation Between the Galerkin and Collocation Methods Using Smooth Splines , 1974 .

[9]  B. Swartz The Construction and Comparison of Finite Difference Analogs of Some Finite Element Schemes , 1974 .

[10]  Vidar Thomée,et al.  Convergence Estimates for Galerkin Methods for Variable Coefficient Initial Value Problems , 1974 .

[11]  E. Doedel The Construction of Finite Difference Approximations to Ordinary Differential Equations , 1978 .

[12]  E. Doedel Some stability theorems for finite difference collocation methods on nonuniform meshes , 1980 .

[13]  John R. Rice,et al.  A high-order difference method for differential equations , 1980 .

[14]  Blair Swartz Compact, implicit difference schemes for a differential equation’s side conditions , 1980 .

[15]  L. Schumaker Spline Functions: Basic Theory , 1981 .

[16]  D. R. Lick,et al.  Graph theory with applications to algorithms and computer science , 1985 .

[17]  Edward W. Larsen,et al.  Discretization methods for one-dimensional Fokker-Planck operators , 1985 .

[18]  V. Farber,et al.  Supraconvergence and functions that sum to zero on cycles , 1985 .

[19]  Thomas A. Manteuffel,et al.  The numerical solution of second-order boundary value problems on nonuniform meshes , 1986 .