Recently added

Faculty of Science: Recent submissions

  • Hepting, Daryl H.; Bin Amer, Hadeel Hatim; Yao, Yiyu (2017-10-23)
    The card sorting problem involves the similarity judgments of pairs of photos, taken from a set of photos, by a group of participants. Given the lack of an objective standard for judging similarity, different participants ...
  • Hepting, Daryl (Springer, 2013-10-11)
    In an open card sorting study of 356 facial photographs, each of 25 participants created an unconstrained number of piles. We consider all 63,190 possible pairs of photos: if both photos are in the same pile for a participant, ...
  • Hepting, Daryl; Jaffe, JoAnn; Maciag, Timothy (Springer, 2014-06)
    There is a large gap between attitude and action when it comes to consumer purchases of ethical food. Amongst the various aspects of this gap, this paper focuses on the difficulty in knowing enough about the various ...
  • Fallat, Shaun; Olesky, Dale; van den Driessche, Pauline (Elsevier, 2015-08-15)
    The enhanced principal rank characteristic sequence (epr-sequence) was originally defined for an n ×n real symmetric matrix or an n ×n Hermitian matrix. Such a sequence is defined to be l1l2···ln where lk is A,S, or N ...
  • Meagher, Karen; Fallat, Shaun; Yang, Boting (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 ...
  • Barioli, Francesco; Barrett, Wayne; Fallat, Shaun; Hall, Tracy; Hogben, Leslie; Shader, Bryan; van den Driessche, Pauline; van der Holst, Hein (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 ...
  • Alinaghipour, Fatemeh; Fallat, Shaun; Meagher, Karen (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 ...
  • Barrett, Wayne; Butler, Steve; Catral, Minnie; Fallat, Shaun; Hall, Tracy; Hogben, Leslie; van den Driessche, Pauline; Young, Michael (Elsevier, 2014)
    Given an n-by-n matrix, its principal rank characteristic sequence is a sequence of length n + 1 of 0s and 1s where, for k = 0; 1,..., n, a 1 in the kth position indicates the existence of a principal submatrix of rank ...
  • Butler, Steve; Catral, Minnie; Fallat, Shaun; Hall, Tracy; Hogben, Leslie; van den Driessche, Pauline; Young, michael (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 ...
  • Fallat, Shaun; Nasserasr, Shahla (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 ...
  • Mitchell, Lon; Fallat, Shaun (International Linear Algebra Society, 2013-01)
    The Colin de Verdi`ere parameters mu and nu are defined to be the maximum nullity of certain real symmetric matrices associated with a given graph. In this work, both of these parameters are calculated for all chordal ...
  • Ahmadi, Bahman; Alinaghipour, Fatemeh; Cavers, Michael; Fallat, Shaun; Meagher, Karen; Nasserasr, Shahla (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 ...
  • Barrett, Wayne; Fallat, Shaun; Hall, Tracy; Hogben, Leslie (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 ...
  • Barrett, Wayne; Butler, Steve; Catral, Minnie; Hall, Tracy; Fallat, Shaun; Hogben, Leslie; Young, Michael (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 ...
  • Stavrinides, John; Smith, Derek D. N.; Walterson, Alyssa M. (PLOS ONE, 2014-05-15)
    Fire Blight is a destructive disease of apple and pear caused by the enteric bacterial pathogen, Erwinia amylovora. E. amylovora initiates infection by colonizing the stigmata of apple and pear trees, and entering the ...
  • Fital, Sandra; Guo, Chun-Hua (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 ...
  • Guo, Chun-Hua; Higham, Nicholas J.; Tisseur, Francoise (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 ...
  • Chiang, Chun-Yueh; Chu, Eric King-Wah; Guo, Chun-Hua; Huang, Tsung-Ming; Lin, Wen-Wei; Xu, Shu-Fang (SIAM, 2009)
    In this paper, we review two types of doubling algorithm and some techniques for analyzing them. We then use the techniques to study the doubling algorithm for three different nonlinear matrix equations in the critical ...
  • Guo, Chun-Hua; Higham, Nicholas J.; Tisseur, Francoise (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 + ...
  • Guo, Chun-Hua (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 ...

Search oURspace


Browse

My Account

About