메뉴 건너뛰기
소속 기관 / 학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
고객센터 ENG
주제분류

피인용 0

검색

    초록·키워드

    The existing algorithms have presumed to apply themselves to matrices having distinct eigenvalues. However, many matrices have multiple eigenvalues and/or eigenvalues spaces so close that it is difficult to distinguish one from another. Two new algorithms for computing multiple and/or clustered eigenvalues are proposed in this paper. These algorithms are applicable to all kinds of Hermitian Toeplitz or real symmetric matrices unlike the existing algorithms. These algorithms are very effective for locating a small number of desired eigenvalues. Characteristics of them are investigated.

    최근 본 자료 전체보기

      UCI(KEPA) : I410-ECN-0101-2009-569-017769321