Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Victoria

$21,000.00

Spectral analysis of sign/zero-nonzero patterns, positivity of principal minors and primitive diagraphs

EF 2009-10

Résumé
My research primarily concerns combinatorial matrix analysis, in which combinatorial methodology is used to solve and better understand matrix-theoretic problems. The use of combinatorial concepts to gain insight into matrix problems spans many applications, from numerical analysis (sparse matrix theory) to dynamical systems (stability) to economics (sign solvability). Such analysis includes aspects of graph theory, since it is often useful to view a matrix as a combinatorial object, namely a graph or a directed graph. Problems involving sign (or zero-nonzero) pattern matrices occur in applications in, for example, economics, biology and chemistry, in systems where only the signs (or the zero-nonzero structure), rather than exact numeric values, for the entries in a connection matrix are known. More analytical, rather than combinatorial, techniques are required for my research involving M- and inverse M-matrices. Nonsingular M-matrices, which have positive diagonal entries and non-positive off-diagonal entries, occur in a variety of applications including finite difference methods for solving partial differential equations and input-output production and growth models in economics. Primitive directed graphs also occur in many applications, such as Markov processes in statistics and probability. My research is specifically concerned with such digraphs that have a large exponent, which means that the exponent is greater than a value that is approximately one half of the maximum possible exponent of a primitive directed graph. Such primitive directed graphs are of interest because of their restricted graph structure.
Programme
Discovery Grants Program - Individual
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
8214-2008
Name nom
Olesky, Dale
Department département
Computer Science
Organization id
7
Institution établissement
University of Victoria
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2009
Competition year année de concours
2008
Award amount
21000
Program id
RGPIN
Program nane 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
337
Committee name en
Pure & Applied Maths - B
Committee name fr
Maths pures et appliquées - B
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
2908
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Algebra
Research subject fr
algèbre
Partie
2
Nb partie
5
Application title
Spectral analysis of sign/zero-nonzero patterns, positivity of principal minors and primitive diagraphs
Keyword
NA
Application summary
My research primarily concerns combinatorial matrix analysis, in which combinatorial methodology is used to solve and better understand matrix-theoretic problems. The use of combinatorial concepts to gain insight into matrix problems spans many applications, from numerical analysis (sparse matrix theory) to dynamical systems (stability) to economics (sign solvability). Such analysis includes aspects of graph theory, since it is often useful to view a matrix as a combinatorial object, namely a graph or a directed graph. Problems involving sign (or zero-nonzero) pattern matrices occur in applications in, for example, economics, biology and chemistry, in systems where only the signs (or the zero-nonzero structure), rather than exact numeric values, for the entries in a connection matrix are known. More analytical, rather than combinatorial, techniques are required for my research involving M- and inverse M-matrices. Nonsingular M-matrices, which have positive diagonal entries and non-positive off-diagonal entries, occur in a variety of applications including finite difference methods for solving partial differential equations and input-output production and growth models in economics. Primitive directed graphs also occur in many applications, such as Markov processes in statistics and probability. My research is specifically concerned with such digraphs that have a large exponent, which means that the exponent is greater than a value that is approximately one half of the maximum possible exponent of a primitive directed graph. Such primitive directed graphs are of interest because of their restricted graph structure.