654 research outputs found
Space Decompositions and Solvers for Discontinuous Galerkin Methods
We present a brief overview of the different domain and space decomposition
techniques that enter in developing and analyzing solvers for discontinuous
Galerkin methods. Emphasis is given to the novel and distinct features that
arise when considering DG discretizations over conforming methods. Connections
and differences with the conforming approaches are emphasized.Comment: 2 pages 2 figures no table
C0 Interior Penalty Methods for Cahn-Hilliard Equations
In this work we study C0 interior penalty methods for Cahn-Hilliard equations. In Chapter 1 we introduce Cahn-Hilliard equations and the time discretization that leads to linear fourth order boundary value problems. In Chapter 2 we review related fundamentals of finite element methods and multigrid methods. In Chapter 3 we formulate the discrete problems for linear fourth order boundary value problems with the boundary conditions of the Cahn-Hilliard type, which are called C0 interior penalty methods, and we carry out the convergence analysis. In Chapter 4 we consider multigrid methods for the C0 interior penalty methods. We present two smoothing schemes and compare their performance. In Chapter 5 we apply the C0 interior penalty methods and the time discretization scheme to nonlinear time-dependent Cahn-Hilliard equations. Numerical examples for phase separation and image processing are presented
h-multigrid agglomeration based solution strategies for discontinuous Galerkin discretizations of incompressible flow problems
In this work we exploit agglomeration based -multigrid preconditioners to
speed-up the iterative solution of discontinuous Galerkin discretizations of
the Stokes and Navier-Stokes equations. As a distinctive feature -coarsened
mesh sequences are generated by recursive agglomeration of a fine grid,
admitting arbitrarily unstructured grids of complex domains, and agglomeration
based discontinuous Galerkin discretizations are employed to deal with
agglomerated elements of coarse levels. Both the expense of building coarse
grid operators and the performance of the resulting multigrid iteration are
investigated. For the sake of efficiency coarse grid operators are inherited
through element-by-element projections, avoiding the cost of numerical
integration over agglomerated elements. Specific care is devoted to the
projection of viscous terms discretized by means of the BR2 dG method. We
demonstrate that enforcing the correct amount of stabilization on coarse grids
levels is mandatory for achieving uniform convergence with respect to the
number of levels. The numerical solution of steady and unsteady, linear and
non-linear problems is considered tackling challenging 2D test cases and 3D
real life computations on parallel architectures. Significant execution time
gains are documented.Comment: 78 pages, 7 figure
Convergence and Optimality of Adaptive Mixed Finite Element Methods
The convergence and optimality of adaptive mixed finite element methods for
the Poisson equation are established in this paper. The main difficulty for
mixed finite element methods is the lack of minimization principle and thus the
failure of orthogonality. A quasi-orthogonality property is proved using the
fact that the error is orthogonal to the divergence free subspace, while the
part of the error that is not divergence free can be bounded by the data
oscillation using a discrete stability result. This discrete stability result
is also used to get a localized discrete upper bound which is crucial for the
proof of the optimality of the adaptive approximation
An agglomeration-based massively parallel non-overlapping additive Schwarz preconditioner for high-order discontinuous Galerkin methods on polytopic grids
In this article we design and analyze a class of two-level non-overlapping
additive Schwarz preconditioners for the solution of the linear system of
equations stemming from discontinuous Galerkin discretizations of second-order
elliptic partial differential equations on polytopic meshes. The preconditioner
is based on a coarse space and a non-overlapping partition of the computational
domain where local solvers are applied in parallel. In particular, the coarse
space can potentially be chosen to be non-embedded with respect to the finer
space; indeed it can be obtained from the fine grid by employing agglomeration
and edge coarsening techniques. We investigate the dependence of the condition
number of the preconditioned system with respect to the diffusion coefficient
and the discretization parameters, i.e., the mesh size and the polynomial
degree of the fine and coarse spaces. Numerical examples are presented which
confirm the theoretical bounds
- …