s-Step Krylov Subspace Methods as Bottom Solvers for Geometric Multigrid
暂无分享,去创建一个
Samuel Williams | James Demmel | Brian van Straalen | Ann S. Almgren | Nicholas Knight | Erin C. Carson | Michael Lijewski
[1] Mark Hoemmen,et al. Communication-avoiding Krylov subspace methods , 2010 .
[2] H. Walker. Implementation of the GMRES method using householder transformations , 1988 .
[3] Wim Vanroose,et al. Improving the arithmetic intensity of multigrid with the help of polynomial smoothers , 2012, Numer. Linear Algebra Appl..
[4] D. Hut. A Newton Basis Gmres Implementation , 1991 .
[5] W. Joubert,et al. Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory , 1992 .
[6] John Van Rosendale. Minimizing Inner Product Data Dependencies in Conjugate Gradient Iteration , 1983, ICPP.
[7] Jean M. Sexton,et al. Nyx: A MASSIVELY PARALLEL AMR CODE FOR COMPUTATIONAL COSMOLOGY , 2013, J. Open Source Softw..
[8] Laurence T. Yang. Solving sparse least squares problems on massively distributed memory computers , 1997, Proceedings. Advances in Parallel and Distributed Computing.
[9] H. V. D. Vorst,et al. Reducing the effect of global communication in GMRES( m ) and CG on parallel distributed memory computers , 1995 .
[10] J. Demmel,et al. Avoiding Communication in Computing Krylov Subspaces , 2007 .
[11] Wim Vanroose,et al. Hiding global synchronization latency in the preconditioned Conjugate Gradient algorithm , 2014, Parallel Comput..
[12] Andrés Tomás,et al. Parallel Arnoldi eigensolvers with enhanced scalability via global communications rearrangement , 2007, Parallel Comput..
[13] Samuel Williams,et al. Optimization of geometric multigrid for emerging multi- and manycore processors , 2012, 2012 International Conference for High Performance Computing, Networking, Storage and Analysis.
[14] Vicente Hernández,et al. SLEPc: A scalable and flexible toolkit for the solution of eigenvalue problems , 2005, TOMS.
[15] Wim Vanroose,et al. Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines , 2013, SIAM J. Sci. Comput..
[16] Lothar Reichel,et al. On the generation of Krylov subspace bases , 2012 .
[17] Sivan Toledo,et al. Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers , 1997, J. Comput. Syst. Sci..
[18] James Demmel,et al. Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods , 2013, SIAM J. Sci. Comput..
[19] Wim Vanroose,et al. The Impact of Global Communication Latency at Extreme Scales on Krylov Methods , 2012, ICA3PP.
[20] Jocelyne Erhel,et al. A parallel GMRES version for general sparse matrices. , 1995 .
[21] Yousef Saad,et al. Iterative methods for sparse linear systems , 2003 .
[22] Anthony T. Chronopoulos,et al. s-step iterative methods for symmetric linear systems , 1989 .
[23] M S Day,et al. Numerical simulation of laminar reacting flows with complex chemistry , 2000 .