Grant: Discovery Grants Program - Individual
Simon Fraser University
$78,000.00
Adaptive solution of differential equations
EF 2008-09
Résumé
Development of increasingly powerful supercomputers is primarily driven by the need to numerically solve nonlinear partial differential equations (PDEs), the essence of most complex mathematical models in science and engineering. A wide array of sophisticated software tools are required, perhaps the most challenging, both from a theoretical and practical point of view, being robust adaptive algorithms. The role of such an algorithm is deceptively simple to state: recognize the regions where a physical solution is difficult to approximate, provide some measure of the extent of that difficulty, and adapt the numerical solution process accordingly. While scientists and engineers doing large scale computation have out of necessity long used adaptive algorithms, scientific computing as a discipline was initially slow to embrace its fundamental theoretical importance. Nevertheless, today journals are replete with papers analyzing adaptivity. Over the last fifteen years we have developed a class of adaptive techniques called moving mesh methods, which despite being slow to gain acceptance, are now viewed by increasing numbers of experts as an indispensible component of general numerical PDE algorithms for solving complex problems in areas as diverse as climate modelling and engineering design. Our research, focussed now mainly on higher dimensional problems, is proceeding apace on several fronts: (1) Most of the classical adaptive algorithms have traditionally been based upon variational techniques. Inspired by early work of engineers, we are investigating a fascinating new class of algorithms motivated more by geometric principles. (2) The acid test of any method being its ability to solve real world problems, we are refining a variety of techniques and developing mathematical software which incorporates the different moving mesh approaches. (3) We are applying these adaptive algorithms in new ways such as for moving front problems, to other classes of PDEs such as 4th order problems capable of modelling rich solution behaviour, and to new areas of application such as image registration. (4) Lastly, our ultimate goal is to provide a unifying framework and theory for mesh adaptivity.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
8781-2007
Name nom
Russell, Robert
Department département
Mathematics
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2007
Award amount
78000
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
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
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
2
Nb partie
5
Application title
Adaptive solution of differential equations
Keyword
NA
Application summary
Development of increasingly powerful supercomputers is primarily driven by the need to numerically solve nonlinear partial differential equations (PDEs), the essence of most complex mathematical models in science and engineering. A wide array of sophisticated software tools are required, perhaps the most challenging, both from a theoretical and practical point of view, being robust adaptive algorithms. The role of such an algorithm is deceptively simple to state: recognize the regions where a physical solution is difficult to approximate, provide some measure of the extent of that difficulty, and adapt the numerical solution process accordingly. While scientists and engineers doing large scale computation have out of necessity long used adaptive algorithms, scientific computing as a discipline was initially slow to embrace its fundamental theoretical importance. Nevertheless, today journals are replete with papers analyzing adaptivity. Over the last fifteen years we have developed a class of adaptive techniques called moving mesh methods, which despite being slow to gain acceptance, are now viewed by increasing numbers of experts as an indispensible component of general numerical PDE algorithms for solving complex problems in areas as diverse as climate modelling and engineering design. Our research, focussed now mainly on higher dimensional problems, is proceeding apace on several fronts: (1) Most of the classical adaptive algorithms have traditionally been based upon variational techniques. Inspired by early work of engineers, we are investigating a fascinating new class of algorithms motivated more by geometric principles. (2) The acid test of any method being its ability to solve real world problems, we are refining a variety of techniques and developing mathematical software which incorporates the different moving mesh approaches. (3) We are applying these adaptive algorithms in new ways such as for moving front problems, to other classes of PDEs such as 4th order problems capable of modelling rich solution behaviour, and to new areas of application such as image registration. (4) Lastly, our ultimate goal is to provide a unifying framework and theory for mesh adaptivity.