Results 91 to 100 of about 1,908 (194)
Developing an Improved Shift-and-Invert Arnoldi Method
, 2010 An algorithm has been developed for finding a number of eigenvalues close to a given shift and in interval [ Lb,Ub ] of a large unsymmetric matrix pair. The algorithm is based on the shift-andinvert Arnoldi with a block matrix method.
Solary, M. Shams, Najafi, H. Saberi
core
Dimension Reduction of Large-Scale Second-Order Dynamical Systems via a Second-Order Arnoldi Method
, 2005 International audienceA structure-preserving dimension reduction algorithm for large-scale second-order dynamical systems is presented. It is a projection method based on a second-order Krylov subspace.
Bai, Zhaojun, Su, Yangfeng
core +1 more source
The shift-and-invert Arnoldi method for singular matrix pencils
CoRRThe numerical solution of singular generalized eigenvalue problems is still challenging. In Hochstenbach, Mehl, and Plestenjak, Solving Singular Generalized Eigenvalue Problems by a Rank-Completing Perturbation, SIMAX 2019, a rank-completing perturbation was proposed and a related bordering of the singular pencil.
Karl Meerbergen, Zhijun Wang
openaire +2 more sources
Randomized Implicitly Restarted Arnoldi method for the non-symmetric eigenvalue problem
In this paper, we introduce a randomized algorithm for solving the non-symmetric eigenvalue problem, referred to as randomized Implicitly Restarted Arnoldi (rIRA).
de Damas, Jean-Guillaume, Grigori, Laura
core +1 more source
The use of refined harmonic shifts in the implicitly restarted refined harmonic Arnoldi method
, 2004 This paper proposes a new shift scheme, called refined harmonic shifts, for use in the implicitly restarted refined harmonic Arnoldi method. Numerical experiments show that the implicitly restarted refined harmonic Arnoldi algorithm with refined harmonic
陈桂芝, Chen, G. Z.
core
Refined Arnoldi Method for Large Symmetric Eigenproblems
, 2010 研究在有限精度下,如何用精化ArnOldI方法求对称矩阵的一组正交程度可达到机器精度的近似特征向量组.首先给出精化rITz向量的一个新的表达式,该表达式表明理论上对不同的近似特征值,一般地无法保证精化ArnOldI方法所确定的精化rITz向量组是正交的.进一步,采用再正交化方法便可得到一组正交化程度可达到机器精度的标准正交近似特征向量组,最后的数值结果验证结论的准确性,同时再正交化后得到新的近似对的残量几乎是不变的.First,we point out that when the refined ...
陈桂芝, 叶莉瑛
core
Accelerating the Arnoldi Iteration -- Theory and Practice
, 1998 The Arnoldi iteration is widely used to compute a few eigenvalues of a large sparse or structured matrix. However, the method may suffer from slow convergence when the desired eigenvalues are not dominant or well separated. A systematic approach is taken
Chao Yang
core
Computing tomographic resolution matrices using Arnoldi`s itertive inversion algorithm [PDF]
, 1994 Resolution matrices are useful in seismic tomography because they allow us to evaluate the information content of reconstructed images. Techniques based on the multiplicity of equivalent exact formulas that may be used to define the resolution matrices ...
Berryman, J.G.
core
A Variant on Harmonic Arnoldi Method
, 2006 讨论求解大规模非对称矩阵内部特征问题的一种方法,与标准的调和A rnold i方法相比,该方法仍用调和R itz值作为特征值的近似,而在近似特征向量选取方面,我们充分利用A rnold i过程所提供的最末一个基向量的信息,在多1维K ry lov子空间中选取一个向量-称之为改进的调和R itz向量-作为所求的特征向量的近似.理论分析和数值试验均表明这种变形的调和A rnold i方法的可行性和有效性.This paper discusses a new method of interior ...
陈桂芝, 梁娟
core
A Simpler Harmonic Arnoldi Method for Computing Interior Eigenvalues of Large Matrices
, 2007 给出了调和Arnoldi算法的一种等价变形.利用求解Krylov子空间和其位移子空间的基之间的巧妙关系式,作者以较少的运算量将原大规模矩阵特征问题转化为一个标准特征问题求解,比原来调和Arnoldi算法求解广义特征问题要简单.简要分析了新方法收敛的充要条件.数值试验表明了新方法比调和Arnoldi算法有效,尤其是当求解子空间维数较小时,新方法的优越性更明显.Based on a simpler Arnoldi process,a simpler harmonic Arnoldi method is ...
牛强, 陈桂芝
core