TOWARDS AUTOMATIC MULTIGRID ALGORITHMS FOR SPD,
NONSYMMETRIC AND INDEFINITE PROBLEMS.
|Authors:|| Y. Shapira, M. Israeli and A. Sidi
|Abstract:||A new multigrid algorithm is constructed for the solution of linear systems of equations which arise from the discretization of elliptic PDE's. It is defined in terms of the fine grid only, and no rediscretization of the PDE is required. Numerical experiments show that this algorithm gives high convergence rates for several classes of problems: symmetric, non-symmetric, singular perturbation and also problems with discontinuous coefficients, non-uniform grids and non-rectangular domains. When supplemented with an acceleration method, good convergence are achieved also for pure convection problems and indefinite Helmholtz equations.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1994/CS/CS0825), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1994
To the main CS technical reports page
Computer science department, Technion