Krylov subspace approximation of eigenpairs and matrix functions in exact and computer arithmetic
Krylov subspace approximation of eigenpairs and matrix functions in exact and computer arithmetic
复制标题
DOI:
10.1002/nla.1680020303
复制
发表时间:
1995-05
期刊:
影响因子:
--
通讯作者:
V. Druskin;L. Knizhnerman
中科院分区:
文献类型:
--
作者:
V. Druskin;L. Knizhnerman
Many researchers are now working on computing the product of a matrix function and a vector,using approximations in a Krylov subspace. We review our results on the analysis of one implemen-tation of that approach for symmetric matrices, which we call the Spectral Lanczos DecompositionMethod (SLDM).We have proved a general convergence estimate, relating SLDM error bounds to those obtainedthrough approximation of the matrix function by a part of its Chebyshev series. Thus, we arrivedat e ective estimates for matrix functions arising when solving parabolic, hyperbolic and ellipticpartial di erential equations. We concentrate on the parabolic case, where we obtain estimatesthat indicate superconvergence of SLDM. For this case a combination of SLDM and splittingmethods is also considered and some numerical results are presented.We implement our general estimates to obtain convergence bounds of Lanczos approximationsto eigenvalues in the internal part of the spectrum. Unlike Kaniel-Saad estimates, our estimatesare independent of the set of eigenvalues between the required one and the nearest spectrumbound.We consider an extension of our general estimate to the case of the simple Lanczos method(without reorthogonalization) in nite computer arithmetic which shows that for a moderatedimension of the Krylov subspace the results, proved for the exact arithmetic, are stable up toroundo .