Iterative versus direct parallel substructuring methods in semiconductor device modelling

Numerical Linear Algebra with Applications

Volumn 12, Issue 1, 2005, Pages 33-53

  Giraud, L ^a   Marrocco, A ^b   Rioual, J C ^a,c  

^a CERFACS   (France)

^b INRIA ROCQUENCOURT   (France)

^c NEC High Performance Computing Europe   (United Kingdom)

Author keywords

Drift diffusion equations; Krylov solvers; Multifrontal solvers; Non overlapping domain decomposition; Parallel distributed computing; Preconditioning; Quasi Fermi level

Indexed keywords

EID: 20744455059     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/nla.391     Document Type: Article

References (38)

1. Chan TF, Mathew TP. Domain decomposition algorithms. In Acta Numerica 1994. Cambridge University Press: Cambridge, 1994; 61-143.
2. Quarteroni A, Valli A. Domain decomposition methods for partial differential equations. Numerical mathematics and scientific computation. Oxford Science Publications: Oxford, 1999.
3. Smith BF, Bjørstad PE, Gropp W. Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations. Cambridge University Press: Cambridge, 1996.
4. Schwarz HA. Ueber einen Grenzübergang durch alternierendes Verfahren. Vierteljahrsschrift der Naturforschenden Gesellschaft in Zürich, May 1870; 15:272-286.
5. Hecht F, Marrocco A. Mixed finite element simulation of heterojunction structures including a boundary layer model for the quasi-fermi levels. COMPEL 1994; 13(4):757-770.
6. El Boukili A. Analyse mathématique et simulation numérique bidimensionnelle des éuations des semiconducteurs par 1'approche éléments finis mixtes. Ph.D. Thesis, Université Paris VI, Paris, France, 1995.
7. Rioual JC. Solving linear systems for semiconductor device simulations on parallel distributed computers. Ph.D. Thesis, CERFACS, Toulouse, France, 2002.
8. Saad Y. Iterative Methods for Sparse Linear Systems. SIAM, Philadelphia, 2003, 2nd edn.
9. Gropp W, Lusk E, Skjellum A. Using MPI: Portable Parallel Programming with the Message-Passing Interface. MIT Press: Cambridge, MA, 1994.
10. Hestenes MR, Stiefel E. Methods of conjugate gradients for solving linear system. Journal of Research of the National Bureau Standards 1952; 849:409-436.
11. Saad Y, Schultz MH. GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM Journal of the Scientific and Statistical Computing 1986; 7:856-869.
12. Frayssé V, Giraud L. A set of conjugate gradient routines for real and complex arithmetics. Technical Report TR/PA/00/47, CERFACS, Toulouse, France, 2000. Public domain software available on www.cerfacs.fr/algor/Softs.
13. Frayssé V, Giraud L, Gratton S. A set of GMRES routines for real and complex arithmetics. Technical Report TR/PA/97/49, CERFACS, Toulouse, France, 1997. Public domain software available on www.cerfacs.fr/algor/Softs.
14. Amestoy PR, Duff IS, Koster J, L'Excellent J-Y. MUMPS: a general purpose distributed memory sparse solver. In Proceedings of PARA2000, the Fifth International Workshop on Applied Parallel Computing, Gebremedhin AH, Manne F, Moe R, Sørevik T (eds). Bergen, June 18-21, Lecture notes in computer science, vol. 1947. Springer: Berlin, 2000; 122-131.
15. Amestoy PR, Duff IS, L'Excellent J-Y. Multifrontal parallel distributed symmetric and unsymmetric solvers. Computer Methods in Applied Mechanics and Engineering 2000; 184:501-520.
16. Duff IS, Reid JK. The multifrontal solution of indefinite sparse symmetric linear systems. ACM Transactions on Mathematical Software 1983; 9:302-325.
17. Carvalho LM, Giraud L, Meurant G. Local preconditioners for two-level non-overlapping domain decomposition methods. Numerical Linear Algebra with Applications 2001; 8(4):207-227.
18. Bourgat J-F, Glowinski R, Le Tallec P, Vidrascu M. Variational formulation and algorithm for trace operator in domain decomposition calculations. In Domain Decomposition Methods, Chan T, Glowinski R, Périaux J, Widlund O (eds). SIAM: Philadelphia, PA, 1989; 3-16,
19. De Roeck Y-H, Le Tallec P. Analysis and test of a local domain decomposition preconditioner. In Fourth International Symposium on Domain Decomposition Methods for Partial Differential Equations, Glowinski R, Kuznetsov Y, Meurant G, Périaux J, Widlund O (eds). SIAM: Philadelphia, PA, 1991; 112-128.
20. Chaitin-Chatelin F, Frayssé V. Lectures on Finite Precision Computations. SIAM: Philadelphia, 1996.
21. Wilkinson JH. The Algebraic Eigenvalue Problem. Oxford Science Publications: Oxford, 1965.
22. Giraud L, Tuminaro RS. Schur complement preconditioners for anisotropic problems. IMA Journal of Numerical Analysis 1999; 19(1):1-17
23. (Also published as Sandia Nat. Lab Technical Report 98-8488J).
24. Chan TF, Mathew TP. The interface probing technique in domain decomposition. SIAM Journal on Matrix Analysis and Applications 1992; 13:212-238.
25. Arioli M. A stopping criterion for the conjugate gradient algorithm in a finite element method framework. Numerische Mathematik, DOI: 10.1007/s00211-003-0500-y:1-24, 2003.
26. Arioli M, Loghin D, Wathen AJ. Stopping criteria for iterations in finite element methods. Technical Report TR/PA/03/21, CERFACS, Toulouse, France, 2003.
27. Amestoy PR, Davis TA, Duff IS. An approximate minimum degree ordering algorithm. SIAM Journal on Matrix Analysis and Applications 1996; 17:886-905.
28. Karypis G, Kumar V. MeTiS - A Software Package for Partitioning Unstructured Graphs. Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices - Version 4.0. University of Minnesota, September 1998.
29. Amestoy PR, Duff IS, Koster J, L'Excellent J-Y. A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM Journal on Matrix Analysis and Applications 2001; 23(1): 15-41.
30. Marrocco A. Simulations numériques de dispositifs électroniques via éléments finis mixtes, adaptation de maillages et décomposition de domaine. Technical Report, INRIA, in preparation.
31. Carvalho LM. Preconditioned Schur complement methods in distributed memory environments. Ph.D. Thesis, INPT/CERFACS, France, October 1997. TH/PA/97/41, CERFACS.
32. Carvalho LM, Giraud L, Le Tallec P. Algebraic two-level preconditioners for the Schur complement method. SIAM Journal on Scientific Computing 2001; 22(6): 1987-2005.
33. Mandel J. Balancing domain decomposition. Communications in Numerical Methods in Engineering 1993; 9:233-241.
34. Le Tallec P, Mandel J, Vidrascu M. Balancing domain decomposition for plates. In Domain Decomposition Methods in Scientific and Engineering Computing: Proceedings of the Seventh International Conference on Domain Decomposition, Contemporary Mathematics, vol. 180. American Mathematical Society: Providence, RI, 1994; 515-524.
35. Le Tallec P, Mandel J, Vidrascu M. A Neumann-Neumann domain decomposition algorithm for solving plate and shell problems. SIAM Journal on Numerical Analysis April 1998; 35(2):836-867.
36. Bjørstad PE, Koster J, Krzyżanowski P. Domain decomposition solvers for large scale industrial finite element problems. In PARA2000 Workshop on Applied Parallel Computing. Lecture notes in computer science, vol. 1947. Springer: Berlin, 2000.
37. Carpentieri B, Duff IS, Giraud L. A class of spectral two-level preconditioners. SIAM Journal on Scientific Computing 2003; 25(2):749-765.
38. Giraud L, Koster J, Marrocco A, Rioual J-C. Domain decomposition methods in semiconductor device modeling. In Domain Decomposition Methods in Science and Engineering, Debit N, Garbey M, Hoppe R, Périaux J, Keyes D, Kuznetsov Y (eds). CIMNE: Barcelona, 2001; 469-476.