Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Thomas R. Cameron"'
Publikováno v:
Linear Algebra and its Applications. 664:126-146
In this article, we extend the notion of the Laplacian spread to simple directed graphs (digraphs) using the restricted numerical range. First, we provide Laplacian spread values for several families of digraphs. Then, we prove sharp upper bounds on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e66875273a842b5f3267ed981fb751b2
https://doi.org/10.1016/j.laa.2023.01.016
https://doi.org/10.1016/j.laa.2023.01.016
Autor:
Thomas R. Cameron, Stef Graillat
Publikováno v:
ETNA - Electronic Transactions on Numerical Analysis. 55:401-423
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b76d13052c6627041bcdde2f81436b4a
https://doi.org/10.1553/etna_vol55s401
https://doi.org/10.1553/etna_vol55s401
Publikováno v:
Linear and Multilinear Algebra. 69:840-854
In this article, we present the restricted numerical for the Laplacian matrix of a directed graph (digraph). We motivate our interest in the restricted numerical range by its close connection to th...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7be3e69ca6d72e02a34b9dc4947695bd
https://doi.org/10.1080/03081087.2020.1748853
https://doi.org/10.1080/03081087.2020.1748853
Publikováno v:
Linear Algebra and its Applications. 588:81-100
Recently, Anderson et al. (2019) proposed the concept of rankability, which refers to a dataset's inherent ability to produce a meaningful ranking of its items. In the same paper, they proposed a rankability measure that is based on an integer progra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff0610d713c03eecc90cfaa66ad5ed6d
https://doi.org/10.1016/j.laa.2019.11.026
https://doi.org/10.1016/j.laa.2019.11.026
Publikováno v:
Linear Algebra and its Applications. 585:105-126
We present a generalization of Householder sets for matrix polynomials. After defining these sets, we analyze their topological and algebraic properties, which include containing all of the eigenvalues of a given matrix polynomial. Then, we use insta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3ec17b4154cae6ee545c63462ef0099
https://doi.org/10.1016/j.laa.2019.09.037
https://doi.org/10.1016/j.laa.2019.09.037
Autor:
Aida Abiad, Boris Brimkov, Jane Breen, Thomas R. Cameron, Himanshu Gupta, Ralihe R. Villagran
Publikováno v:
University of Wyoming Open Journals
Electronic Journal of Linear Algebra, 38, 280-294. International Linear Algebra Society
Electronic Journal of Linear Algebra, 38, 280-294. International Linear Algebra Society
Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph. In this paper, we show that several NP-hard zero forcing numbers are not characterized by the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e10ffa118deb9462fc1d575cd6c149f6
http://arxiv.org/abs/2111.12343
http://arxiv.org/abs/2111.12343
Autor:
Thomas R. Cameron
Publikováno v:
The American Mathematical Monthly. 126:437-447
We present a novel perspective on developing the determinant through the lens of signed volume. Starting with a unique and rigorous development of both the volume and orientation of a paral...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0dfa43f5f6fd7ac1df34811d7884bf4
https://doi.org/10.1080/00029890.2019.1577669
https://doi.org/10.1080/00029890.2019.1577669
Publikováno v:
Operators and Matrices. :643-652
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41f3b6cd67fdbfd42eaf02f849469f98
https://doi.org/10.7153/oam-2019-13-48
https://doi.org/10.7153/oam-2019-13-48
Autor:
Thomas R. Cameron
Publikováno v:
Numerical Algorithms. 82:1065-1084
Two common strategies for computing all roots of a polynomial with Laguerre’s method are explicit deflation and Maehly’s procedure. The former is only a semi-stable process and is not suitable for solving large degree polynomial equations. In con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e4f545eb8eafd67eb062eeb348307d92
https://doi.org/10.1007/s11075-018-0641-9
https://doi.org/10.1007/s11075-018-0641-9
In 2020, Cameron et al. introduced the restricted numerical range of a digraph (directed graph) as a tool for characterizing digraphs and studying their algebraic connectivity. In particular, digraphs with a restricted numerical range of a single poi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::766928bf79e5e53fbdcf63e392817ca1