Parallel Preconditioned Solvers for Large Sparse Hermitian Eigenproblems
暂无分享,去创建一个
[1] J. Cullum,et al. Lanczos algorithms for large symmetric eigenvalue computations , 1985 .
[2] N. Kosugi. Modification of the Liu-Davidson method for obtaining one or simultaneously several eigensolutions of a large real-symmetric matrix , 1984 .
[3] H. Martin Bücker,et al. A Parallel Version of the Quasi-Minimal Residual Method, Based on Coupled Two-Term Recurrences , 1996, PARA.
[4] Achim Basermann. QMR and TFQMR Methods for Sparse Nonsymmetric Problems on Massively Parallel Systems , 1996 .
[5] Bernhard Steffen,et al. Preconditioned Solvers for Large Eigenvalue Problems on Massively Parallel Computers and Workstation Clusters , 1997, PARCO.
[6] Bernhard Steffen,et al. New Preconditioned Solvers for Large Sparse Eigenvalue Problems on Massively Parallel Computers , 1997, PPSC.
[7] Gerard L. G. Sleijpen,et al. A Jacobi-Davidson Iteration Method for Linear Eigenvalue Problems , 1996, SIAM J. Matrix Anal. Appl..
[8] R. Freund,et al. QMR: a quasi-minimal residual method for non-Hermitian linear systems , 1991 .
[9] Richard Barrett,et al. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.
[10] Röder,et al. Polarons and bipolarons in strongly interacting electron-phonon systems. , 1996, Physical review. B, Condensed matter.