Parallel Support Set Searches for Meshfree Methods
暂无分享,去创建一个
[1] M. Shephard,et al. Automatic generation of octree-based three-dimensional discretizations for Partition of Unity methods , 2000 .
[2] Mark A Fleming,et al. Meshless methods: An overview and recent developments , 1996 .
[3] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[4] Jack Dongarra,et al. MPI: The Complete Reference , 1996 .
[5] David H. Bailey,et al. Algorithms and applications , 1988 .
[6] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[7] Michael Griebel,et al. A Particle-Partition of Unity Method-Part II: Efficient Cover Construction and Reliable Integration , 2001, SIAM J. Sci. Comput..
[8] Hanan Samet,et al. The Design and Analysis of Spatial Data Structures , 1989 .
[9] Suely Oliveira,et al. Finding Sets Covering a Point with Application to Mesh-Free Galerkin Methods , 2000, SIAM J. Comput..
[10] G. Fasshauer. Meshfree Methods , 2004 .
[11] Peter S. Pacheco. Parallel programming with MPI , 1996 .