Towards Automatic Multigrid Algorithms for SPD, Nonsymmetric and Indefinite Problems
نویسندگان
چکیده
A new multigrid algorithm is constructed for the solution of linear systems of equations which arise from the discretization of elliptic PDEs. It is defined in terms of the difference scheme on 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 ofproblems: symmetric, nonsymmetdc and problems with discontinuous coefficients, nonuniform grids, and l;tonrectangular domains. When supplemented with an acceleration method, good convergence is achieved also for pure convection problems and indefinite Helmholtz equations. Key words, convection-diffusion equation, discontinuous coefficients, elliptic PDEs, indefinite Helmholtz equation, automatic multigrid method AMS subject classifications. 65F10, 65N22, 65N55
منابع مشابه
Multigrid Algorithms for Nonconforming and Mixed Methods for Nonsymmetric and Indefinite Problems
In this paper we consider multigrid algorithms for nonconforming and mixed finite element methods for nonsymmetric and/or indefinite elliptic problems. We show that a simple V-cycle multigrid iteration using conforming coarse-grid corrections converges at a uniform rate provided that the coarsest level in the multilevel iteration is sufficiently fine (but independent of the number of multigrid ...
متن کاملTowards Adaptive Smoothed Aggregation (αsa) for Nonsymmetric Problems
Applying smoothed aggregation multigrid (SA) to solve a nonsymmetric linear system, Ax = b, is often impeded by the lack of a minimization principle that can be used as a basis for the coarse-grid correction process. This paper proposes a Petrov-Galerkin (PG) approach based on applying SA to either of two symmetric positive definite (SPD) matrices, √ AtA or √ AAt. These matrices, however, are t...
متن کاملThe Analysis of Multigrid Algorithms for Nonsymmetric and Indefinite Elliptic Problems*
We prove some new estimates for the convergence of multigrid algorithms applied to nonsymmetric and indefinite elliptic boundary value problems. We provide results for the so-called 'symmetric' multigrid schemes. We show that for the variable 2^-cycle and the ^-cycle schemes, multigrid algorithms with any amount of smoothing on the finest grid converge at a rate that is independent of the numbe...
متن کاملMultiplicative Schwarz Algorithms for Some Nonsymmetric and Indefinite Problems
Abstract The classical Schwarz alternating method has recently been generalized in several directions This e ort has resulted in a number of new powerful domain decomposition methods for elliptic problems in new insight into multigrid methods and in the development of a very useful framework for the analysis of a variety of iterative methods Most of this work has focused on positive de nite sym...
متن کاملIterative Methods by Spd and Small Subspace Solvers for Nonsymmetric or Indefinite Problems
This paper is devoted to a class of iterative methods for solving nonsymmetric or indeenite problems that are dominated by some SPD (symmetric positive deenite) problems. The algorithm is based on a direct solver for the original equation restricted on a small subspace and a given iterative method for the SPD equation. It is shown that any convergent iterative method for the SPD problem will gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 17 شماره
صفحات -
تاریخ انتشار 1996