Computational aspects of the geometric mean of two matrices: a survey

IF 0.5 Q3 MATHEMATICS
Dario A. Bini, Bruno Iannazzo
{"title":"Computational aspects of the geometric mean of two matrices: a survey","authors":"Dario A. Bini,&nbsp;Bruno Iannazzo","doi":"10.1007/s44146-024-00155-5","DOIUrl":null,"url":null,"abstract":"<div><p>Algorithms for the computation of the (weighted) geometric mean <i>G</i> of two positive definite matrices are described and discussed. For large and sparse matrices the problem of computing the product <span>\\(y=Gb\\)</span>, and of solving the linear system <span>\\(Gx=b\\)</span>, without forming <i>G</i>, is addressed. An analysis of the conditioning is provided. Substantial numerical experimentation is carried out to test and compare the performances of these algorithms in terms of CPU time, numerical stability, and number of iterative steps.</p></div>","PeriodicalId":46939,"journal":{"name":"ACTA SCIENTIARUM MATHEMATICARUM","volume":"90 3-4","pages":"349 - 389"},"PeriodicalIF":0.5000,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s44146-024-00155-5.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACTA SCIENTIARUM MATHEMATICARUM","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1007/s44146-024-00155-5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Algorithms for the computation of the (weighted) geometric mean G of two positive definite matrices are described and discussed. For large and sparse matrices the problem of computing the product \(y=Gb\), and of solving the linear system \(Gx=b\), without forming G, is addressed. An analysis of the conditioning is provided. Substantial numerical experimentation is carried out to test and compare the performances of these algorithms in terms of CPU time, numerical stability, and number of iterative steps.

求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.00
自引率
0.00%
发文量
39
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信