NASA NTRS · 19940017005
An automatic multigrid method for the solution of sparse linear systems
Abstract
An automatic version of the multigrid method for the solution of linear systems arising from the discretization of elliptic PDE's is presented. This version is based on the structure of the algebraic system solely, and does not use the original partial differential operator. Numerical experiments show that for the Poisson equation the rate of convergence of our method is equal to that of classical multigrid methods. Moreover, the method is robust in the sense that its high rate of convergence is conserved for other classes of problems: non-symmetric, hyperbolic (even with closed characteristics) and problems on non-uniform grids. No double discretization or special treatment of sub-domains (e.g. boundaries) is needed. When supplemented with a vector extrapolation method, high rates of convergence are achieved also for anisotropic and discontinuous problems and also for indefinite Helmholtz equations. A new double discretization strategy is proposed for finite and spectral element schemes and is found better than known strategies.
Keep this discovery
Explore connections, maps & timelines
Shapira, Yair, Israeli, Moshe, Sidi, Avram. 1993-11-01. An automatic multigrid method for the solution of sparse linear systems. https://searchnasa.com/record/nasa%3A19940017005/an-automatic-multigrid-method-for-the-solution-of-sparse-linear-systems
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.