Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Western Ontario

$22,000.00

Efficient symbolic-numeric algorithms for structured constrained differential polynamial systems

EF 2015-16

Résumé
Symbolic Computation is the study of algorithms and software systems to manipulate mathematical expressions. Until recently the algorithms have processed exact expressions and equations only. Driven by the needs of applications, in which data is approximate, the subject has grown to include symbolic-numeric computation for polynomial equations. This is part of a broad effort to combine the generality of exact symbolic computation with the realism and efficiency of numeric computation. Building on my previous results my proposal extends this subject further to efficient symbolic-numeric algorithms for approximate differential polynomial systems. Such systems express fundamental laws of science and applications have yielded ever more complicated systems involving, for example 100's of differential equations for the currents in complex circuits and the motions of components of medical robots. To analyze and solve such complicated models, computers are required at every stage: from formulation to solution. Differentiation of such systems can reveal hidden constraints which are crucial in their geometric and solution properties. The proposal is to create and analyze new algorithms for such systems which enable: the stable and efficient symbolic-numeric algorithmic determination of their constraints; and the computer exploitation of the resulting geometry in the analysis and solution process. Algorithms will also be developed for exploiting the structure of systems typically arising in applications. This builds on powerful results in differential geometry and differential algebra, combined with the new area Numerical Algebraic Geometry, that gives a numerically stable approach for the first time to the simpler subclass of approximate polynomial equations. Existing symbolic techniques can detect global constraint structure but are limited to exact systems; while existing numeric techniques for more realistic approximate systems detect local, but not global structure. The research focuses on symbolic-numeric algorithms for structured systems, including global structure.
Programme
Discovery Grants Program - Individual
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
184166-2009
Name nom
Reid, Greg
Department département
Applied Mathematics
Organization id
36
Institution établissement
University of Western Ontario
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2015
Competition year année de concours
2009
Award amount
22000
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
337
Committee name en
Pure & Applied Maths - B
Committee name fr
Maths pures et appliquées - B
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
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
5
Nb partie
5
Application title
Efficient symbolic-numeric algorithms for structured constrained differential polynamial systems
Keyword
NSERC
Application summary
Symbolic Computation is the study of algorithms and software systems to manipulate mathematical expressions. Until recently the algorithms have processed exact expressions and equations only. Driven by the needs of applications, in which data is approximate, the subject has grown to include symbolic-numeric computation for polynomial equations. This is part of a broad effort to combine the generality of exact symbolic computation with the realism and efficiency of numeric computation. Building on my previous results my proposal extends this subject further to efficient symbolic-numeric algorithms for approximate differential polynomial systems. Such systems express fundamental laws of science and applications have yielded ever more complicated systems involving, for example 100's of differential equations for the currents in complex circuits and the motions of components of medical robots. To analyze and solve such complicated models, computers are required at every stage: from formulation to solution. Differentiation of such systems can reveal hidden constraints which are crucial in their geometric and solution properties. The proposal is to create and analyze new algorithms for such systems which enable: the stable and efficient symbolic-numeric algorithmic determination of their constraints; and the computer exploitation of the resulting geometry in the analysis and solution process. Algorithms will also be developed for exploiting the structure of systems typically arising in applications. This builds on powerful results in differential geometry and differential algebra, combined with the new area Numerical Algebraic Geometry, that gives a numerically stable approach for the first time to the simpler subclass of approximate polynomial equations. Existing symbolic techniques can detect global constraint structure but are limited to exact systems; while existing numeric techniques for more realistic approximate systems detect local, but not global structure. The research focuses on symbolic-numeric algorithms for structured systems, including global structure.