On the Gauss, Cholesky and Householder algorithms

Advances in Engineering Software

Volumn 40, Issue 2, 2009, Pages 110-117

  Benhamadou, Mongi ^a  

^a University of Sfax   (Tunisia)

Author keywords

Cholesky; Gauss; Gauss jordan; House holder; Linear systems

Indexed keywords

LINEAR SYSTEMS; NUMERICAL ANALYSIS;

CHOLESKY; GAUSS; GAUSS-JORDAN; HOUSEHOLDER ALGORITHMS; PARALLEL COMPUTATIONS; TENSOR PRODUCTS;

TENSORS;

EID: 54249109486     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.advengsoft.2008.03.018     Document Type: Article

References (25)

1. Householder A.S. The theory of matrices in numerical analysis (1964), Dover Publications, Inc, New York
2. Gastinel N. Analyse Numérique Linéaire (1966), Herman, Paris
3. Ciarlet P.G. Introduction à l'Analyse Numérique Matricielle et à l'Optimisation (1980), Masson, Paris
4. Durand E. Solutions Numériques des Equations Algébriques., Tome II. Masson et cie (1972)
5. Rotella F., and Borne P. Théorie et Pratique du Calcul Matriciel. Éditions Technip (1995)
6. Golub G.H., and Van Loan C.F. Matrix computations. 2nd ed. (1989), The Johns Hopkins University Press
7. Jennings A. Matrix computation for engineers and scientists (1980), John Wiley and Sons
8. Minoux M. Programmation Mathématique. Théorie et Algorithmes. Tome 1 (1983), Dunod, Paris
9. Strang G. Introduction to applied mathematics (1990), Wellesley-Cambridge Press
10. Lascaux P., and Théodor R. Analyse Numérique Matricielle Appliquée à l'Art de l'Ingénieur. Tome 1 (1993), Masson, Paris
11. Chatzman M. Analyse Numérique, Cours et Exercices pour la Licence (1991), InterEdition, Paris
12. Wilkinson J.H. The algebraic eigenvalue problem (1965), Claredon Press, Oxford, England
13. o 1955, de l'Université Paul Sabatier, Toulouse 3, Toulouse, France; 1994.
14. Benhamadou M. A new method to solve large linear systems: the algorithm of "recursive reduction". Adv Eng Softw 31 7 (2000) 481-491
15. Benhamadou M. On the simplex algorithm revised form. Adv Eng Softw 33 (2002) 469-777
16. Benhamadou M. A new algorithm to solve nonlinear systems. Adv Eng Softw 36 (2005) 385-392
17. Benhamadou M. Preconditioners for the resolution of the linear systems Ax = b. Appl Math Comput 189 (2007) 927-942
18. Axelsson O. A generalised SSOR method. BIT V 13 (1972)
19. Evans D.J. The use of preconditioning in iterative method for solving linear equations with symmetric positive definite matrices. J Inst Math Appl 4 (1967)
20. Meijerink J.A., and Van Der Vorst H.A. An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Math Comput 31 (1977)
21. Chow, Edmont, Saad, Yousef. Approximate inverse preconditioners for general sparse matrices, Department of Computer Science, and Minnesota Supercomputer Institute, University of Minnesota, Mai; 1994.
22. Congrove J.D.F., Diaz J.C., and Griewank A.Yu. Approximate inverse preconditioning for sparse linear systems. Int J Comput Math 44 (1992) 91-110
23. Huckle, T, Grote, M. A new approach to parallel preconditioning with sparse approximate inverses. Manuscript SCCM-94-03. Scientific computing and computational mathematics program, Stanford University Stanford, California; 1994.
24. Huckle, T, Grote, M. Effective parallel preconditioning with sparse approximate inverses. Manuscript SCCM-94-03. Scientific computing and computational mathematics program, Stanford University Stanford, California; 1999.
25. Tang W.-P. Toward an effective sparse approximate inverse preconditioner. SIAM J Matrix Anal Appl 20 4 (1998) 970-986