# Generation of finite difference formulas on arbitrarily spaced grids

@article{Fornberg1988GenerationOF,
title={Generation of finite difference formulas on arbitrarily spaced grids},
author={Bengt Fornberg},
journal={Mathematics of Computation},
year={1988},
volume={51},
pages={699-706}
}
• B. Fornberg
• Published 13 January 1988
• Mathematics
• Mathematics of Computation
On etablit des recurrences simples pour le calcul des poids dans les formules aux differences finies compactes pour les derivees de tous ordres avec une precision d'ordre arbitraire sur des grilles a une dimension d'espacement arbitraire
724 Citations

## Tables from this paper

CALCULATION OF WEIGHTS IN FINITE DIFFERENCE FORMULAS∗
For arbitrarily spaced grids, this work describes a computationally very inexpensive numerical algorithm that can be found very conveniently with a two-line algorithm when using a symbolic language such as Mathematica.
Animation multirésolution interactive d'objets déformable
• Mathematics
• 1999
Cet article presente une approche pour animer des materiaux elastiques deformables en temps interactif en utilisant une resolution adaptative en temps et en espace. Nous proposons un nouveau modele
Classroom Note: Calculation of Weights in Finite Difference Formulas
For arbitrarily spaced grids, this work describes a computationally very inexpensive numerical algorithm that can be found very conveniently with a two-line algorithm when using a symbolic language such as Mathematica.
Optimisation d'échangeurs à films ruisselants
On considere le transfert de chaleur au travers d'un film liquide de faible epaisseur s'ecoulant par gravite le long d'un plan incline, l'objectif etant de comprendre les mecanismes d'intensification
Difference operators from interpolating moving least squares and their deviation from optimality
We consider the classical Interpolating Moving Least Squares (IMLS) interpolant as defined by Lancaster and Salkauskas [Math. Comp. 37 (1981) 141–158] and compute the first and second derivative of
Padé Approximations to the Logarithm I: Derivation Via Differential Equations
Explicit formulas for the polynomials that define Hermite-Padé approximations to the logarithm are derived. The main elements of the derivation are Frobenius' method for solving linear differential
An algorithm for calculating Hermite-based finite difference weights
Finite difference (FD) formulas approximate derivatives by weighted sums of function values. Given arbitrarily distributed node locations in one-dimension, a previous algorithm by the present author
Generation of Pseudospectral Differentiation Matrices I
The algorithm is based on Fornberg's finite difference algorithm and is numerically stable and contains a necessary and sufficient condition for D_p = D^p_1.
Improving Unstructured Mesh Partitions for Multiple Criteria Using Mesh Adjacencies
• Computer Science
SIAM J. Sci. Comput.
• 2018
The scalability of unstructured mesh-based applications depends on partitioning methods that quickly balance the computational work while reducing communication costs. Zhou et al. [SIAM J. Sci. Com...

## References

SHOWING 1-9 OF 9 REFERENCES
Symbolic generation of finite difference formulas
• Computer Science
• 1978
Tables of coefficients for high order accurate, compact approximations to the first ten derivatives on and at the midpoints of uniform nets are presented. The exact rational weights are generated and
On a Fourier method for the integration of hyperbolic equations
In this paper we consider high order difference approximations of ${\partial / {\partial x}}$ and especially one method based on the fast Fourier transform. It is used to approximate space
Differentiating matrices for arbitrarily spaced grid points
Differentiating matrices allow the numerical differentiation of functions defined at points of a discrete grid. A type of differentiating matrix based on local approximation on a sequence of sliding
Using Gaussian elimination for computation of the central difference equation coefficients
An algorithm will be developed for computing the coefficients for the central difference expressions approximating the first or second derivative of any order error by expressing the problem in matrix notation and applying Gaussian techniques for the solution.
CYNAR, "Using Gaussian elimination for computation of the central difference equation coeficients,"SIGNUM Newsl
• (USA), v
• 1987