A numerical investigation of Schwarz domain decomposition techniques for elliptic problems on unstructured grids

Mathematics and Computers in Simulation

Volumn 44, Issue 4, 1997, Pages 313-330

  Formaggia, Luca ^a   Scheinine, Alan ^a   Quarteroni, Alfio ^a,b  

^a CENTER FOR ADVANCED STUDIES   (Italy)

^b POLITECNICO DI MILANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DIFFERENTIAL EQUATIONS; FINITE ELEMENT METHOD; GEOMETRY; MATRIX ALGEBRA; PARALLEL ALGORITHMS; VECTORS;

COARSE GRID OPERATOR; LINEAR EQUATIONS; PARALLEL CONJUGATE GRADIENT ALGORITHM; SCHWARZ DOMAIN DECOMPOSITION;

NUMERICAL METHODS;

EID: 0031273604     PISSN: 03784754     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0378-4754(97)00062-1     Document Type: Article

References (18)

1. P.E. Bjorstad, M. Skogen, Domain decomposition algorithms of Schwarz type, designed for massively parallel computers, in: T.F. Chan, D.E. Keyes, G.A. Meurant, J.S. Scroggs, R.G. Voigt, Eds., Fifth International Symposium on Domain Decomposition Methods for Partial Differential Equations, SIAM, 1992.
2. T.F. Chan, B. Smith, J. Zou, Overlapping Schwarz methods on unstructured meshes using non-matching coarse grids, Technical Report 94-8, Department of Mathematics, UCLA, February, 1994.
3. T.F. Chan, T.P. Mathew, Domain decomposition algorithms, Acta Numerica, (1994) 61-143.
4. T.F. Chan, J. Zou, A convergence theory of multilevel additive Schwarz methods on unstructured meshes, Technical Report 95-16, Department of Mathematics, UCLA, March, 1995.
5. M. Dryja, O.B. Wildlund, An additive variant of the Schwarz alternating method for the case of many subregions, Technical Report 339, Department of Computer Science, Courant Institute, 1987; also Ultracomputer Note 131.
6. M. Dryja, O.B. Wildlund, Some domain decomposition algorithms for elliptic problems, in: L. Hayes, D. Kincaid, Eds., Iterative Methods for Large Linear Systems (Academic Press, San Diego, CA, 1989, pp.273-291).
7. M. Dryja, O.B. Wildlund, Domain decomposition algorithms with small overlap, Technical Report 606, Department of Computer Science, Courant Institute, New York, May, 1992.
8. B. Hendrickson, R. Leland, An improved spectral graph partitioning algorithm for mapping parallel computations, Technical Report SAND92-1460, Sandia National Laboratories, September, 1992.
9. B. Hendrickson, R. Leland, Multidimensional spectral load balancing, Technical Report SAND93-0074, Sandia National Laboratories, January, 1993.
10. B. Hendrickson, R. Leland, A multilevel algorithm for partitioning graphs, Technical Report SAND93-1301, Sandia National Laboratories, October, 1993.
11. G. Karypis, V. Kumar, Analysis of multilevel graph partitioning, Technical Report 95-037, Department of Computer Science, University of Minnesota, June, 1995.
12. G. Karypis, V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, Technical Report 95-035, Department of Computer Science, University of Minnesota, June, 1995.
13. D.E. Keyes, Y. Saad, D.G. Truhlar, Eds., Domain-based Parallelism and Problem Decomposition Methods in Computational Science and Engineering, SIAM, 1995.
14. B. Koobus, M.H. Lallemand, A. Dervieux, Unstructured volume-agglomeration MG: Solution of the Poisson equation, Rapport de recherche RR-1496, INRIA, June, 1993.
15. M.H. Lallemand, H. Steve and A. Dervieux, Unstructured multigridding by volume agglomeration: Current status, Computers and Fluids 21(3) (1992) 397-433.
16. Y. Saad, ILUT: A dual threshold incomplete ILU factorization, Technical Report 92-38, Minnesota Supercomputer Institute, University of Minnesota, Minneapolis, MN, 1992.
17. Y. Saad, SPARSKIT: A basic tool kit for sparse matrix computations. Users Mannual, Version 2, Computer Science Department, University of Minnesota, June, 1994.
18. H.A. Schwarz, Gesammelte mathematishe abhandlungen, volume 2, pp.133-143, Springer, Berlin, 1890.