An efficient, block-by-block algorithm for inverting a block tridiagonal, nearly block Toeplitz matrix

M. Reuter, Judith C. Hill
{"title":"An efficient, block-by-block algorithm for inverting a block tridiagonal, nearly block Toeplitz matrix","authors":"M. Reuter, Judith C. Hill","doi":"10.1088/1749-4699/5/1/014009","DOIUrl":null,"url":null,"abstract":"We present an algorithm for computing any block of the inverse of a block tridiagonal, nearly block Toeplitz matrix (defined as a block tridiagonal matrix with a small number of deviations from the purely block Toeplitz structure). By exploiting both the block tridiagonal and the nearly block Toeplitz structures, this method scales independently of the total number of blocks in the matrix and linearly with the number of deviations. Numerical studies demonstrate this scaling and the advantages of our method over alternatives.","PeriodicalId":89345,"journal":{"name":"Computational science & discovery","volume":"5 1","pages":"014009"},"PeriodicalIF":0.0000,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1088/1749-4699/5/1/014009","citationCount":"29","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational science & discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1088/1749-4699/5/1/014009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 29

Abstract

We present an algorithm for computing any block of the inverse of a block tridiagonal, nearly block Toeplitz matrix (defined as a block tridiagonal matrix with a small number of deviations from the purely block Toeplitz structure). By exploiting both the block tridiagonal and the nearly block Toeplitz structures, this method scales independently of the total number of blocks in the matrix and linearly with the number of deviations. Numerical studies demonstrate this scaling and the advantages of our method over alternatives.
一个有效的,逐块算法反演一个块三对角,近块Toeplitz矩阵
我们提出了一种算法,用于计算块三对角矩阵逆的任何块,近块Toeplitz矩阵(定义为与纯块Toeplitz结构有少量偏差的块三对角矩阵)。通过利用块三对角线和近块Toeplitz结构,该方法独立于矩阵中块的总数进行缩放,并与偏差的数量呈线性关系。数值研究证明了这种缩放和我们的方法优于其他方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信