Numerical solution of the biharmonic equation
Technical Report
·
OSTI ID:6876436
The numerical solution of discrete approximations to the first biharmonic boundary value problem in rectangular domains is studied. Several finite difference schemes are compared and a family of new fast algorithms for the solution of the discrete systems is developed. These methods are optimal, having a theoretical computational complexity of 0(N/sup 2/) arithmetic operations and requiring N/sup 2/+0(N) storage locations when solving the problem on an N by N grid. Several practical computer implementations of the algorithm are discussed and compared. These implementations require aN/sup 2/ + bN/sup 2/logN arithmetic operations with b<
- Research Organization:
- Stanford Univ., CA (USA). Dept. of Computer Science
- DOE Contract Number:
- AT03-76ER71030
- OSTI ID:
- 6876436
- Report Number(s):
- STAN-CS-80-834; ON: DE82016939
- Resource Relation:
- Other Information: Thesis
- Country of Publication:
- United States
- Language:
- English
Similar Records
Fast multipole method for the biharmonic equation in three dimensions
Numerical methods for the first biharmonic equation and for the two-dimensional Stokes problem
Development of a Prototype Lattice Boltzmann Code for CFD of Fusion Systems.
Journal Article
·
Sat Jun 10 00:00:00 EDT 2006
· Journal of Computational Physics
·
OSTI ID:6876436
Numerical methods for the first biharmonic equation and for the two-dimensional Stokes problem
Technical Report
·
Sun May 01 00:00:00 EDT 1977
·
OSTI ID:6876436
Development of a Prototype Lattice Boltzmann Code for CFD of Fusion Systems.
Technical Report
·
Mon Feb 26 00:00:00 EST 2007
·
OSTI ID:6876436
+1 more