High performance computing of three-dimensional finite element codes on a 64-bit machine

Journal of Applied Fluid Mechanics

Volumn 5, Issue 2, 2012, Pages 123-132

  Raju, M P ^a   Khaitan, S K ^b  

^a CASE WESTERN RESERVE UNIVERSITY   (United States)

^b Iowa State University   (United States)

Author keywords

64 bit; HSL MA78; Multifrontal; MUMPS; PARDISO; UMFPACK

Indexed keywords

EID: 84864840985     PISSN: 17353572     EISSN: 17353645     Source Type: Journal    
DOI: 10.36884/jafm.5.02.12174     Document Type: Article

References (36)

1. Amestoy, P.R., A. Guermouche, J.Y. L'Excellent and S. Pralet (2006). Hybrid scheduling for the parallel solution of linear systems. Parallel Computing 32(2), 136-156.
2. Amestoy, P.R., T.A. Davis and I.S. Duff (2004). Algorithm 837: AMD, an approximate minimum degree ordering algorithm. ACM Trans. Mathematical Software 30(3), 381-388.
3. Amestoy, P.R., I.S. Duff, J. Koster and J.Y. L'Excellent (2002). A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM Journal on Matrix Analysis and Applications 23(1), 15-41.
4. Amestoy, P.R., I.S. Duff, J. Koster and J.Y. L'Excellent (2000). Multifrontal parallel distributed symmetric and unsymmetric solvers. Comput. Methods Appl. Mech. Eng. 184, 501-520.
5. Amestoy, P.R., T.A. Davis and I.S. Duff (1996). An approximate minimum degree ordering algorithm. SIAM: Matrix Analysis and Applications 17, 886-905.
6. Amestoy, P.R. and I.S. Duff (1989). Vectorization of a multiprocessor multifrontal code. Int. J. Supercomputer Appl. 3(3), 41-59.
7. Davis, T., (2004). A column pre-ordering strategy for the unsymmetric-pattern multi-frontal method. ACM Trans. Math. Software 30(2), 165-195.
8. Davis, T., J. Gilbert and E. Larimore (2004). Algorithm 836: COLAMD, an approximate column minimum degree ordering algorithm. ACM Trans. Math. Software 30(3), 377-380.
9. Davis, T.A. and I.S. Duff (1999). A combined unifrontal/multifrontal method for unsymmetric sparse matrices. ACM Trans. Math. Soft. 25(1), 1-20.
10. Duff, I.S. and J.K. Reid (1984). The multifrontalsolution of unsymmetric sets of linear systems. SIAM Journal on Scientific and Statistical Computing 5, 633-641.
11. Duff, I.S. and J.K. Reid (1983). The multifrontal solution of indefinite sparse symmetric linear systems. ACM Transactions on Mathematical Software 9, 302-325.
12. Elman, H.C., D.J. Silvester and A.J. Wathen (2005). Finite elements and fast iterative solvers: with applications in Incompressible Fluid dynamics. Oxford:Oxford University Press.
13. Guermouche, A. and J.Y. L'Excellent (2006). Constructing memory-minimizing schedules for multifrontal methods. ACM Transactions on Mathematical Software 32(1), 17-32.
14. Guermouche, A., J.Y. L'Excellent and G. Utard (2003). Impact of reordering on the memory of a multifrontal solver. Parallel Computing 29(9), 1191-1218.
15. Gupta, P.K. and K.V. Pagalthivarthi (2007). Application of Multifrontal and GMRES Solvers for Multisize Particulate Flow in Rotating Channels. Prog. Comput. Fluid Dynam. 7, 323-336.
16. Habashi, W.G. and M.M. Hafez (1995). Computational Fluid Dynamic Techniques. Amsterdam:Gordon and Breach Science Publishers.
17. Irons, B.M. (1970). A frontal solution scheme for finite element analysis. Numer. Meth. Engg. 2, 5-32.
18. Karypis, G., and V. Kumar (1998). METIS - A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices - Version 4.0. University of Minnesota.
19. Khaitan, S., J. McCalley and M.P. Raju (2010). Numerical methods for on-line power system load flow analysis, Energy systems 1(2), 273-288.
20. Khaitan, S., J. McCalley and Q. Chen (2008). Multifrontal solver for online power system timedomain simulation, Power Systems, IEEE Transactions 23 (4), 1727-1737.
21. Raju, M.P. and S. Khaitan (2010). Implementation of Shared Memory Sparse Direct Solvers for Three Dimensional Finite Element Codes. Journal of Computing, accepted for publication.
22. Raju, M.P. (2009). Parallel Computation of Finite Element Navier-Stokes codes using MUMPS Solver. International Journal of Computer Science Issues 4(2), 20-24.
23. Raju, M.P. and S. Khaitan (2009). High Performance Computing Using Out-of-Core Sparse Direct Solvers. International Journal of Mathematical, Physical and Engineering Sciences 3(2) 96-102.
24. Raju, M.P. and S. Khaitan (2009). Domain Decomposition Based High Performance Parallel Computing. International Journal of Computer Science Issues 5, 27-32.
25. Raju, M.P. and J.S. T'ien (2008). Development of Direct Multifrontal Solvers for Combustion Problems. Numerical Heat Transfer, Part B 53, 1-17.
26. Raju, M.P. and J.S. T'ien (2008). Modelling of Candle Wick Burning with a Self-trimmed Wick. Comb. Theory Modell. 12(2), 367-388.
27. Raju, M.P. and J.S. T'ien (2008). Two-phase flow inside an externally heated axisymmetric porous wick. J. Porous Media 11(8), 701-718.
28. Rehman, M., C. Vuik and G. Segal (2008). A comparison of preconditioners for incompressible Navier-Stokes solvers. Int. J. Num. Met. Fluid 57, 1731-1751.
29. Reid, J. and J. Scott (2009). An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems. International Journal for Numerical Methods in Engineering 77(7), 901-921.
30. Schulze, J. (2001). Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods. BIT 41(4), 800-841.
31. Schenk, O. and K. Gartner (2004). Solving Unsymmetric Sparse Systems of Linear Equations with PARDISO. Journal of Future Generation Computer Systems 20(3), 475-487.
32. Schenk, O. and K. Gartner (2002). Two-level scheduling in PARDISO: Improved Scalability on Shared Memory Multiprocessing Systems. Parallel Computing 28, 187-197.
33. Schenk, O. and K. Gartner (2001). Sparse Factorization with Two-Level Scheduling in PARDISO. In Proceeding of the 10th SIAM conference on Parallel Processing for Scientific Computing, Portsmouth, Virginia, March 12-14.
34. Schenk, O., K. Gartner and W. Fichtner (2000). Efficient Sparse LU Factorization with Left-right Looking Strategy on Shared Memory Multiprocessors. BIT 40(1), 158-176.
35. Schenk, O. (2000). Scalable Parallel Sparse LU Factorization Methods on Shared Memory Multiprocessors. Thesis (PhD). ETH Zurich.
36. Tinney, W.F. and J.W. Walker (1967). Direct solutions of sparse network equations by optimally ordered triangular factorization. Proc. IEEE 55, 1801-1809.