We revisit the numerical stability of the two-level orthogonal Arnoldi (TOAR) method for computing an orthonormal basis of a second--order Krylov subspace associated with two given matrices. We show that the computed basis is close (on certain subspace metric sense) to a basis for a second-order Krylov subspace associated with nearby coefficient matrices, provided that the norms of the given matrices are not too large or too small. Thus, the results in this work provide for the first time conditions that guarantee the numerical stability of the TOAR method in computing orthonormal bases of second-order Krylov subspaces. We also study scaling the quadratic problem for improving the numerical stability of the TOAR procedure when the norms of the matrices are too large or too small. We show that in many cases the TOAR procedure applied to scaled matrices is numerically stable when the scaling introduced by Fan, Lin and Van Dooren is used.
A structure preserving shift-invert infinite Arnoldi algorithm for a class of delay eigenvalue problems with Hamiltonian symmetry
在这项工作中,我们考虑一类延迟本征值问题,承认频谱类似的哈密顿矩阵,在这个意义上说,频谱是对称的实轴和虚轴。更确切地说,我们提出了一种方法来迭代近似的特征值,这样的延迟本征值问题最接近一个给定的纯实或虚的移位,同时保持对称性的频谱。为此,所提出的方法利用考虑延迟本征值问题和本征值问题与线性,但无限维运营商之间的等价性。为了计算最接近给定移位的本征值,我们对该线性算子应用专门选择的移位-反转变换,并使用(无限)Arnoldi过程计算具有新移位和反转算子的最大模的本征值。所选择的移位-反转变换的优点在于变换后的算子的谱具有“实斜哈密顿”类结构。进一步证明了利用该算子构造的Krylov空间满足关于特定双线性型的正交性。通过在正交化过程中考虑该性质,确保了即使在存在舍入误差的情况下,简单的、纯虚的本征值是简单的和纯虚的。因此,所提出的工作可以被看作是[V. Mehrmann和D. Watkins,“Structure-Preserving Methods for Computing Eigenpairs of Large Sparse Skew-Hamiltonian/Hamiltonian Pencils”,SIAM J. Sci. Comput.(22.6),2001],应用于所考虑的时滞本征值问题。虽然所提出的方法最初是在函数空间上定义的,但它可以使用有限维线性代数运算来实现。
Arnoldi-Enhanced Multivariate Hermite Interpolation of Manifold-Valued Data
School of Mathematics and Physics, Xi’an Jiaotong-Liverpool University(西交利物浦大学数理学院);Department of Mathematical Sciences, University of Liverpool(利物浦大学数学科学系)