首页> 外文期刊>Advances in Linear Algebra & Matrix Theory >Bounds for Polynomial’s Roots from Fiedler and Sparse Companion Matrices for Submultiplicative Matrix Norms
【24h】

Bounds for Polynomial’s Roots from Fiedler and Sparse Companion Matrices for Submultiplicative Matrix Norms

机译:来自Fiedler和稀疏伴侣矩阵的多项式根系的界限,用于倍增矩阵规范

获取原文
           

摘要

We use submultiplicative companion matrix norms to provide new bounds for roots for a given polynomial P (X ) over the field C[X ]. From a n ×n Fiedler companion matrix C , sparse companion matrices and triangular Hessenberg matrices are introduced. Then, we identify a special triangular Hessenberg matrix L_(r) , 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 L_(r) , we see that the more we have coefficients closed to zero with a norm less than 1, the more the Sparse method is useful.
机译:我们使用倍增性伴侣矩阵规范来为特定的多项式 p( x)上的根源提供新的界限C [ x]。从A n× n Fiedler伴侣矩阵 C,介绍了稀疏伴侣矩阵和三角Hessenberg矩阵。然后,我们识别特殊的三角形Hessenberg矩阵 l_(r),应该提供良好的根源估计。通过在倍增率矩阵规范的情况下,将Gershgorin的定理应用于这种特殊矩阵,制造了一些界限的一些估计。将获得的界限与文学中已知的界限进行了比较,精确的Cauchy的界限,蒙特尔的界限和卡米歇尔梅森的界限。根据 l_(r)的起始窗格,我们看到的是,我们的系数越多为零,常量少于1,稀疏方法越多。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号