Solving Eigenvalue Problems by Jacobi-Davidson Related Methods
碩士 === 輔仁大學 === 數學系研究所 === 95 === The Jacobi-Davidson method is a popular technique to compute an eigenpair of large sparse matrices. The idea is using Ritz pair to approximate eigenpair which we desired. They also developed JDQR to compute the deflation of the Jacobi-Davidson method. In 2005, Feng...
Main Authors: | Wen-Chien Yen, 嚴文健 |
---|---|
Other Authors: | Kang C. Jea |
Format: | Others |
Language: | zh-TW |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/96635864740054916478 |
Similar Items
-
MATLAB package of Jacobi-Davidson and Shift-Invert Residual Arnoldi methods for eigenvalue problem computations
by: Chang, Chiung-Wen, et al.
Published: (2017) -
Parallel Computation of Acoustic Eigenvalue Problems Using a Polynomial Jacobi-Davidson Method
by: Sheng-Hong Lai, et al.
Published: (2010) -
Parallel Efficiency of Lanczos/Arnoldi and Jacobi-Davidson Type Methods on Large-scale Standard Eigenvalue Problem
by: Sheng-Yi Wang, et al.
Published: (2012) -
Parallel Jacobi-Davidson Algorithms and Software Developments for Polynomial Eigenvalue Problems in Quantum Dot Simulation
by: Zih-Hao Wei, et al. -
A Parallel Two-level Polynomial Jacobi-Davidson Algorithm for Large Sparse Dissipative Acoustic Eigenvalue Problems
by: Yu-Fen Cheng, et al.
Published: (2012)