Heuristics for the Automatic Construction of Coarse Grids in Multigrid Solvers for Finite Element Matrices
暂无分享,去创建一个
[1] J. Ruge,et al. AMG for problems of elasticity , 1986 .
[2] I. D. Parsons,et al. A parallel multigrid method for history-dependent elastoplasticity computations , 1993 .
[3] Mark T. Jones,et al. A Parallel Graph Coloring Heuristic , 1993, SIAM J. Sci. Comput..
[4] Node-Nested Multi-Grid With Delaunay Coarsening , 1993 .
[5] Tony F. Chan,et al. Domain decomposition and multigrid algorithms for elliptic problems on unstructured meshes , 1994 .
[6] Jacob Fish,et al. An efficient multilevel solution scheme for large scale non-linear systems , 1995 .
[7] Vipin Kumar,et al. Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.
[8] Dafna Talmor,et al. Well-Spaced Points for Numerical Methods , 1997 .
[9] Sivan Toledo,et al. Improving the memory-system performance of sparse-matrix vector multiplication , 1997, IBM J. Res. Dev..
[10] Jonathan Richard Shewchuk,et al. Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates , 1997, Discret. Comput. Geom..
[11] M. Adams,et al. A Parallel Maximal Independent Set Algorithm , 1998 .
[12] William Gropp,et al. PETSc 2.0 users manual , 2000 .