19 research outputs found
Schwarz methods for a preconditioned WOPSIP method for elliptic problems
We construct and analyze non-overlapping Schwarz methods for a preconditioned weakly over-penalized symmetric interior penalty (WOPSIP) method for elliptic problems
Higher order weakly over-penalized symmetric interior penalty methods
In this paper we study higher order weakly over-penalized symmetric interior penalty methods for second-order elliptic boundary value problems in two dimensions. We derive hp error estimates in both the energy norm and the norm and present numerical results that corroborate the theoretical results. © 2012 Elsevier B.V. All rights reserved. L
A note on optimal spectral bounds for nonoverlapping domain decomposition preconditioners for hp-version discontinuous Galerkin methods
In this article, we consider the derivation of hp-optimal spectral bounds for a class of domain decomposition preconditioners based on the Schwarz framework for discontinuous Galerkin finite element approximations of second-order elliptic partial differential equations. In particular, we improve the bounds derived in our earlier article [P.F. Antonietti and P. Houston, J. Sci. Comput., 46(1):124--149, 2011] in the sense that the resulting bound on the condition number of the preconditioned system is not only explicit with respect to the coarse and fine mesh sizes H and h, respectively, and the fine mesh polynomial degree p, but now also explicit with respect to the polynomial degree q employed for the coarse grid solver. More precisely, we show that the resulting spectral bounds are of order p^2H/(qh) for the hp-version of the discontinuous Galerkin method
A note on optimal spectral bounds for nonoverlapping domain decomposition preconditioners for hp-version discontinuous Galerkin methods
In this article, we consider the derivation of hp-optimal spectral bounds for a class of domain decomposition preconditioners based on the Schwarz framework for discontinuous Galerkin finite element approximations of second-order elliptic partial differential equations. In particular, we improve the bounds derived in our earlier article [P.F. Antonietti and P. Houston, J. Sci. Comput., 46(1):124--149, 2011] in the sense that the resulting bound on the condition number of the preconditioned system is not only explicit with respect to the coarse and fine mesh sizes H and h, respectively, and the fine mesh polynomial degree p, but now also explicit with respect to the polynomial degree q employed for the coarse grid solver. More precisely, we show that the resulting spectral bounds are of order p^2H/(qh) for the hp-version of the discontinuous Galerkin method
A note on optimal spectral bounds for nonoverlapping domain decomposition preconditioners for hp-version discontinuous Galerkin methods
In this article, we consider the derivation of hp-optimal spectral bounds for a class of domain decomposition preconditioners based on the Schwarz framework for discontinuous Galerkin finite element approximations of second-order elliptic partial differential equations. In particular, we improve the bounds derived in our earlier article [P.F. Antonietti and P. Houston, J. Sci. Comput., 46(1):124-149, 2011] in the sense that the resulting bound on the condition number of the preconditioned system is not only explicit with respect to the coarse and fine mesh sizes H and h, respectively, and the fine mesh polynomial degree p, but now also explicit with respect to the polynomial degree q employed for the coarse grid solver. More precisely, we show that the resulting spectral bounds are of order p2H/(qh) for the hp-version of the discontinuous Galerkin method
A note on optimal spectral bounds for nonoverlapping domain decomposition preconditioners for hp-version discontinuous Galerkin methods
In this article, we consider the derivation of hp-optimal spectral bounds for a class of domain decomposition preconditioners based on the Schwarz framework for discontinuous Galerkin finite element approximations of second-order elliptic partial differential equations. In particular, we improve the bounds derived in our earlier article [P.F. Antonietti and P. Houston, J. Sci. Comput., 46(1):124--149, 2011] in the sense that the resulting bound on the condition number of the preconditioned system is not only explicit with respect to the coarse and fine mesh sizes H and h, respectively, and the fine mesh polynomial degree p, but now also explicit with respect to the polynomial degree q employed for the coarse grid solver. More precisely, we show that the resulting spectral bounds are of order p^2H/(qh) for the hp-version of the discontinuous Galerkin method
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