*(English)*Zbl 0992.65115

Summary: 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.

##### MSC:

65N06 | Finite difference methods (BVP of PDE) |

65Y15 | Packaged methods in numerical analysis |

35J40 | Higher order elliptic equations, boundary value problems |

65N55 | Multigrid methods; domain decomposition (BVP of PDE) |

31B30 | Biharmonic and polyharmonic equations and functions (higher-dimensional) |

65F10 | Iterative methods for linear systems |

65F35 | Matrix norms, conditioning, scaling (numerical linear algebra) |

65N15 | Error bounds (BVP of PDE) |

68W30 | Symbolic computation and algebraic computation |