Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

The University of Western Ontario

$31,000.00

Computational Algorithms in Numerical and Enumerative Geometry

EF 2024-25

Résumé
Families of polynomial systems with finitely many solutions, called enumerative problems, appear ubiquitously throughout the natural sciences. Numerical algebraic geometry provides a computational paradigm for studying such families. The overarching long-term vision of this Discovery program is to develop a collection of novel algorithms which may be used to investigate enumerative problems in an automated and reliable fashion. This vision is supported by three objectives: Objective (1) To combine local search optimization methods with numerical algebraic geometry. Objective (2) To create and improve algorithms for verifying and certifying results of numerical computations. Objective (3) To develop monodromy coordinates for reducing memory requirements of numerical methods. Objective (1) involves the development of core algorithms for automatically studying enumerative problems, Objective (2) ensures that the results from these algorithms can be trusted, and Objective (3) enables the techniques of Objectives (1) and (2) to be applied to larger problems. The synergy amongst these objectives will result in a suite of algorithms which will be implemented and made publicly available.
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
RGPIN-2023-03551
Name nom
Brysiewicz, Taylor
Department département
Mathematics
Organization id
36
Institution établissement
The University of Western Ontario
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2024
Competition year année de concours
2023
Award amount
31000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR 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
2952
Research subject group en
Applied mathematics
Research subject group fr
Mathématiques appliquées
Research subject en
Linear and non-linear systems
Research subject fr
Systèmes linéaires et non linéaires
Field of research list names en
Not available
Field of research list names fr
Non disponible
Socioeconomic objective list names en
Not available
Socioeconomic objective list names fr
Non disponible
Application title
Computational Algorithms in Numerical and Enumerative Geometry
Keywords
numerical algebraic geometry; certification; optimization; homotopy algorithms; symbolic-numeric algorithms; real algebraic geometry
Application summary
Families of polynomial systems with finitely many solutions, called enumerative problems, appear ubiquitously throughout the natural sciences. Numerical algebraic geometry provides a computational paradigm for studying such families. The overarching long-term vision of this Discovery program is to develop a collection of novel algorithms which may be used to investigate enumerative problems in an automated and reliable fashion. This vision is supported by three objectives: Objective (1) To combine local search optimization methods with numerical algebraic geometry. Objective (2) To create and improve algorithms for verifying and certifying results of numerical computations. Objective (3) To develop monodromy coordinates for reducing memory requirements of numerical methods. Objective (1) involves the development of core algorithms for automatically studying enumerative problems, Objective (2) ensures that the results from these algorithms can be trusted, and Objective (3) enables the techniques of Objectives (1) and (2) to be applied to larger problems. The synergy amongst these objectives will result in a suite of algorithms which will be implemented and made publicly available.