期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Bounds for Polynomial’s Roots from Fiedler and Sparse Companion Matrices for Submultiplicative Matrix Norms 被引量:1
1
作者 Mamoudou Amadou Bondabou Ousmane Moussa Tessa Amidou Morou 《Advances in Linear Algebra & Matrix Theory》 2021年第1期1-13,共13页
We use submultiplicative companion matrix norms to provide new bounds for roots for a given polynomial <i>P</i>(<i>X</i>) over the field C[<i>X</i>]. From a <i>n</i>... We use submultiplicative companion matrix norms to provide new bounds for roots for a given polynomial <i>P</i>(<i>X</i>) over the field C[<i>X</i>]. From a <i>n</i>×<i>n</i> Fiedler companion matrix <i>C</i>, sparse companion matrices and triangular Hessenberg matrices are introduced. Then, we identify a special triangular Hessenberg matrix <i>L<sub>r</sub></i>, supposed to provide a good estimation of the roots. By application of Gershgorin’s theorems to this special matrix in case of submultiplicative matrix norms, some estimations of bounds for roots are made. The obtained bounds have been compared to known ones from the literature precisely Cauchy’s bounds, Montel’s bounds and Carmichel-Mason’s bounds. According to the starting formel of <i>L<sub>r</sub></i>, we see that the more we have coefficients closed to zero with a norm less than 1, the more the Sparse method is useful. 展开更多
关键词 Fiedler matrices Polynomial’s Roots Bounds for Polynomials Companion matrices Sparse Companion matrices hessenberg matrices Submultiplicative Matrix Norm
下载PDF
含2个参数的Fibonacci—Hessenberg矩阵的构造
2
作者 曾莹 《韶关学院学报》 2007年第9期12-16,共5页
Fibonacci-Hessenberg 矩阵的构造是序列理论和矩阵论共同关心的问题.构造出一系列的含两个参数的 Fi-bonacci-Hessenberg 矩阵,推广了有关文献的结果.
关键词 Hbonaeei序列 hessenberg矩阵 Fibonacci-hessenberg矩阵 行列式
下载PDF
Bounds for Polynomial’s Roots from Hessenberg Matrices and Gershgorin’s Disks
3
作者 Mamoudou Amadou Bondabou Ousmane Moussa Tessa Maimouna Salou 《Advances in Pure Mathematics》 2021年第12期963-977,共15页
The goal of this study is to propose a method of estimation of bounds for roots of polynomials with complex coefficients. A well-known and easy tool to obtain such information is to use the standard Gershgorin’s theo... The goal of this study is to propose a method of estimation of bounds for roots of polynomials with complex coefficients. A well-known and easy tool to obtain such information is to use the standard Gershgorin’s theorem, however, it doesn’t take into account the structure of the matrix. The modified disks of Gershgorin give the opportunity through some geometrical figures called Ovals of Cassini, to consider the form of the matrix in order to determine appropriated bounds for roots. Furthermore, we have seen that, the Hessenbeg matrices are indicated to estimate good bounds for roots of polynomials as far as we become improved bounds for high values of polynomial’s coefficients. But the bounds are better for small values. The aim of the work was to take advantages of this, after introducing the Dehmer’s bound, to find an appropriated property of the Hessenberg form. To illustrate our results, illustrative examples are given to compare the obtained bounds to those obtained through classical methods like Cauchy’s bounds, Montel’s bounds and Carmichel-Mason’s bounds. 展开更多
关键词 Bounds for Roots of Polynomials Gershgorin Frobenius Companion Matrix hessenberg matrices Ovals of Cassini
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部