Déposez votre fichier ici pour le déplacer vers cet enregistrement.
2 y
This talk focuses on challenges that we address when designing linear solvers that aim at achieving scalability on large scale computers, while also preserving numerical robustness. We will consider preconditioned Krylov subspace solvers. Getting scalability relies on reducing global synchronizations between processors, while also increasing the arithmetic intensity on one processor. Achieving robustness relies on ensuring that the condition number of the preconditioned matrix is bounded. We will discuss two different approaches for this. The first approach relies on enlarged Krylov subspace methods that aim at computing an enlarged subspace and obtain a faster convergence of the iterative method. The second approach relies on a multilevel Schwarz preconditioner, a multilevel extension of the GenEO preconditioner, that is basedon constructing robustly a hierarchy of coarse spaces. Numerical results on large scale computers, in particular for linear systems arising from solving linear elasticity problems, will discuss the efficiency of the proposed methods.
[-]
This talk focuses on challenges that we address when designing linear solvers that aim at achieving scalability on large scale computers, while also preserving numerical robustness. We will consider preconditioned Krylov subspace solvers. Getting scalability relies on reducing global synchronizations between processors, while also increasing the arithmetic intensity on one processor. Achieving robustness relies on ensuring that the condition ...
[+]
65F08 ; 65F10 ; 65N55
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
Linear matrix equations such as the Lyapunov and Sylvester equations and their generalizations have classically played an important role in the analysis of dynamical systems, in control theory and in eigenvalue computation. More recently, matrix equations have emerged as a natural linear algebra framework for the discretized version of (systems of) partial differential equations (PDEs), possibly evolving in time. In this new framework, new challenges have arisen. In this talk we review some of the key methodologies for solving large scale linear and quadratic matrix equations. We will also discuss recent matrix-based strategies for the numerical solution of time-dependent problems arising in control and in the analysis of spatial pattern formations in certain electrodeposition models.
[-]
Linear matrix equations such as the Lyapunov and Sylvester equations and their generalizations have classically played an important role in the analysis of dynamical systems, in control theory and in eigenvalue computation. More recently, matrix equations have emerged as a natural linear algebra framework for the discretized version of (systems of) partial differential equations (PDEs), possibly evolving in time. In this new framework, new ...
[+]
65F10 ; 65M22 ; 15A24
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
We present a novel approach to the solution of time-dependent PDEs via the so-called monolithic or all-at-once formulation. This approach will be explained for simple parabolic problems and its utility in the context of PDE constrained optimization problems will be elucidated.
The underlying linear algebra includes circulant matrix approximations of Toeplitz-structured matrices and allows for effective parallel implementation. Simple computational results will be shown for the heat equation and the wave equation which indicate the potential as a parallel-in-time method.
This is joint work with Elle McDonald (CSIRO, Australia), Jennifer Pestana (Strathclyde University, UK) and Anthony Goddard (Durham University, UK)
[-]
We present a novel approach to the solution of time-dependent PDEs via the so-called monolithic or all-at-once formulation. This approach will be explained for simple parabolic problems and its utility in the context of PDE constrained optimization problems will be elucidated.
The underlying linear algebra includes circulant matrix approximations of Toeplitz-structured matrices and allows for effective parallel implementation. Simple co...
[+]
65F08 ; 15B05 ; 65M22
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
I will present an efficient implementation of the highly robust and scalable GenEO preconditioner in the high-performance PDE framework DUNE. The GenEO coarse space is constructed by combining low energy solutions of local generalised eigenproblems using a partition of unity. In this talk, both weak and strong scaling for the GenEO solver on over 15,000 cores will be demonstrated by solving an industrially motivated problem with over 200 million degrees of freedom in aerospace composites modelling. Further, it will be shown that for highly complex parameter distributions in certain real-world applications, established methods can become intractable while GenEO remains fully effective. In the context of multilevel Markov chain Monte Carlo (MLMCMC), the GenEO coarse space also plays an important role as an effective surrogate model in PDE-constrained Bayesian inference. The second part will therefore focus on the approximation properties of the GenEO coarse space and on a high-performance parallel implementation of MLMCMC.
This is joint work with Tim Dodwell (Exeter), Anne Reinarz (TU Munich) and Linus Seelinger (Heidelberg).
[-]
I will present an efficient implementation of the highly robust and scalable GenEO preconditioner in the high-performance PDE framework DUNE. The GenEO coarse space is constructed by combining low energy solutions of local generalised eigenproblems using a partition of unity. In this talk, both weak and strong scaling for the GenEO solver on over 15,000 cores will be demonstrated by solving an industrially motivated problem with over 200 million ...
[+]
65F08 ; 65N22 ; 65N30 ; 65N55
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
Both multigrid and domain decomposition methods are so called optimal solvers for Laplace type problems, but how do they compare? I will start by showing in what sense these methods are optimal for the Laplace equation, which will reveal that while both multigrid and domain decomposition are iterative solvers, there are fundamental differences between them. Multigrid for Laplace's equation is a standalone solver, while classical domain decomposition methods like the additive Schwarz method or Neumann-Neumann and FETI methods need Krylov acceleration to work. I will explain in detail for each case why this is so, and then also present modifications so that Krylov acceleration is not necessary any more. For overlapping methods, this leads to the use of partitions of unity, while for non-overlapping methods, the coarse space can be a remedy. Good coarse spaces in domain decomposition methods are very different from coarse spaces in multigrid, due to the very aggressive coarsening in domain decomposition. I will introduce the concept of optimal coarse spaces for domain decomposition in a sense very different from the optimal above, and then present approximations of this coarse space. Together with optimized transmission conditions, this leads to a two level domain decomposition method of Schwarz type which is competitive with multigrid for Laplace's equation in wallclock time.
[-]
Both multigrid and domain decomposition methods are so called optimal solvers for Laplace type problems, but how do they compare? I will start by showing in what sense these methods are optimal for the Laplace equation, which will reveal that while both multigrid and domain decomposition are iterative solvers, there are fundamental differences between them. Multigrid for Laplace's equation is a standalone solver, while classical domain ...
[+]
65N55 ; 65N22 ; 65F10
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
This presentation will be kept at a basic level, both continuous and algebraic versions of the methods will be given in their most common variants and the main ingredients of domain decomposition methods will be presented. The content will follow the lines of the chapters 1 and 3 from the domain decomposition book. A short introduction to Freefem software will be given which will allow the students to use quickly the codes illustrating the methods.
Outcomes: At the end of this first lecture, students will have a basic understanding of the methods but also of their implementation.
[-]
This presentation will be kept at a basic level, both continuous and algebraic versions of the methods will be given in their most common variants and the main ingredients of domain decomposition methods will be presented. The content will follow the lines of the chapters 1 and 3 from the domain decomposition book. A short introduction to Freefem software will be given which will allow the students to use quickly the codes illustrating the ...
[+]
65N55
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
Domain decomposition methods are meant to be used as parallel solvers and scalability (behaviour independent of the number of subdomains/processors) and robustness with respect to the physical parameters are very important issues. An introduction to coarse spaces and two-level methods for symmetric positive definite (SPD) problems will be given together with the presentation of a few variants of domain decomposition preconditioners (AS, RAS, ORAS, SORAS). The content will follow chapters 4 and 5 from the book, although more recent research results will also be included.
Outcomes: Students will be able to understand the use and the impact of the two-level methods both for scalability and robustness (even if at this stage the codes are sequential).
[-]
Domain decomposition methods are meant to be used as parallel solvers and scalability (behaviour independent of the number of subdomains/processors) and robustness with respect to the physical parameters are very important issues. An introduction to coarse spaces and two-level methods for symmetric positive definite (SPD) problems will be given together with the presentation of a few variants of domain decomposition preconditioners (AS, RAS, ...
[+]
65N55
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
Parametric PDEs arise in key applications ranging from parameter optimization, inverse state estimation, to uncertainty quantification. Accurately solving these tasks requires an efficient treatment of the resulting sets of parametric PDE solutions that are generated when parameters vary in a certain range. These solution sets are difficult to handle since their are embedded in infinite dimensional spaces, and present a complex structure. They need to be approximated with numerically efficient reduction techniques, usually called Model Order Reduction methods. The techniques need to be adapted both to the nature of the PDE, and to the given application task. In this course, we will give an overview of linear and nonlinear model order reduction methods when applied to forward and inverse problems. We will particularly emphasize on the role played by nonlinear approximation and geometrical PDE properties to address classical bottlenecks.
[-]
Parametric PDEs arise in key applications ranging from parameter optimization, inverse state estimation, to uncertainty quantification. Accurately solving these tasks requires an efficient treatment of the resulting sets of parametric PDE solutions that are generated when parameters vary in a certain range. These solution sets are difficult to handle since their are embedded in infinite dimensional spaces, and present a complex structure. They ...
[+]
65N21 ; 65D99
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
Parametric PDEs arise in key applications ranging from parameter optimization, inverse state estimation, to uncertainty quantification. Accurately solving these tasks requires an efficient treatment of the resulting sets of parametric PDE solutions that are generated when parameters vary in a certain range. These solution sets are difficult to handle since their are embedded in infinite dimensional spaces, and present a complex structure. They need to be approximated with numerically efficient reduction techniques, usually called Model Order Reduction methods. The techniques need to be adapted both to the nature of the PDE, and to the given application task. In this course, we will give an overview of linear and nonlinear model order reduction methods when applied to forward and inverse problems. We will particularly emphasize on the role played by nonlinear approximation and geometrical PDE properties to address classical bottlenecks.
[-]
Parametric PDEs arise in key applications ranging from parameter optimization, inverse state estimation, to uncertainty quantification. Accurately solving these tasks requires an efficient treatment of the resulting sets of parametric PDE solutions that are generated when parameters vary in a certain range. These solution sets are difficult to handle since their are embedded in infinite dimensional spaces, and present a complex structure. They ...
[+]
65N21 ; 65D99
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
Parametric PDEs arise in key applications ranging from parameter optimization, inverse state estimation, to uncertainty quantification. Accurately solving these tasks requires an efficient treatment of the resulting sets of parametric PDE solutions that are generated when parameters vary in a certain range. These solution sets are difficult to handle since their are embedded in infinite dimensional spaces, and present a complex structure. They need to be approximated with numerically efficient reduction techniques, usually called Model Order Reduction methods. The techniques need to be adapted both to the nature of the PDE, and to the given application task. In this course, we will give an overview of linear and nonlinear model order reduction methods when applied to forward and inverse problems. We will particularly emphasize on the role played by nonlinear approximation and geometrical PDE properties to address classical bottlenecks.
[-]
Parametric PDEs arise in key applications ranging from parameter optimization, inverse state estimation, to uncertainty quantification. Accurately solving these tasks requires an efficient treatment of the resulting sets of parametric PDE solutions that are generated when parameters vary in a certain range. These solution sets are difficult to handle since their are embedded in infinite dimensional spaces, and present a complex structure. They ...
[+]
65N21 ; 65D99