Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Lethbridge

$18,000.00

Computing with Sparse and Structured Matrices: Mathematical Derivatives and Beyond

FY 2015-16

Summary
This research is mainly concerned with the design of efficient computational methods for the computation or estimation of mathematical derivatives and related scientific computing problems. Our approach is based on the synergy of combinatorics, graph theory, and numerical linear algebra to solve computational problems where the scale of the problem calls for innovative strategies for algorithm design and their computer implementation. An important component of our research methodology is the identification and exploitation of information such as structure, sparsity, and concurrency. Modelling and solving scientific problems arising in diverse application areas - from computational finance to meteorology to electricity grids, share a common theme: numerical calculations on matrices that are sparse or structured or both. The MIT general circulation model, MITgcm (a numerical model to study Earth's climate), is an example of the so called ""exascale"" application where, even one simulation run of the underlying model requires computational resources of an unprecedented scale. An essential calculation in such a numerical model is concerned with the evaluation of sensitivity of the model with respect to some model parameters that are unknown or poorly known. Excellent research in algorithmic differentiation (AD) techniques in the recent years enabled scientists to ""automate"" sensitivity calculation for MITgcm computer code. Exploiting information such as sparsity and structure of the underlying problem is crucial in designing effective algorithms for such applications. Moreover, the evolving architectural complexity of modern high-performance computing systems pose considerable challenge for effective software implementation of innovative algorithms. In broader terms, the results from this research  are expected to find applications in scientific and engineering calculations that involve solving system of nonlinear equations or optimization (minimization or maximization) of certain quantities. The training component (for graduate/undergraduate training) of this research will contribute  to the pool of highly qualified personnel (HQP) in Canada. All of the trainees supported by the past discovery grants went on (or currently considering) to undertake graduate studies (at M.Sc. or Ph.D. level) or are actively contributing to the Canadian Industry (e.g., Syncrude, Telus, University of Lethbridge).
Program
Discovery Grants Program - Individual
Location
Alberta, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
RGPIN-2015-04130
Name nom
Hossain, Shahadat
Department département
Mathematics and Computer Science - Mathematics and Computer Science
Organization id
12
Institution établissement
University of Lethbridge
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2015
Competition year année de concours
2015
Award amount
18000
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
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2715
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Optimization
Research subject fr
Optimisation
Partie
1
Nb partie
5
Application title
Computing with Sparse and Structured Matrices: Mathematical Derivatives and Beyond
Keyword
NSERC
Application summary
<p>This research is mainly concerned with the design of efficient computational methods for the computation or estimation of mathematical derivatives and related scientific computing problems. Our approach is based on the synergy of combinatorics, graph theory, and numerical linear algebra to solve computational problems where the scale of the problem calls for innovative strategies for algorithm design and their computer implementation. An important component of our research methodology is the identification and exploitation of information such as structure, sparsity, and concurrency. <br /> <br /> Modelling and solving scientific problems arising in diverse application areas - from computational finance to meteorology to electricity grids, share a common theme: numerical calculations on matrices that are sparse or structured or both. The MIT general circulation model, MITgcm (a numerical model to study Earth's climate), is an example of the so called ""exascale"" application where, even one simulation run of the underlying model requires computational resources of an unprecedented scale. An essential calculation in such a numerical model is concerned with the evaluation of sensitivity of the model with respect to some model parameters that are unknown or poorly known. Excellent research in algorithmic differentiation (AD) techniques in the recent years enabled scientists to ""automate"" sensitivity calculation for MITgcm computer code. Exploiting information such as sparsity and structure of the underlying problem is crucial in designing effective algorithms for such applications. Moreover, the evolving architectural complexity of modern high-performance computing systems pose considerable challenge for effective software implementation of innovative algorithms. <br /> <br /> In broader terms, the results from this research  are expected to find applications in scientific and engineering calculations that involve solving system of nonlinear equations or optimization (minimization or maximization) of certain quantities. The training component (for graduate/undergraduate training) of this research will contribute  to the pool of highly qualified personnel (HQP) in Canada. All of the trainees supported by the past discovery grants went on (or currently considering) to undertake graduate studies (at M.Sc. or Ph.D. level) or are actively contributing to the Canadian Industry (e.g., Syncrude, Telus, University of Lethbridge).</p>