.png){kind=icon}
返回
Glued matrices and the MRRR algorithm
.png){kind=icon}
OA
AI
DOI：10.1137/040620746.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
multiple relatively robust representations
numerically orthogonal eigenvectors
symmetric tridiagonal matrix
tight clusters of eigenvalues
glued matrices
Wilkinson matrices
期刊
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
分享收藏
查看更多内容