multigrid convergence
Recently Published Documents


TOTAL DOCUMENTS

45
(FIVE YEARS 1)

H-INDEX

12
(FIVE YEARS 0)

2021 ◽  
Vol 47 (3) ◽  
pp. 1-22
Author(s):  
Patrick E. Farrell ◽  
Matthew G. Knepley ◽  
Lawrence Mitchell ◽  
Florian Wechsung

Effective relaxation methods are necessary for good multigrid convergence. For many equations, standard Jacobi and Gauß–Seidel are inadequate, and more sophisticated space decompositions are required; examples include problems with semidefinite terms or saddle point structure. In this article, we present a unifying software abstraction, PCPATCH, for the topological construction of space decompositions for multigrid relaxation methods. Space decompositions are specified by collecting topological entities in a mesh (such as all vertices or faces) and applying a construction rule (such as taking all degrees of freedom in the cells around each entity). The software is implemented in PETSc and facilitates the elegant expression of a wide range of schemes merely by varying solver options at runtime. In turn, this allows for the very rapid development of fast solvers for difficult problems.


2016 ◽  
Vol 57 (3) ◽  
pp. 423-438 ◽  
Author(s):  
Andreas Schindele ◽  
Peter Massopust ◽  
Brigitte Forster

2013 ◽  
Vol 3 (1) ◽  
pp. 171-181
Author(s):  
Jacques-Olivier Lachaud

2012 ◽  
Vol 17 (2) ◽  
pp. 227-244 ◽  
Author(s):  
Natalia Boal ◽  
Francisco Jos´e Gaspar ◽  
Francisco Lisbona ◽  
Petr Vabishchevich

This paper deals with the numerical solution of a two-dimensional thermoporoelasticity problem using a finite-difference scheme. Two issues are discussed: stability and convergence in discrete energy norms of the finite-difference scheme are proved, and secondly, a distributive smoother is examined in order to find a robust and efficient multigrid solver for the corresponding system of equations. Numerical experiments confirm the convergence properties of the proposed scheme, as well as fast multigrid convergence.


2011 ◽  
Vol 03 (01n02) ◽  
pp. 229-249 ◽  
Author(s):  
PANAYOT S. VASSILEVSKI

We give an overview of a number of algebraic multigrid methods targeting finite element discretization problems. The focus is on the properties of the constructed hierarchy of coarse spaces that guarantee (two-grid) convergence. In particular, a necessary condition known as "weak approximation property," and a sufficient one, referred to as "strong approximation property," are discussed. Their role in proving convergence of the TG method (as iterative method) and also on the approximation properties of the algebraic mottigrid (AMG) coarse spaces if used as discretization tool is pointed out. Some preliminary numerical results illustrating the latter aspect are also reported.


Sign in / Sign up

Export Citation Format

Share Document