Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

McGill University

$19,000.00

Numerical linear algebra: large sparse matrix computations.

EF 2014-15

Résumé
In order to solve many scientific, engineering, business and other problems using the computer, we often convert the problems to subproblems involving matrices --- rectangular arrays of numbers. Because of this, matrix computations and its theory (often called numerical linear algebra) lies at the heart of most scientific computing. The key to solving many smaller matrix problems is to find some appropriate factorizations of matrices --- so for example a given matrix can be described as the product of two or more such factors. However many problems are large or complicated, and the resulting matrix problems are extremely large --- matrices having millions of rows and millions of columns are not at all unusual. And such large matrices are nearly always very sparse --- the vast majority of elements being zero. Factorization methods can then become far too costly, and iterative methods may be necessary for solving such problems. This research develops numerically reliable and efficient algorithms for iteratively solving such large sparse matrix problems. It carries out analyses of such algorithms to prove their efficiency and reliability, and sensitivity analyses to show what effects changes in the data (for example caused by finite precision computation, or uncertainty in the data) will have on the final results. These analyses lead to greater understanding of individual problems and their computed answers, and improved general purpose and specific area algorithms.The results of the research are useful for most practitioners in scientific computation. Some application areas of particular importance in Canada that use these techniques are the aerospace industry, climate change and weather prediction, power generation and distribution, and resource discovery and extraction.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
9236-2012
Name nom
Paige, Christopher
Department département
Computer Science, School of
Organization id
61
Institution établissement
McGill University
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2012
Award amount
19000
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
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
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
3
Nb partie
5
Application title
Numerical linear algebra: large sparse matrix computations.
Keyword
NSERC
Application summary
In order to solve many scientific, engineering, business and other problems using the computer, we often convert the problems to subproblems involving matrices --- rectangular arrays of numbers. Because of this, matrix computations and its theory (often called numerical linear algebra) lies at the heart of most scientific computing. The key to solving many smaller matrix problems is to find some appropriate factorizations of matrices --- so for example a given matrix can be described as the product of two or more such factors. However many problems are large or complicated, and the resulting matrix problems are extremely large --- matrices having millions of rows and millions of columns are not at all unusual. And such large matrices are nearly always very sparse --- the vast majority of elements being zero. Factorization methods can then become far too costly, and iterative methods may be necessary for solving such problems. This research develops numerically reliable and efficient algorithms for iteratively solving such large sparse matrix problems. It carries out analyses of such algorithms to prove their efficiency and reliability, and sensitivity analyses to show what effects changes in the data (for example caused by finite precision computation, or uncertainty in the data) will have on the final results. These analyses lead to greater understanding of individual problems and their computed answers, and improved general purpose and specific area algorithms.The results of the research are useful for most practitioners in scientific computation. Some application areas of particular importance in Canada that use these techniques are the aerospace industry, climate change and weather prediction, power generation and distribution, and resource discovery and extraction.