Grant: Discovery Grants Program - Individual
University of Waterloo
$51,000.00
Symbolic computation of matrices of operators and related topics
EF 2011-12
Résumé
Computer algebra systems such as Maple or Mathematica have, in the past two decades, become standard computational tools for large numbers of engineers, scientists and educators. Using these systems, one can perform intricate algebraic computations using exact arithmetic with symbolic input over a wide variety of domains, for example integers and rational functions.
The primary objective of this research proposal is to extend the algebraic capabilities of computer algebra systems for working with matrices of Ore operators. Ore operators are generalizations of differential and recurrence operators. The specific improvements will center on the computation of normal forms and order bases for such matrices. The impact of this work will come in the application areas of linear and nonlinear control systems, and in algorithms for the solution of systems of differential or recurrence equations.
The difficulty in this work is the need for mathematical algorithms that correctly handle domains of computation. By this we mean algorithms that work over exact infinite domains, where the cost of arithmetic is not constant , and need to ensure that coefficient growth of intermediate expressions does not become exponentially large. In addition, algorithms whose input is approximate and compute over floating point domains need to ensure both good arithmetic complexity and numerical correctness.
A secondary objective of our work is to investigate the use of symbolic manipulation in other application areas. The specific problem studied is the discretization of nonlinear partial differential equations arising from problems in computational finance. In this case the problem is to build discretizations that provably converge to the correct financial solution.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
41897-2010
Name nom
Labahn, George
Department département
Computer Science, David R. Cheriton School of
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
2010
Award amount
51000
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
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
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
Symbolic computation of matrices of operators and related topics
Keyword
NSERC
Application summary
Computer algebra systems such as Maple or Mathematica have, in the past two decades, become standard computational tools for large numbers of engineers, scientists and educators. Using these systems, one can perform intricate algebraic computations using exact arithmetic with symbolic input over a wide variety of domains, for example integers and rational functions.
The primary objective of this research proposal is to extend the algebraic capabilities of computer algebra systems for working with matrices of Ore operators. Ore operators are generalizations of differential and recurrence operators. The specific improvements will center on the computation of normal forms and order bases for such matrices. The impact of this work will come in the application areas of linear and nonlinear control systems, and in algorithms for the solution of systems of differential or recurrence equations.
The difficulty in this work is the need for mathematical algorithms that correctly handle domains of computation. By this we mean algorithms that work over exact infinite domains, where the cost of arithmetic is not constant , and need to ensure that coefficient growth of intermediate expressions does not become exponentially large. In addition, algorithms whose input is approximate and compute over floating point domains need to ensure both good arithmetic complexity and numerical correctness.
A secondary objective of our work is to investigate the use of symbolic manipulation in other application areas. The specific problem studied is the discretization of nonlinear partial differential equations arising from problems in computational finance. In this case the problem is to build discretizations that provably converge to the correct financial solution.