# Browsing Department of Mathematics & Statistics by Title

Sort by: Order: Results:

• (Department of Mathematics and Statistics, University of Regina, 2004)
• (SIAM, 2009)
Hyperbolic quadratic matrix polynomials $Q(\lambda) = \lambda^2 A + \lambda B + C$ are an important class of Hermitian matrix polynomials with real eigenvalues, among which the overdamped quadratics are those with ...
• (Elsevier, 2015)
The enhanced principal rank characteristic sequence (epr-sequence) of a symmetric n ×n matrix is a sequence from A,S, or N according as all, some, or none of its principal minors of order k are nonzero. Such sequences give ...
• (SIAM, 2009)
A 25-year old and somewhat neglected algorithm of Crawford and Moon attempts to determine whether a given Hermitian matrix pair $(A,B)$ is definite by exploring the range of the function $f(x) = x^*(A + iB)x/|x^*(A + ... • (2014-01-21) • (Taylor & Francis, 2013) We start with a discussion of coupled algebraic Riccati equations arising in the study of linear-quadratic optimal control problem for Markov jump linear systems. Under suitable assumptions, this system of equations has ... • (SIAM, 2010) The matrix equation$X+A^TX^{-1}A=Q$has been studied extensively when$A$and$Q$are real square matrices and$Q$is symmetric positive definite. The equation has positive definite solutions under suitable conditions, ... • (International Linear Algebra Society, 2014-06) Barrett et al. asked in [W. Barrett et al. Minimum rank of edge subdivisions of graphs. Electronic Journal of Linear Algebra, 18:530–563, 2009.], whether the maximum nullity is equal to the zero forcing number for all ... • (International Linear Algebra Society, 2013-09) The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph G, is denoted by q(G). Using other parameters related to G, bounds for q(G) are proven and then applied to ... • (Springer, 2013) For the algebraic Riccati equation whose four coefficient matrices form a nonsingular$M$-matrix or an irreducible singular$M$-matrix$K$, the minimal nonnegative solution can be found by Newton's method and the doubling ... • (Public Knowledge Network, 2013) We establish the bounds 4 on the Nordhaus- Gaddum sum upper bound multipliers for all graphs G, in connections with certain Colin de Verdi ere type graph parameters. The Nordhaus-Gaddum sum lower bound is conjectured ... • (Elsevier, 2008) The fixed-point iteration is a simple method for finding the maximal Hermitian positive definite solutions of the matrix equations$X\pm A^*X^{-1}A=I$(the plus/minus equations). The convergence of this method ... • (Elsevier, 2012) The Green's function approach for treating quantum transport in nano devices requires the solution of nonlinear matrix equations of the form$X+(C^*+{\rm i} \eta D^*)X^{-1}(C+{\rm i} \eta D)=R+{\rm i}\eta P$, where$R$... • (Elsevier, 2013) We consider the algebraic Riccati equation for which the four coefficient matrices form an$M$-matrix$K$. When$K$is a nonsingular$M$-matrix or an irreducible singular$M$-matrix, the Riccati equation is known to have ... • (SIAM, 2012) The matrix equation$X+A^{T}X^{-1}A=Q$arises in Green's function calculations in nano research, where$A$is a real square matrix and$Q$is a real symmetric matrix dependent on a parameter and is usually indefinite. ... • (Elsevier, 2010) If$A$is a matrix with no negative real eigenvalues and all zero eigenvalues of$A$are semisimple, the principal$p$th root of$A\$ can be computed by Newton's method or Halley's method, with a preprocessing procedure ...
• (Elsevier, 2015)
The positive semidefinite zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring and is related to a more conventional version of zero forcing. We establish a relation ...
• (The Charles Babbage Research Centre, 2013-02)
In this work, we study the structure of the null spaces of matrices associated with graphs. Our primary tool is utilizing Schur complements based on certain collections of independent vertices. This idea is applied in ...
• (2014)
The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced ...
• (Wiley Periodicals, Inc., 2013)
Tree-width, and variants that restrict the allowable tree decompositions, play an important role in the study of graph algorithms and have application to computer science. The zero forcing number is used to study the ...