Grant: Discovery Grants Program - Individual
University of Manitoba
$41,000.00
Efficient algorithms for the symbolic computation of matrices
EF 2020-21
Résumé
Symbolic computation (also called computer algebra) is a relatively recent research area in computer science and mathematics, which refers to the study and development of algorithms and software for manipulating mathematical expressions and other mathematical objects, in particular, mathematical computations performed symbolically rather than numerically. Because of its lack of numerical errors, symbolic computation is widely used in mathematical research, engineering, and science.
The overarching goal of this grant proposal is the design, analysis and implementation of efficient algorithms for matrices and tensors over a number of important algebraic structures in symbolic computation, such as computing various generalized inverses and normal forms, rank decomposition, simultaneous decomposition and solving matrix equations over various fields and polynomial rings. Their study is motivated by numerous applications in control theory, machine learning, data science, engineering, signal and color image processing, statistics, neural network, etc.
For matrices over some fields, above questions have been explored in the past decades. Recently efficient symbolic algorithms for matrices over quaternion and generalized polynomials have attracted more and more attentions, in particular, these questions for tensors. We plan to employ some symbolic computation techniques such as Groebner bases to investigate these questions. We expect that this will lead to more efficient algorithms for computing generalized inverses and solving matrix (tensor) equations and systems of differential and difference equations. This should provide both theoretical and practical improvements over currently known algorithms.
Finally, the algorithmic advances of this proposal will be implemented in computer algebra software such as Maple and SAGE. The projects all involve extensive training of highly qualified personnel (HQP) for their future positions in academia and industry.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Manitoba, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
RGPIN-2020-06746
Name nom
Zhang, Yang
Department département
Mathematics
Organization id
19
Institution établissement
University of Manitoba
Province en
Manitoba
Province fr
Manitoba
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2020
Competition year année de concours
2020
Award amount
41000
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
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
Installment
inst:1-5
Partie
5
Nb partie
5
Application title
Efficient algorithms for the symbolic computation of matrices
Keyword
NSERC
Application summary
Symbolic computation (also called computer algebra) is a relatively recent research area in computer science and mathematics, which refers to the study and development of algorithms and software for manipulating mathematical expressions and other mathematical objects, in particular, mathematical computations performed symbolically rather than numerically. Because of its lack of numerical errors, symbolic computation is widely used in mathematical research, engineering, and science.
The overarching goal of this grant proposal is the design, analysis and implementation of efficient algorithms for matrices and tensors over a number of important algebraic structures in symbolic computation, such as computing various generalized inverses and normal forms, rank decomposition, simultaneous decomposition and solving matrix equations over various fields and polynomial rings. Their study is motivated by numerous applications in control theory, machine learning, data science, engineering, signal and color image processing, statistics, neural network, etc.
For matrices over some fields, above questions have been explored in the past decades. Recently efficient symbolic algorithms for matrices over quaternion and generalized polynomials have attracted more and more attentions, in particular, these questions for tensors. We plan to employ some symbolic computation techniques such as Groebner bases to investigate these questions. We expect that this will lead to more efficient algorithms for computing generalized inverses and solving matrix (tensor) equations and systems of differential and difference equations. This should provide both theoretical and practical improvements over currently known algorithms.
Finally, the algorithmic advances of this proposal will be implemented in computer algebra software such as Maple and SAGE. The projects all involve extensive training of highly qualified personnel (HQP) for their future positions in academia and industry.