Multigrid and Krylov Subspace Methods for the Discrete Stokes Equations}
| dc.contributor.author | Elman, Howard C. | en_US |
| dc.date.accessioned | 2004-05-31T22:26:58Z | |
| dc.date.available | 2004-05-31T22:26:58Z | |
| dc.date.created | 1994-06 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | Discretization of the Stokes equations produces a symmetric indefinite system of linear equations. For stable discretizations, a variety of numerical methods have been proposed that have rates of convergence independent of the mesh size used in the discretization. In this paper, we compare the performance of four such methods: variants of the Uzawa, preconditioned conjugate gradient, preconditioned conjugate residual, and multigrid methods, for solving several two-dimensional model problems. The results indicate that where it is applicable, multigrid with smoothing based on incomplete factorizaton is more efficient than the other methods, but typically by no more than a factor of two. The conjugate residual method has the advantages of being both independent of iteration parameters and widely applicable. (Also cross-referenced as UMIACS-TR-94-76) | en_US |
| dc.format.extent | 292114 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/646 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3302 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-94-76 | en_US |
| dc.title | Multigrid and Krylov Subspace Methods for the Discrete Stokes Equations} | en_US |
| dc.type | Technical Report | en_US |