Advances in solution of classical generalized eigenvalue problem

Chen, P.; Sun, S.L.; Zhao, Q.C.; Gong, Y.C.; Chen, Y.Q.; Yuan, M.W.

추천

검색

자료유형: 학술저널

저자정보: Chen, P. (LTCS, Department of Mechanics and Aerospace Engineering, College of Engineering, Peking University) Sun, S.L. (LTCS, Department of Mechanics and Aerospace Engineering, College of Engineering, Peking University) Zhao, Q.C. (LTCS, Department of Mechanics and Aerospace Engineering, College of Engineering, Peking University) Gong, Y.C. (LTCS, Department of Mechanics and Aerospace Engineering, College of Engineering, Peking University) Chen, Y.Q. (LTCS, Department of Mechanics and Aerospace Engineering, College of Engineering, Peking University) Yuan, M.W. (LTCS, Department of Mechanics and Aerospace Engineering, College of Engineering, Peking University)

저널정보: 테크노프레스 Interaction and multiscale mechanics Interaction and multiscale mechanics 제1권 제2호

발행연도: 2008.1

수록면: 211 - 230 (20page)

이용수

📌

연구주제

📖

연구배경

🔬

연구방법

🏆

연구결과

초록· 키워드

오류제보하기

Owing to the growing size of the eigenvalue problem and the growing number of eigenvalues desired, solution methods of iterative nature are becoming more popular than ever, which however suffer from low efficiency and lack of proper convergence criteria. In this paper, three efficient iterative eigenvalue algorithms are considered, i.e., subspace iteration method, iterative Ritz vector method and iterative Lanczos method based on the cell sparse fast solver and loop-unrolling. They are examined under the mode error criterion, i.e., the ratio of the out-of-balance nodal forces and the maximum elastic nodal point forces. Averagely speaking, the iterative Ritz vector method is the most efficient one among the three. Based on the mode error convergence criteria, the eigenvalue solvers are shown to be more stable than those based on eigenvalues only. Compared with ANSYS's subspace iteration and block Lanczos approaches, the subspace iteration presented here appears to be more efficient, while the Lanczos approach has roughly equal efficiency. The methods proposed are robust and efficient. Large size tests show that the improvement in terms of CPU time and storage is tremendous. Also reported is an aggressive shifting technique for the subspace iteration method, based on the mode error convergence criteria. A backward technique is introduced when the shift is not located in the right region. The efficiency of such a technique was demonstrated in the numerical tests.

#aggressive shifting #generalized eigenvalue problem #finite element analysis

참고문헌 (0)

참고문헌 신청

참고문헌이 DBpia에서 서비스 중이라면, [참고문헌 신청]을 통해 등록해보세요

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!