首页> 外文会议>International Conference on Computational Science - ICCS 2003 Pt.3 Jun 2-4, 2003 Melbourne, Australia and St. Petersburg, Russia >An Augmented Lanczos Algorithm for the Efficient Computation of a Dot-Product of a Function of a Large Sparse Symmetric Matrix
【24h】

An Augmented Lanczos Algorithm for the Efficient Computation of a Dot-Product of a Function of a Large Sparse Symmetric Matrix

机译:大型稀疏对称矩阵函数的乘积有效计算的增强Lanczos算法

获取原文
获取原文并翻译 | 示例

摘要

The Lanczos algorithm is appreciated in many situations due to its speed and economy of storage. However, the advantage that the Lanczos basis vectors need not be kept is lost when the algorithm is used to compute the action of a matrix function on a vector. Either the basis vectors need to be kept, or the Lanczos process needs to be applied twice. In this study we describe an augmented Lanczos algorithm to compute a dot product relative to a function of a large sparse symmetric matrix, without keeping the basis vectors.
机译:Lanczos算法由于其速度和存储经济性而在许多情况下受到赞赏。但是,当该算法用于计算矩阵函数对矢量的作用时,便失去了不需要保留Lanczos基矢量的优点。要么需要保留基向量,要么需要两次应用Lanczos过程。在这项研究中,我们描述了一种增强的Lanczos算法,以计算相对于大型稀疏对称矩阵的函数的点积,而无需保留基向量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号