Grant: Discovery Grants Program - Individual
University of Manitoba
$10,000.00
Domain decomposition methods for partial differential equations
EF 2015-16
Résumé
Many problems in science and engineering are posed as partial differential equations (PDEs). For instance, conservations of mass, momentum and energy can be expressed as PDEs. Except for very simple cases, no analytic solution is available and we often rely on a numerical solution of the PDEs. This grant proposal deals with a class of methods called domain decomposition methods. In modern scientific computing, the problems are so large that no single computer can handle the computational and memory demands. The idea is to split up the domain into smaller subdomains and on a parallel computer, assign each processor to a subdomain. We solve the PDE on each subdomain in parallel and then stitch together these solutions to form the global solution. These are iterative methods, meaning that typically, the computed solution converges to the exact solution after infinitely many iterations. Of course in practice, the iteration is stopped when a prescribed error tolerance is satisfied. The goal is a numerical scheme which converges optimally, that is, at a rate which is independent of the discretization parameter. Another important issue is how to define the boundary condition(s) along each interior boundary. There is a subclass of methods, called Optimized Schwarz methods, which cleverly chooses free parameter(s) in the interior boundary conditions to optimize the convergence rate. We shall work on second-order PDEs as well as more difficult fourth-order PDEs. The latter PDEs are more difficult because they are far more ill-conditioned than second-order PDEs - the rate of convergence of traditional iterative methods is far slower for the fourth-order case. This program will implement these new algorithms as well as develop a theory of convergence rate of the methods. If successful, these methods will allow scientists and engineers to solve more complex problems and/or solve problems with a higher resolution.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Manitoba, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
250303-2011
Name nom
Lui, ShiuHong(Shaun)
Department département
Mathematics
Organization id
19
Institution établissement
University of Manitoba
Province en
Manitoba
Province fr
Manitoba
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2015
Competition year année de concours
2011
Award amount
10000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
9999
Area of application group en
Not available
Area of application group fr
Non disponible
Area of application en
Not available
Area of application fr
Non disponible
Research subject code
2955
Research subject group en
Applied mathematics
Research subject group fr
Mathématiques appliquées
Research subject en
Numerical analysis
Research subject fr
Analyse numérique
Partie
5
Nb partie
5
Application title
Domain decomposition methods for partial differential equations
Keyword
NSERC
Application summary
Many problems in science and engineering are posed as partial differential equations (PDEs). For instance, conservations of mass, momentum and energy can be expressed as PDEs. Except for very simple cases, no analytic solution is available and we often rely on a numerical solution of the PDEs. This grant proposal deals with a class of methods called domain decomposition methods. In modern scientific computing, the problems are so large that no single computer can handle the computational and memory demands. The idea is to split up the domain into smaller subdomains and on a parallel computer, assign each processor to a subdomain. We solve the PDE on each subdomain in parallel and then stitch together these solutions to form the global solution. These are iterative methods, meaning that typically, the computed solution converges to the exact solution after infinitely many iterations. Of course in practice, the iteration is stopped when a prescribed error tolerance is satisfied. The goal is a numerical scheme which converges optimally, that is, at a rate which is independent of the discretization parameter. Another important issue is how to define the boundary condition(s) along each interior boundary. There is a subclass of methods, called Optimized Schwarz methods, which cleverly chooses free parameter(s) in the interior boundary conditions to optimize the convergence rate. We shall work on second-order PDEs as well as more difficult fourth-order PDEs. The latter PDEs are more difficult because they are far more ill-conditioned than second-order PDEs - the rate of convergence of traditional iterative methods is far slower for the fourth-order case. This program will implement these new algorithms as well as develop a theory of convergence rate of the methods. If successful, these methods will allow scientists and engineers to solve more complex problems and/or solve problems with a higher resolution.