Pentadiagonal Companion Matrices

被引:5
|
作者
Eastman, Brydon [1 ]
Vander Meulen, Kevin N. [1 ]
机构
[1] Redeemer Univ Coll, Dept Math, 777 Garner Rd E, Ancaster, ON L9K 1J4, Canada
来源
SPECIAL MATRICES | 2016年 / 4卷 / 01期
基金
加拿大自然科学与工程研究理事会;
关键词
companion matrices; pentadiagonal matrices; Fiedler companion matrices; Hessenberg matrices; algorithms; zeros of polynomials;
D O I
10.1515/spma-2016-0003
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The class of sparse companion matrices was recently characterized in terms of unit Hessenberg matrices. We determine which sparse companion matrices have the lowest bandwidth, that is, we characterize which sparse companion matrices are permutationally similar to a pentadiagonal matrix and describe how to find the permutation involved. In the process, we determine which of the Fiedler companion matrices are permutationally similar to a pentadiagonal matrix. We also describe how to find a Fiedler factorization, up to transpose, given only its corner entries.
引用
收藏
页码:13 / 30
页数:18
相关论文
共 50 条