Geodesic
Parallel algorithms of adaptive refinement and partitioning of unstructured grids
Matematičeskoe modelirovanie, Tome 14 (2002) no. 9, pp. 91-96.

Voir la notice de l'article provenant de la source Math-Net.Ru

The main principles are stated for adaptive refinement and partitionings of unstructured grids. The different algorithms of a dynamic load balancing are compared in case of the parallel implementation of an adaptive refinement of solution. 
@article{MM_2002_14_9_a17,
     author = {S. P. Kopysov and A. K. Novikov},
     title = {Parallel algorithms of adaptive refinement and partitioning of unstructured grids},
     journal = {Matemati\v{c}eskoe modelirovanie},
     pages = {91--96},
     publisher = {mathdoc},
     volume = {14},
     number = {9},
     year = {2002},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MM_2002_14_9_a17/}
}
TY  - JOUR
AU  - S. P. Kopysov
AU  - A. K. Novikov
TI  - Parallel algorithms of adaptive refinement and partitioning of unstructured grids
JO  - Matematičeskoe modelirovanie
PY  - 2002
SP  - 91
EP  - 96
VL  - 14
IS  - 9
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MM_2002_14_9_a17/
LA  - ru
ID  - MM_2002_14_9_a17
ER  - 
%0 Journal Article
%A S. P. Kopysov
%A A. K. Novikov
%T Parallel algorithms of adaptive refinement and partitioning of unstructured grids
%J Matematičeskoe modelirovanie
%D 2002
%P 91-96
%V 14
%N 9
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MM_2002_14_9_a17/
%G ru
%F MM_2002_14_9_a17
S. P. Kopysov; A. K. Novikov. Parallel algorithms of adaptive refinement and partitioning of unstructured grids. Matematičeskoe modelirovanie, Tome 14 (2002) no. 9, pp. 91-96. http://geodesic.mathdoc.fr/item/MM_2002_14_9_a17/

[1] Kopysov S. P., Metody dekompozitsii i parallelnye skhemy metoda konechnykh elementov, Izhevsk, 2000, Preprint Instituta prikladnoi mekhaniki UrO RAN

[2] Ales M. Yu., Kopysov S. P., Novikov A. K., “Postroenie i adaptatsiya konechno-elementnoi setki pri reshenii ellipticheskoi zadachi vtorogo poryadka”, Matem. modelirovanie, 9:2 (1997), 43–45

[3] Walshaw C., Parallel Jostle. User guide version 1.2.9, University of Greenwich, London, UK, 1998

[4] Karypis G., Schloegel K., Kumar V., ParMetis: Parallel Graph Partitioning and Sparse Matrix Ordering Library. Version 2.0, Technical Report, Depart. of Computer Science, University of Minnesota, 1998

[5] Basermann A., Fingberg J., Londsdale G., The DRAMA Library Interface Definition, DRAMA Project Deliverable D1.2 a, 1998

[6] Devine K., Hendrickson B., Boman E. M. St.John, Vaughan C. Zoltan, A Dynamic Load-Balancing Library for Parallel Applications; User's Guide, Sandia National Laboratories Tech. Rep. SAND 99-1377, Albuquerque, NM, 1999

[7] Kernighan B. W., Lin S., “An efficient heuristic procedure for partitioning graphs”, The Bell System Technical Journal, 29:2 (1970), 291–307

[8] Schloegel K., Karypis G., Kumar V., “Multilevel diffusion algorithms for repartitioning of adaptive meshes”, Journal of Parallel and Distributed Computing, 47 (1997), 109–124 | DOI