293 research outputs found
Recommended from our members
Schnelle Löser für Partielle Differentialgleichungen
The workshop Schnelle Löser für partielle Differentialgleichungen, organised by Randolph E. Bank (La Jolla), Wolfgang Hackbusch (Leipzig), and Gabriel Wittum (Frankfurt am Main), was held May 22nd–May 28th, 2011. This meeting was well attended by 54 participants with broad geographic representation from 7 countries and 3 continents. This workshop was a nice blend of researchers with various backgrounds
A fully algebraic and robust two-level Schwarz method based on optimal local approximation spaces
Two-level domain decomposition preconditioners lead to fast convergence and
scalability of iterative solvers. However, for highly heterogeneous problems,
where the coefficient function is varying rapidly on several possibly
non-separated scales, the condition number of the preconditioned system
generally depends on the contrast of the coefficient function leading to a
deterioration of convergence. Enhancing the methods by coarse spaces
constructed from suitable local eigenvalue problems, also denoted as adaptive
or spectral coarse spaces, restores robust, contrast-independent convergence.
However, these eigenvalue problems typically rely on non-algebraic information,
such that the adaptive coarse spaces cannot be constructed from the fully
assembled system matrix. In this paper, a novel algebraic adaptive coarse
space, which relies on the a-orthogonal decomposition of (local) finite element
(FE) spaces into functions that solve the partial differential equation (PDE)
with some trace and FE functions that are zero on the boundary, is proposed. In
particular, the basis is constructed from eigenmodes of two types of local
eigenvalue problems associated with the edges of the domain decomposition. To
approximate functions that solve the PDE locally, we employ a transfer
eigenvalue problem, which has originally been proposed for the construction of
optimal local approximation spaces for multiscale methods. In addition, we make
use of a Dirichlet eigenvalue problem that is a slight modification of the
Neumann eigenvalue problem used in the adaptive generalized Dryja-Smith-Widlund
(AGDSW) coarse space. Both eigenvalue problems rely solely on local Dirichlet
matrices, which can be extracted from the fully assembled system matrix. By
combining arguments from multiscale and domain decomposition methods we derive
a contrast-independent upper bound for the condition number
Superior properties of the PRESB preconditioner for operators on two-by-two block form with square blocks
Matrices or operators in two-by-two block form with square blocks arise in numerous important applications, such as in optimal control problems for PDEs. The problems are normally of very large scale so iterative solution methods must be used. Thereby the choice of an efficient and robust preconditioner is of crucial importance. Since some time a very efficient preconditioner, the preconditioned square block, PRESB method has been used by the authors and coauthors in various applications, in particular for optimal control problems for PDEs. It has been shown to have excellent properties, such as a very fast and robust rate of convergence that outperforms other methods. In this paper the fundamental and most important properties of the method are stressed and presented with new and extended proofs. Under certain conditions, the condition number of the preconditioned matrix is bounded by 2 or even smaller. Furthermore, under certain assumptions the rate of convergence is superlinear
Space-time discontinuous Galerkin discretizations for linear first-order hyperbolic evolution systems
We introduce a space-time discretization for linear first-order hyperbolic evolution systems using a discontinuous Galerkin approximation in space and a Petrov-Galerkin scheme in time. We show well-posedness and convergence of the discrete system. Then we introduce an adaptive strategy based on goal-oriented dual-weighted error estimation. The full space-time linear system is solved with a parallel multilevel preconditioner. Numerical experiments for the linear transport equation and the Maxwell equation in 2D underline the effciency of the overall adaptive solution process
Scalable domain decomposition methods for finite element approximations of transient and electromagnetic problems
The main object of study of this thesis is the development of scalable and robust solvers based on domain decomposition (DD) methods for the linear systems arising from the finite element (FE) discretization of transient and electromagnetic problems.
The thesis commences with a theoretical review of the curl-conforming edge (or Nédélec) FEs of the first kind and a comprehensive description of a general implementation strategy for h- and p- adaptive elements of arbitrary order on tetrahedral and hexahedral non-conforming meshes. Then, a novel balancing domain decomposition by constraints (BDDC) preconditioner that is robust for multi-material and/or heterogeneous problems posed in curl-conforming spaces is presented. The new method, in contrast to existent approaches, is based on the definition of the ingredients of the preconditioner according to the physical coefficients of the problem and does not require spectral information. The result is a robust and highly scalable preconditioner that preserves the simplicity of the original BDDC method.
When dealing with transient problems, the time direction offers itself an opportunity for further parallelization. Aiming to design scalable space-time solvers, first, parallel-in-time parallel methods for linear and non-linear ordinary differential equations (ODEs) are proposed, based on (non-linear) Schur complement efficient solvers of a multilevel partition of the time interval. Then, these ideas are combined with DD concepts in order to design a two-level preconditioner as an extension to space-time of the BDDC method. The key ingredients for these new methods are defined such that they preserve the time causality, i.e., information only travels from the past to the future. The proposed schemes are weakly scalable in time and space-time, i.e., one can efficiently exploit increasing computational resources to solve more time steps in (approximately) the same time-to-solution.
All the developments presented herein are motivated by the driving application of the thesis, the 3D simulation of the low-frequency electromagnetic response of High Temperature Superconductors (HTS). Throughout the document, an exhaustive set of numerical experiments, which includes the simulation of a realistic 3D HTS problem, is performed in order to validate the suitability and assess the parallel performance of the High Performance Computing (HPC) implementation of the proposed algorithms.L’objecte principal d’estudi d’aquesta tesi és el desenvolupament de solucionadors escalables i robustos basats en mètodes de descomposició de dominis (DD) per a sistemes lineals que sorgeixen en la discretització mitjançant elements finits (FE) de problemes transitoris i electromagnètics.
La tesi comença amb una revisió teòrica dels FE d’eix (o de Nédélec) de la primera famÃlia i una descripció exhaustiva d’una estratègia d’implementació general per a elements h- i p-adaptatius d’ordre arbitrari en malles de tetraedres i hexaedres noconformes.
Llavors, es presenta un nou precondicionador de descomposició de dominis balancejats per restricció (BDDC) que és robust per a problemes amb múltiples materials i/o heterogenis definits en espais curl-conformes. El nou mètode, en contrast amb els enfocaments existents, està basat en la definició dels ingredients del precondicionador segons els coeficients fÃsics del problema i no requereix informació espectral. El resultat és un precondicionador robust i escalable que preserva la simplicitat del mètode original BDDC.
Quan tractem amb problemes transitoris, la direcció temporal ofereix ella mateixa l’oportunitat de seguir explotant paral·lelisme. Amb l’objectiu de dissenyar precondicionadors en espai-temps, primer, proposem solucionadors paral·lels en temps per equacions diferencials lineals i no-lineals, basats en un solucionador eficient del complement de Schur d’una partició multinivell de l’interval de temps. Seguidament, aquestes idees es combinen amb conceptes de DD amb l’objectiu de dissenyar precondicionadors com a extensió a espai-temps dels mètodes de BDDC. Els ingredients clau d’aquests nous mètodes es defineixen de tal manera que preserven la causalitat del temps, on la informació només viatja de temps passats a temps futurs. Els esquemes proposats són dèbilment escalables en temps i en espai-temps, és a dir, es poden explotar eficientment recursos computacionals creixents per resoldre més passos de temps en (aproximadament) el mateix temps transcorregut de cà lcul.
Tots els desenvolupaments presentats aquà són motivats pel problema d’aplicació de la tesi, la simulació de la resposta electromagnètica de baixa freqüència dels superconductors d’alta temperatura (HTS) en 3D. Al llarg del document, es realitza un conjunt exhaustiu d’experiments numèrics, els quals inclouen la simulació d’un problema de HTS realista en 3D, per validar la idoneïtat i el rendiment paral·lel de la implementació per a computació d’alt rendiment dels algorismes proposatsPostprint (published version
- …