.png){kind=icon}
Return
Glued matrices and the MRRR algorithm
.png){kind=icon}
OA
AI
DOI：10.1137/040620746.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
During the last ten years, Dhillon and Parlett devised a new algorithm ( multiple relatively robust representations ( MRRR)) for computing numerically orthogonal eigenvectors of a symmetric tridiagonal matrix T with O(n(2)) cost. It has been incorporated into LAPACK version 3.0 as routine STEGR. We have discovered that the MRRR algorithm can fail in extreme cases. Sometimes eigenvalues agree to working accuracy and MRRR cannot compute orthogonal eigenvectors for them. In this paper, we describe and analyze these failures and various remedies.
Keywords:
multiple relatively robust representations
numerically orthogonal eigenvectors
symmetric tridiagonal matrix
tight clusters of eigenvalues
glued matrices
Wilkinson matrices
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveRelaxivities of hydrogen protons in aqueous solutions of gold-coated manganese ferrite nanoparticles
PREAI
ShareSaveTemperature dependence of the dielectric function and the interband critical-point parameters of GaP
PREAI
ShareSaveShareSave
View more