High Accuracy Solution of Three-Dimensional Biharmonic Equations

In this paper, we consider several finite-difference approximations for the three-dimensional biharmonic equation. A symbolic algebra package is utilized to derive a family of finite-difference approximations for the biharmonic equation on a 27 point compact stencil. The unknown solution and its first derivatives are carried as unknowns at selected grid points. This formulation allows us to incorporate the Dirichlet boundary conditions automatically and there is no need to define special formulas near the boundaries, as is the case with the standard discretizations of biharmonic equations. We exhibit the standard second-order, finite-difference approximation that requires 25 grid points. We also exhibit two compact formulations of the 3D biharmonic equations; these compact formulas are defined on a 27 point cubic grid. The fourth-order approximations are used to solve a set of test problems and produce high accuracy numerical solutions. The system of linear equations is solved using a variety of iterative methods. We employ multigrid and preconditioned Krylov iterative methods to solve the system of equations. Test results from two test problems are reported. In these experiments, the multigrid method gives excellent results. The multigrid preconditioning also gives good results using Krylov methods.

[1]  Murli M. Gupta Discretization Error Estimates for Certain Splitting Procedures for Solving First Biharmonic Boundary Value Problems , 1975 .

[2]  Murli M. Gupta,et al.  Direct solution of the biharmonic equation using noncoupled approach , 1979 .

[3]  G. Meurant Computer Solution of Large Linear Systems , 1999 .

[4]  J. W. Stephenson Single cell discretizations of order two and four for biharmonic problems , 1984 .

[5]  A. Bruaset A survey of preconditioned iterative methods , 1995 .

[6]  William L. Briggs,et al.  A multigrid tutorial , 1987 .

[7]  Irfan Altas,et al.  Multigrid Solution of Automatically Generated High-Order Discretizations for the Biharmonic Equation , 1998, SIAM J. Sci. Comput..

[8]  Henk A. van der Vorst,et al.  Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems , 1992, SIAM J. Sci. Comput..

[9]  R. Freund,et al.  QMR: a quasi-minimal residual method for non-Hermitian linear systems , 1991 .

[10]  Edward L. Reiss,et al.  Block five diagonal matrices and the fast numerical solution of the biharmonic equation , 1972 .

[11]  R. Glowinski,et al.  Numerical methods for the first biharmonic equation and for the two-dimensional Stokes problem , 1977 .

[12]  A. Brandt Multi-level adaptive technique (MLAT) for fast numerical solution to boundary value problems , 1973 .

[13]  Irfan Altas,et al.  Iterative methods for fixed point problems on high performance computing environment , 1996 .

[14]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[15]  R. T. Dames,et al.  On an Alternating Direction Method for Solving the Plate Problem with Mixed Boundary Conditions , 1960, JACM.

[16]  Murli M. Gupta,et al.  Some Difference Schemes for the Biharmonic Equation , 1975 .

[17]  Roland W. Freund,et al.  A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems , 1993, SIAM J. Sci. Comput..