The extended global Lanczos method for matrix function approximation

A. H. Bentbib, M. Ghomari, Carl Jagels, K. Jbilou, L. Reichel
{"title":"The extended global Lanczos method for matrix function approximation","authors":"A. H. Bentbib, M. Ghomari, Carl Jagels, K. Jbilou, L. Reichel","doi":"10.1553/ETNA_VOL50S144","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":282695,"journal":{"name":"ETNA - Electronic Transactions on Numerical Analysis","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ETNA - Electronic Transactions on Numerical Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1553/ETNA_VOL50S144","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

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.
矩阵函数逼近的扩展全局Lanczos方法
在包括网络分析在内的各种应用中,需要计算不明确已知的大矩阵的轨迹,例如矩阵exp(a),其中a是一个大的对称矩阵。全局Lanczos方法是一个块方法,可用于计算轨迹的近似值。当块大小为1时,该方法简化为标准的Lanczos方法。已知对于某些矩阵函数和矩阵,使用A的正负次幂子空间的扩展Lanczos方法比只使用A的非负次幂子空间的标准Lanczos方法收敛速度更快。这表明使用扩展的全局Lanczos方法而不是(标准的)全局Lanczos方法可能是有益的。本文描述了一种扩展的全局Lanczos方法,并讨论了相关的Gauss-Laurent积分规则的性质。算例说明了扩展的全局Lanczos方法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信