A Communication-Avoiding Thick-Restart Lanczos Method on a Distributed-Memory System
暂无分享,去创建一个
[1] Kesheng Wu,et al. Adaptive Projection Subspace Dimension for the Thick-Restart Lanczos Method , 2010, ACM Trans. Math. Softw..
[2] Kesheng Wu,et al. Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems , 2000, SIAM J. Matrix Anal. Appl..
[3] Kesheng Wu,et al. A Block Orthogonalization Procedure with Constant Synchronization Requirements , 2000, SIAM J. Sci. Comput..
[4] James Demmel,et al. Avoiding communication in sparse matrix computations , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.
[5] C. Lanczos. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .
[6] Katherine Yelick,et al. OSKI: A library of automatically tuned sparse matrix kernels , 2005 .
[7] D. Sorensen. Numerical methods for large eigenvalue problems , 2002, Acta Numerica.
[8] B. Parlett. The Symmetric Eigenvalue Problem , 1981 .
[9] James Demmel,et al. Communication-optimal Parallel and Sequential QR and LU Factorizations , 2008, SIAM J. Sci. Comput..
[10] Mark Hoemmen,et al. Communication-avoiding Krylov subspace methods , 2010 .
[11] L. Reichel,et al. A Newton basis GMRES implementation , 1994 .