.png){kind=icon}
Return
A FRAMEWORK FOR THE MR3 ALGORITHM: THEORY AND IMPLEMENTATION
.png){kind=icon}
PRE
AI
DOI：10.1137/110834020.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
symmetric tridiagonal matrix
eigensystem
MRRR algorithm
theory and implementation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveRelaxivities of hydrogen protons in aqueous solutions of gold-coated manganese ferrite nanoparticles
PREAI
ShareSave
Temperature dependence of the dielectric function and the interband critical-point parameters of GaP
PREAI
ShareSaveShareSave
View more