Grant: Discovery Grants Program - Individual
University of Waterloo
$18,000.00
High-order adaptive methods for hyperbolic conservation laws
FY 2011-12
Summary
This proposal is aimed at the development of new high-order adaptive algorithms for the numerical solution of hyperbolic conservation laws using discontinuous Galerkin methods (DGM). These methods are becoming important for the computation of solutions of large scale problems modeled by partial differential equations. Their attractive features are an element-wise conservation property, high-order accuracy, easy adaptivity, and simple parallel solution procedures. They are used in such diverse applications as fluid dynamics, aeroacoustics, electromagnetics, and optics. This work will lead to more accurate computer simulations and shorter design times.
By representing the solution via a high-order basis, the DGM is capable of computing a highly accurate numerical solution. For the method to be competitive, it must do so efficiently and rapidly. This proposal will develop several tools in that direction. Adaptive algorithms concentrate computing resources in regions where they are most needed. Thus, fewer cells are needed to achieve the prescribed accuracy. New adaptive algorithms capable of combining two types of adaptivity: h-refinement (mesh enrichment) and p-refinement (order variation) will be developed. New stabilizing (limiting) techniques will be investigated for such fully adaptive schemes. We will further seek efficiency by developing a time-adaptive scheme for the method of lines with explicit Runge-Kutta time integrators. By using a local time step on each cell, the scheme will need an overall fewer number of function evaluations. Thus, the simulation will be completed in a shorter time. We then will develop a discontinuous Galerkin method on Cartesian grids with embedded boundaries. Such grids are easier to construct and faster to compute on than unstructured triangular/ tetrahedral meshes. Training of graduate and undergraduate students will be an important component of the proposed program.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
341373-2007
Name nom
Krivodonova, Lilia
Department département
Applied Mathematics
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2007
Award amount
18000
Program id
RGPIN
Program nane 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
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
405
Area of application group en
Environment
Area of application group fr
Environnement
Area of application en
Modelling and mathematical simulation of natural processes
Area of application fr
Modélisation et simulation mathématique des processus naturels
Research subject code
2714
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Mathematics of computing
Research subject fr
Mathématiques de l'informatique
Partie
5
Nb partie
5
Application title
High-order adaptive methods for hyperbolic conservation laws
Keyword
NSERC
Application summary
This proposal is aimed at the development of new high-order adaptive algorithms for the numerical solution of hyperbolic conservation laws using discontinuous Galerkin methods (DGM). These methods are becoming important for the computation of solutions of large scale problems modeled by partial differential equations. Their attractive features are an element-wise conservation property, high-order accuracy, easy adaptivity, and simple parallel solution procedures. They are used in such diverse applications as fluid dynamics, aeroacoustics, electromagnetics, and optics. This work will lead to more accurate computer simulations and shorter design times.
By representing the solution via a high-order basis, the DGM is capable of computing a highly accurate numerical solution. For the method to be competitive, it must do so efficiently and rapidly. This proposal will develop several tools in that direction. Adaptive algorithms concentrate computing resources in regions where they are most needed. Thus, fewer cells are needed to achieve the prescribed accuracy. New adaptive algorithms capable of combining two types of adaptivity: h-refinement (mesh enrichment) and p-refinement (order variation) will be developed. New stabilizing (limiting) techniques will be investigated for such fully adaptive schemes. We will further seek efficiency by developing a time-adaptive scheme for the method of lines with explicit Runge-Kutta time integrators. By using a local time step on each cell, the scheme will need an overall fewer number of function evaluations. Thus, the simulation will be completed in a shorter time. We then will develop a discontinuous Galerkin method on Cartesian grids with embedded boundaries. Such grids are easier to construct and faster to compute on than unstructured triangular/ tetrahedral meshes. Training of graduate and undergraduate students will be an important component of the proposed program.