z-logo
open-access-imgOpen Access
A Novel Finite-Difference Approximation to the Biharmonic Operator
Author(s) -
Garry J. Tee
Publication year - 1963
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/6.2.177
Subject(s) - biharmonic equation , mathematics , operator (biology) , truncation error , rate of convergence , truncation (statistics) , net (polyhedron) , mathematical analysis , node (physics) , boundary value problem , finite difference method , boundary (topology) , geometry , computer science , key (lock) , physics , biochemistry , chemistry , repressor , transcription factor , gene , statistics , computer security , quantum mechanics
The two-dimensional biharmonic operator is approximated by a finite-difference operator over a square (h x A) net, which connects each node with 16 neighbouring nodes in such a manner that the resulting matrix has "Young's Property A," for simple boundary conditions. It is shown that the local truncation error, the convergence rate of S.O.R. for solving the finite-difference (or "net") equations, and the truncation error of the solution of the net equations are each of order O(A) as h -> 0. Comparisons are made with the conventional 13-node approximation to the biharmonic operator: in particular, numerical experiments indicate that the convergence rate of S.O.R. for solving net equations based on the conventional 13-node operator is considerably less than that for the novel 17-node operator.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom