Grant: Discovery Grants Program - Individual
University of Lethbridge
$19,000.00
Computing with sparse and structured matrices: mathematical derivatives and beyond
EF 2013-14
Résumé
One of the central themes of my current research is the synergy of combinatorics, graph theory, and numerical linear algebra to explore new and innovative ways of formulating and solving important scientific problems. With the technological advances in high performance computing systems a major challenge confronted by researchers is concerned with the design of effective algorithmic tools and frameworks that exploit the problem structure and the computing system architecture to solve increasingly complex and extremely large scientific problems. Accurate climate modeling code such as ``Community Climate System Model'', for example, belongs to the so called ``petascale simulation'' applications. One of the necessary computational components of such a simulation model is concerned with the efficient calculation of ``sensitivities'' of a large number of output parameters with respect to a small subset of model inputs. Exploiting a priori known information such as sparsity and structure of the underlying problem is crucial for designing effective algorithms for such applications. Additionally, the architectural complexity of modern high performance computing systems pose considerable difficulty in effective software implementation of such innovative algorithms.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Alberta, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
228155-2009
Name nom
Hossain, Shahadat
Department département
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
2013
Competition year année de concours
2009
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
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
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
5
Nb partie
5
Application title
Computing with sparse and structured matrices: mathematical derivatives and beyond
Keyword
NSERC
Application summary
One of the central themes of my current research is the synergy of combinatorics, graph theory, and numerical linear algebra to explore new and innovative ways of formulating and solving important scientific problems. With the technological advances in high performance computing systems a major challenge confronted by researchers is concerned with the design of effective algorithmic tools and frameworks that exploit the problem structure and the computing system architecture to solve increasingly complex and extremely large scientific problems. Accurate climate modeling code such as ``Community Climate System Model'', for example, belongs to the so called ``petascale simulation'' applications. One of the necessary computational components of such a simulation model is concerned with the efficient calculation of ``sensitivities'' of a large number of output parameters with respect to a small subset of model inputs. Exploiting a priori known information such as sparsity and structure of the underlying problem is crucial for designing effective algorithms for such applications. Additionally, the architectural complexity of modern high performance computing systems pose considerable difficulty in effective software implementation of such innovative algorithms.