Grant: Collaborative Research and Development Grants
Simon Fraser University
$80,000.00
Parallel algorithms, data structures and libraries for polynomials
EF 2013-14
Résumé
Maple is a computer software system for doing exact and approximate computations in mathematics. Unlike most mathematical and statistical software, Maple can compute and manipulate mathematical formulas, that is, it can do algebra with formulas as well as compute with numbers. Maple was originally developed at the University of Waterloo and is now being developed and sold by Maplesoft, an Ontario based company. Maple is used by mathematicians, scientists and engineers for teaching, research and development. Maple's main commercial competitors are Mathematica (and Wolfram alpha) and MATLAB, both US based companies.This research and development proposal is to improve and extend Maple's facilities for computing with polynomials, including polynomials in more than one variable and polynomials with different kinds of coefficients. One of the main challenges Maple faces is how it can be engineered to take advantage of multi-core computers. Since almost all existing Maple code is written for a sequential computer, Maple will not automatically get faster as our computers get mores cores.We propose to design and implement new algorithms for polynomials that are faster and can be parallelized for multi-core computers. In order to do this we may need to change the data structures for polynomials that are currently used. Specific computational problems considered include polynomial greatest common divisors, factoring polynomials and computing Groebner bases for polynomial systems. Since polynomials are central to many computations with formulas, this work should improve many other facilities in Maple as well. If we can make Maple the fastest system for polynomial computations, this will give Maple a huge advantage over its competitors.
Programme
Collaborative Research and Development Grants
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
437389-2012
Name nom
Monagan, Michael
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
2013
Competition year année de concours
2012
Award amount
80000
Program id
CRDPJ
Program name en
Collaborative Research and Development Grants
Program name fr
Subventions de recherche et développement coopérative
Group en
Research partnerships programs
Group fr
Programmes de partenariat
Committee code
96
Committee name en
RPP Internal Decision Cttee
Committee name fr
Cté de décision interne - PPR
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
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
2
Nb partie
3
Application title
Parallel algorithms, data structures and libraries for polynomials
Keyword
NSERC
Application summary
Maple is a computer software system for doing exact and approximate computations in mathematics. Unlike most mathematical and statistical software, Maple can compute and manipulate mathematical formulas, that is, it can do algebra with formulas as well as compute with numbers. Maple was originally developed at the University of Waterloo and is now being developed and sold by Maplesoft, an Ontario based company. Maple is used by mathematicians, scientists and engineers for teaching, research and development. Maple's main commercial competitors are Mathematica (and Wolfram alpha) and MATLAB, both US based companies.This research and development proposal is to improve and extend Maple's facilities for computing with polynomials, including polynomials in more than one variable and polynomials with different kinds of coefficients. One of the main challenges Maple faces is how it can be engineered to take advantage of multi-core computers. Since almost all existing Maple code is written for a sequential computer, Maple will not automatically get faster as our computers get mores cores.We propose to design and implement new algorithms for polynomials that are faster and can be parallelized for multi-core computers. In order to do this we may need to change the data structures for polynomials that are currently used. Specific computational problems considered include polynomial greatest common divisors, factoring polynomials and computing Groebner bases for polynomial systems. Since polynomials are central to many computations with formulas, this work should improve many other facilities in Maple as well. If we can make Maple the fastest system for polynomial computations, this will give Maple a huge advantage over its competitors.