The Galerkin-multigrid method for complex self adjoint and non-self adjoint elliptic boundary value problems
The approximate solution of elliptic boundary value problems posed on the unit square in the complex case by a Galerkin-multiple grid (multigrid) method applied to finite element calculations is given. As predicted by the theory, the multigrid method is capable of obtaining a given accuracy in O(N) calculations, where N is the number of equations in the linear system of algebraic equations resulting from application of the finite element method. The types of elliptic boundary value problems explored are the self adjoint problem with Dirichlet data at the side x = O and mixed boundary conditions on the other three sides, and the non-self adjoint problem with Dirichlet boundary conditions on all four sides of the unit square. Presented is a description of the multigrid algorithm applied to the above problems, a brief explanation of a multigrid computer program for each type problem, and numerical results. Results are given in the form of tables and plots (of the error and the numerical solution versus the exact solution) to illustrate the power of the multigrid scheme.
Thesis78.T539.pdf
3.88 MB
Adobe PDF
293179d0a765689080e306df202739d9