A Fast QR Algorithm for Companion Matrices

Author(s):  
Shiv Chandrasekaran ◽  
Ming Gu ◽  
Jianlin Xia ◽  
Jiang Zhu
2010 ◽  
Vol 116 (2) ◽  
pp. 177-212 ◽  
Author(s):  
Marc Van Barel ◽  
Raf Vandebril ◽  
Paul Van Dooren ◽  
Katrijn Frederix

2019 ◽  
Vol 7 (1) ◽  
pp. 230-245
Author(s):  
Macarena Collao ◽  
Mario Salas ◽  
Ricardo L. Soto

Abstract The nonnegative inverse eigenvalue problem (NIEP) is the problem of finding conditions for the existence of an n × n entrywise nonnegative matrix A with prescribed spectrum Λ = {λ1, . . ., λn}. If the problem has a solution, we say that Λ is realizable and that A is a realizing matrix. In this paper we consider the NIEP for a Toeplitz realizing matrix A, and as far as we know, this is the first work which addresses the Toeplitz nonnegative realization of spectra. We show that nonnegative companion matrices are similar to nonnegative Toeplitz ones. We note that, as a consequence, a realizable list Λ= {λ1, . . ., λn} of complex numbers in the left-half plane, that is, with Re λi≤ 0, i = 2, . . ., n, is in particular realizable by a Toeplitz matrix. Moreover, we show how to construct symmetric nonnegative block Toeplitz matrices with prescribed spectrum and we explore the universal realizability of lists, which are realizable by this kind of matrices. We also propose a Matlab Toeplitz routine to compute a Toeplitz solution matrix.


2018 ◽  
Vol 539 ◽  
pp. 94-116
Author(s):  
Kevin N. Vander Meulen ◽  
Trevor Vanderwoerd

1998 ◽  
Vol 271 (1-3) ◽  
pp. 257-272 ◽  
Author(s):  
G.M.L. Gladwell

1986 ◽  
Vol 7 (1) ◽  
pp. 212-229 ◽  
Author(s):  
Ralph Byers
Keyword(s):  

1981 ◽  
Vol 37 ◽  
pp. 55-75 ◽  
Author(s):  
Krzysztof Gałlkowski
Keyword(s):  

2002 ◽  
Vol 23 (4) ◽  
pp. 929-947 ◽  
Author(s):  
Karen Braman ◽  
Ralph Byers ◽  
Roy Mathias
Keyword(s):  

1981 ◽  
Vol 10 (1) ◽  
pp. 45-51
Author(s):  
John de Pillis ◽  
Michael Neumann

Sign in / Sign up

Export Citation Format

Share Document