.png){kind=icon}
返回
A FRAMEWORK FOR THE MR3 ALGORITHM: THEORY AND IMPLEMENTATION
.png){kind=icon}
PRE
AI
DOI：10.1137/110834020.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper provides a streamlined and modular presentation of the MR3 algorithm for computing selected eigenpairs of symmetric tridiagonal matrices, thus disentangling the principles driving MR3 and the (recursive) core algorithm from the specific (e. g., twisted) decompositions used to represent the matrices at different recursion depths and from the (dqds) transformations converting between them. Our approach allows a modular full proof for the correctness of the MR3 algorithm. This proof is based on five requirements concerning the interplay between the core algorithm and its subcomponents. These requirements can also guide in implementing the algorithm, because they expose quantities that can and should be monitored at runtime. Our new implementation XMR, which is based on the above analysis, is described and compared to xSTEMR from LAPACK 3.2.2. Numerical experiments comparing the robustness and performance of both implementations are given.
Keyword:
symmetric tridiagonal matrix
eigensystem
MRRR algorithm
theory and implementation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Relaxivities of hydrogen protons in aqueous solutions of gold-coated manganese ferrite nanoparticles
PREAI
分享收藏
Temperature dependence of the dielectric function and the interband critical-point parameters of GaP
PREAI
分享收藏
查看更多内容