Domain decomposition techniques

Lecture Notes in Computational Science and Engineering

Volumn 51, Issue , 2006, Pages 135-163

  Formaggia, Luca ^a   Sala, Marzio ^b   Saleri, Fausto ^a  

^a POLITECNICO DI MILANO   (Italy)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; DOMAIN DECOMPOSITION METHODS; ITERATIVE METHODS; LINEAR SYSTEMS; PARTIAL DIFFERENTIAL EQUATIONS;

COARSE CORRECTION; DOMAIN DECOMPOSITION TECHNIQUES; ITERATIVE SOLUTIONS; NUMERICAL RESULTS; PARALLEL DOMAIN DECOMPOSITION; SCHUR COMPLEMENT SYSTEM; SPARSE LINEAR SYSTEMS; UNSTRUCTURED MESHES;

COMPUTATIONAL FLUID DYNAMICS;

EID: 84864774956     PISSN: 14397358     EISSN: None     Source Type: Book Series    
DOI: 10.1007/3-540-31619-1_4     Document Type: Article

References (29)

1. nd order elliptic finite element problems. East-West J. Numer. Math., 4:99-120, 1996.
2. T. Chan, B. Smith, and J. Zou. Overlapping Schwarz methods on unstructured meshes using non-matching coarse grids. Numer. Math., 73:149-167, 1996.
3. T. Chan, S. Go, and J. Zou. Boundary treatments for multilevel methods on unstructured meshes. SIAM J. Sci. Comput., 21(1):46-66, 1999.
4. T. Chan and T. Mathew. The interface probing technique in domain decomposition. SIAM Journal on Matrix Analysis and Applications, 13(1):212-238, 1992.
5. T. Chan and T. Mathew. Domain decomposition algorithms. Acta Numerica, pages 61-163, 1993.
6. T. Coffey, C. Kelley, and D. Keyes. Pseudotransient continuation and differentialalgebraic equations. SIAM Journal on Scientific Computing, 25(2):553-569, 1996.
7. H. Deconinck, H. Paillère, R. Struijs, and P. Roe. Multidimensional upwind schemes based on fluctuaction splitting for systems of conservation laws. Comput. Mech., 11:323-340, 1993.
8. M. Dryja, B. Smith, and O. Widlund. Schwarz analysis of iterative substructuring algorithms for elliptic problems in three dimensions. SIAM J. Numer. Anal., 31(6):1662-1694, 1993.
9. M. Dryja and O. Widlund. Domain decomposition algorithms with small overlap. SIAM J. Sci. Comput., 15(3):604-620, 1994.
10. C. Farhat and F. Roux. A method of finite element tearing and interconnecting and its parallel solution algorithm. Internat. J. Numer. Meth. Engrg., 32:1205-1227, 1991.
11. A. Grama, A. Gupta, and V. Kumar. Isoefficiency: Measuring the scalability of parallel algorithms and architectures. IEEE Parallel Distrib. Technol., 1:12-21, August 1993.
12. F. Hülsemann, M. Kowarschik, M. Mohr, and U. Rüde. Parallel geometric multigrid. In A. M. Bruaset and A. Tveito, editors, Numerical Solution of Partial Differential Equations on Parallel Computers, volume 51 of Lecture Notes in Computational Science and Engineering, pages 165-208. Springer-Verlag, 2005.
13. K. Hwang. Advanced Computer Architecture: Parallelism Scalability, Programmability. McGraw Hill, New York, 1993.
14. K. Hwang and Z. Xu. Scalable Parallel Computing: Technology, Architecture, Programming. McGraw-Hill, Inc., New York, NY, USA, 1998.
15. G. Karypis and V. Kumar. METIS: Unstructured graph partitining and sparse matrix ordering system. Technical Report 98-036, University of Minnesota, Department of Computer Science, 1998.
16. P. Lin, M. Sala, J. Shadid, and R. Tuminaro. Performance of fully-coupled algebraic multilevel domain decomposition preconditioners for incompressible flow and transport. submitted to International Journal for Numerical Methods in Engineering, 2004.
17. A. Quarteroni and A. Valli. Domain Decomposition Methods for Partial Differential Equations. Oxford University Press, Oxford, 1999.
18. Y. Saad. Iterative Methods for Sparse Linear Systems. Thompson, Boston, 1996.
19. M. Sala. Amesos 2.0 reference guide. Technical Report SAND-4820, Sandia National Laboratories, September 2004.
20. M. Sala. Analysis of two-level domain decomposition preconditioners based on aggregation. Mathematical Modelling and Numerical Analysis, 38(5):765-780, 2004.
21. B. Smith, P. Bjorstad, and W. Gropp. Domain Decomposition, Parallel Multilevel Methods for Elliptic Partial Differential Equations. Cambridge University Press, New York, 1996.
22. X.-H. Sun. Scalability versus execution time in scalable systems. J. Parallel Distrib. Comput., 62(2):173-192, 2002.
23. X.-H. Sun and D. Rover. Scalability of parallel algorithm-machine combinations. IEEE Parallel Distrib. Systems, 5:599-613, June 1994.
24. P. L. Tallec. Domain decomposition methods in computational mechanics. Computational Mechanics Advances, 1:121-220, 1994.
25. A. Toselli and O. Widlund. Domain Decomposition Methods-Algorithms and Theory, volume 34 of Springer Series in Computational Mathematics. Springer-Verlag, New York, 2005.
26. H. van der Vorst. Iterative Krylov Methods for Large Linear Systems, volume 13 of Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, Cambridge, 2003.
27. H. van der Vorst and C. Vuik. GMRESR: a family of nested GMRES methods. Num. Lin. Alg. Appl., 1:369-386, 1994.
28. P. Vanek, J. Mandel, and M. Brezina. Algebraic multigrid based on smoothed aggregation for second and fourth order problems. Computing, 56:179-196, 1996.
29. U. M. Yang. Parallel algebraic multigrid methods-high performance preconditioners. In A. M. Bruaset and A. Tveito, editors, Numerical Solution of Partial Differential Equations on Parallel Computers, volume 51 of Lecture Notes in Computational Science and Engineering, pages 209-236. Springer-Verlag, 2005.