A Comparison of Elliptic Solvers for General Two-Dimensional Regions
A number of alternative elliptic solvers, as implemented in a number of software packages, are compared. They are sparse matrix methods (Yale sparse matrix package), multigrid methods (the MG01 code from G.M.D.), capacitance matrix methods (due to Proskurowski) and several preconditioned conjugate gradient methods. The problems at hand are finite difference approximations of Poisson's equations on relatively complicated regions for which the handling of the geometry is a substantial part of the problem. Separation of variables and the related fast Poisson solvers cannot be applied for such problems. The problems involved in a study of this nature are quite extensive. It is for example not clear from the text how the geometry of the region is handled in PCGPACK and how much of the difference between the preprocessing costs of the different programs are related to different levels of ambition to handle general regions. Nevertheless this is a very careful and useful study.
- On the Performance of Some Rapid Elliptic Solvers on a Vector Processor
- A comparison of some standard elliptic solvers: CM-5 vs. Cray C-90
- On fast direct methods for solving elliptic equations over nonrectangular regions
- Algorithm 732: solvers for self-adjoint elliptic problems in irregular two-dimensional domains
- MUDPACK: Multigrid portable FORTRAN software for the efficient solution of linear elliptic partial differential equations
This page was built for publication: A Comparison of Elliptic Solvers for General Two-Dimensional Regions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3727304)