A Comparison of Elliptic Solvers for General Two-Dimensional Regions

We present results of some numerical experiments performed to compare the relative efficiency and storage requirements of some elliptic solvers on general two-dimensional regions. The techniques employed by the solvers included: capacitance matrix techniques, sparse matrix techniques, multi-grid techniques and preconditioned conjugate gradient techniques. Special emphasis is placed on the many right-hand side case, as motivated by applications to time simulation studies.