9,767 research outputs found
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
Numerical homogenization of elliptic PDEs with similar coefficients
We consider a sequence of elliptic partial differential equations (PDEs) with
different but similar rapidly varying coefficients. Such sequences appear, for
example, in splitting schemes for time-dependent problems (with one coefficient
per time step) and in sample based stochastic integration of outputs from an
elliptic PDE (with one coefficient per sample member). We propose a
parallelizable algorithm based on Petrov-Galerkin localized orthogonal
decomposition (PG-LOD) that adaptively (using computable and theoretically
derived error indicators) recomputes the local corrector problems only where it
improves accuracy. The method is illustrated in detail by an example of a
time-dependent two-pase Darcy flow problem in three dimensions
- …