期刊
ELECTRONIC TRANSACTIONS ON NUMERICAL ANALYSIS
卷 50, 期 -, 页码 144-163出版社
KENT STATE UNIVERSITY
DOI: 10.1553/etna_vol50s144
关键词
extended Krylov subspace; extended moment matching; Laurent polynomial; global Lanczos method; matrix function; Gauss quadrature rule
资金
- NSF [DMS-1729509, DMS-1720259]
The need to compute the trace of a large matrix that is not explicitly known, such as the matrix exp(A), where A is a large symmetric matrix, arises in various applications including in network analysis. The global Lanczos method is a block method that can be applied to compute an approximation of the trace. When the block size is one, this method simplifies to the standard Lanczos method. It is known that for some matrix functions and matrices, the extended Lanczos method, which uses subspaces with both positive and negative powers of A, can give faster convergence than the standard Lanczos method, which uses subspaces with nonnegative powers of A only. This suggests that it may be beneficial to use an extended global Lanczos method instead of the (standard) global Lanczos method. This paper describes an extended global Lanczos method and discusses properties of the associated Gauss-Laurent quadrature rules. Computed examples that illustrate the performance of the extended global Lanczos method are presented.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据