logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Glued matrices and the MRRR algorithm

delete2005-01-01
delete20
delete
OA
AI
I
Inderjit S. Dhillon
B
Beresford Ν. Parlett
C
Christof Vömel
DOI：10.1137/040620746delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

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

SIAM Journal on Scientific Computing cover
SIAM Journal on Scientific Computing
IF:
2.6
Papers:
5.1K
Citations:
1.8W

Organization

No organization information available