Multigrid Solution of Automatically Generated High-Order Discretizations for the Biharmonic Equation

From MaRDI portal





The Dirichlet problem for the biharmonic equation is considered. For discretizing this problem finite difference approximations are derived on a nine-point compact stencil using the values of the solution and its gradients as unknowns. These finite difference stencils are obtained by using symbolic software packages. A corresponding Mathematica code for getting a fourth-order approximation scheme is presented. This fourth-order scheme produces more accurate approximations than the classical 13-point stencil or the commonly used splitting into two coupled Poisson equations. For solving the discrete problems several multigrid techniques are discussed. In the experiments presented red-black smoothers with overrelaxation, full weighting for the restriction, and cubic interpolation are used. The numerical examples show that the convergence rate of the multigrid \(W\)-cycle is independent of the discretization parameter. Furthermore, it is demonstrated that only a few \(W\)-cycles are necessary within a full multigrid algorithm for getting an approximate solution with an error in the order of the discretization error.




Cited in
(42)


Describes a project that uses

Uses Software






This page was built for publication: Multigrid Solution of Automatically Generated High-Order Discretizations for the Biharmonic Equation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389311)