首页 | 本学科首页   官方微博 | 高级检索  
     检索      

对称三对角矩阵的QL方法论
引用本文:蒋尔雄.对称三对角矩阵的QL方法论[J].上海大学学报(英文版),2004,8(4):369-377.
作者姓名:蒋尔雄
作者单位:DepartmentofMathematics,CollegeofSciences,ShanghaiUniversity,Shanghai200436,P.R.China
基金项目:ProjectsupportedbytheNationalNaturalScienceFoundationofChina (GrantNo .197710 2 0 )
摘    要:QL(QR) method is an efficient method to find eigenvalues of a matrix. Especially we use QL(QR) method to find eigenvalues of a symmetric tridiagonal matrix. In this case it only costs O( n^2) flops, to find all eigenvalues. So it is one of the most efficient method for symmetric tridiagonal matrices. Many experts have researched it. Even the method is mature, it still has many problems need to be researched. We put forward five problems here. They are: (1) Convergence and convergence rate; (2) The convergence of diagonal elements; (3) Shift designed to produce the eigenvalues in monotone order; (4) QL algorithm with multi-shift; (5) Error bound. We intoduce our works on these problems, some of them were published and some are new.

关 键 词:QL算法  对称三对角矩阵  矩阵特征值问题  误差边界
收稿时间:1 December 2003

QL method for symmetric tridiagonal matrices
Jiang?Er-xiong.QL method for symmetric tridiagonal matrices[J].Journal of Shanghai University(English Edition),2004,8(4):369-377.
Authors:Jiang Er-xiong
Institution:Department of Mathematics, College of Sciences, Shanghai University, Shanghai 200436, P. R. China
Abstract:QL(QR) method is an efficient method to find eigenvalues of a matrix. Especially we use QL(QR) method to find eigenvalues of a symmetric tridiagonal matrix. In this case it only costs O(n2) flops, to find all eigenvalues. So it is one of the most efficient method for symmetric tridiagonal matrices. Many experts have researched it. Even the method is mature, it still has many problems need to be researched. We put forward five problems here. They are: (1) Convergence and convergence rate; (2) The convergence of diagonal elements; (3) Shift designed to produce the eigenvalues in monotone order; (4) QL algorithm with multi-shift; (5) Error bound. We intoduce our works on these problems, some of them were published and some are new.
Keywords:matrix eigenvalue problem  symmetric tridiagonal matrix  QL(QR) algorithm  shift  error bound  
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号