An algebraic multilevel parallelizable preconditioner for large-scale CFD problems

Computer Methods in Applied Mechanics and Engineering

Volumn 149, Issue 1-4, 1997, Pages 303-318

  Dutto, Laura C ^a   Habashi, Wagdi G ^a   Fortin, Michel ^b  

^a Dept of Electrical and Computer Engineering   (Canada)

^b UNIVERSITÉ LAVAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; LAMINAR FLOW; MATRIX ALGEBRA; NAVIER STOKES EQUATIONS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SUBSONIC FLOW;

SHARED MEMORY COMPUTERS;

COMPUTATIONAL FLUID DYNAMICS;

COMPUTATIONAL FLUID DYNAMICS; LAMINAR FLOW; NAVIER-STOKES EQUATIONS;

FLOW MODELLING; LAMINAR FLOW; NAVIER-STOKES EQUATIONS;

EID: 0031255682     PISSN: 00457825     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0045-7825(97)00049-2     Document Type: Article

References (18)

1. E.H. Cuthill and J.M. McKee, Reducing the bandwith of sparse symmetric matrices, in: Proc. 24th National Conf. Association for Computing Machinery (Brondon Press, New Jersey 1969) 157-172.
2. L.C. Dutto, The effect of ordering on preconditioned GMRES algorithm, for solving the compressible Navier-Stokes equations, Int. J. Numer. Methods Engrg., 36(3) (1993) 457-497.
3. L.C. Dutto, W.G. Habashi and M. Fortin, Parallelizable block diagonal preconditioners for the compressible Navier-Stokes equations, Comput. Methods Appl. Mech. Engrg. 117 (1994) 15-47.
4. L.C. Dutto, W.G. Habashi, M.P. Robichaud and M. Fortin, A method for finite element parallel viscous compressible flow calculations, Int. J. Numer. Methods in Fluids 19 (1994) 275-294.
5. R.W. Freund, A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems, SIAM J. Sci. Comput., 14(2) (1993) 470-482.
6. A. George, Computer Implementation of the Finite Element Method, PhD thesis, Department of Computer Science, Stanford University, Stanford, USA, 1971. Also as Research Report STAN CS-71-208, Stanford University, Stanford, USA.
7. A. George and J.W.H. Liu, The evolution of the minimum degree ordering algorithm, SIAM Rev. 31 (1989) 1-19.
8. B. Hendrickson and R. Leland, The chaco user's guide, version 1.0, Technical Report SAND 93-2339, Sandia National Laboratories, Albuquerque, NM 87185-1110, 1993.
9. B. Hendrickson and R. Leland, A multilevel algorithm for partitioning graphs, in: Proc. Supercomputing '95, ACM, December 1995.
10. C. Lepage, A guide to FENSAP, version 3.6, Internal Technical Report, Concordia University, Montreal, Canada, November 1996.
11. W.-H. Liu and A.H. Sherman, Comparative analysis of the Cuthill-McKee and the reverse Cuthill-McKee ordering algorithms for sparse matrices, SIAM J. Numer. Anal. 13(2) (1976) 198-213.
12. G. Martin, Méthodes de préconditionnement par factorisation incomplète, Master's Thesis, Université Laval, Québec, Canada, 1991.
13. J. O'Neil and D.B. Szyld, A block ordering method for sparse matrices, SIAM J. Sci. Stat. Comput. 11(5) (1990) 811-823.
14. M.P. Robichaud, W.G. Habashi, M.F. Peeters, L.C. Dutto and M. Fortin, Parallel finite element computation of 3D compressible turbomachinery flows on workstation clusters, in: W.G. Habashi, ed., Solution Techniques for Large-Scale CFD Problems, CMAS: Computational Methods in Applied Sciences (John Wiley and Sons, Toronto, Canada, 1995) 41-56.
15. C. Robitaille, Une expérience de parallélisation d'un code d'eléments finis, Master's thesis, Université Laval, Québec, Canada, April 1996.
16. Y. Saad and M. Schultz, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Stat. Comput. 7(3) (1986) 856-869.
17. P. Sonneveld, CGS, a fast Lanczos type solver for nonsymmetric linear systems, SIAM J. Sci. Stat. Comput. 10 (1989) 36-52.
18. H.A. van der Vorst, Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Stat. Comput. 13 (1992) 631-644.