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

解大型非对称特征问题的精化块不完全正交化算法
引用本文:张勇,廉庆荣.解大型非对称特征问题的精化块不完全正交化算法[J].高等学校计算数学学报,1997,19(3):273-279.
作者姓名:张勇  廉庆荣
作者单位:大连理工大学应用数学系 大连116023
基金项目:国家自然科学基金,辽宁省自然科学基金资助项目
摘    要:0引言 块Arnoldi方法~5]是解大型非对称特征值问题的正交投影方法,然而Jia~3]的分析表

关 键 词:非对称特征值  块不完全正交化  矩阵  特征值

A REFINED INCOMPLETE ORTHOGONALIZATION ALGORITHM FOR LARGE UNSYMMETRIC EIGENPROBLEMS
Zhang Yong,Lian Qingrong.A REFINED INCOMPLETE ORTHOGONALIZATION ALGORITHM FOR LARGE UNSYMMETRIC EIGENPROBLEMS[J].Numerical Mathematics A Journal of Chinese Universities,1997,19(3):273-279.
Authors:Zhang Yong  Lian Qingrong
Institution:Dalian University of Technology
Abstract:In order to reduce the cost of computation and storage of the refined block Arnoldi algorithm proposed by Jia, its truncated version, refined block incomplete orthogonalization algorithm, is presented. A convergence analysis is made for the new algorithm. Some relationships between the approximate eigenpairs of the two algorithms are established. They show that if the basis vectors produced by block incomplete orthogonalization process are strongly linearly independent, the truncated algorithm behaves much like its original one.
Keywords:Characteristic value problems  algorithm  convergenc/refined black Arnoldi algorithm  refined block incomplete orthogonalization algorithm    
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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