Existence and stability of choleski Q.I.F. for symmetric linear systems

International Journal of Computer Mathematics

Volumn 79, Issue 9, 2002, Pages 1013-1025

  Khazal, R R ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Choleski Q.I.F; Elimination interpretation; Existence; Operations counts; Strong stability; Symmetric positive definite linear systems

Indexed keywords

MATRIX ALGEBRA; STABILITY;

CHOLESKI Q.I.F; EXISTENCE; STRONG STABILITY;

LINEAR SYSTEMS;

EID: 28244495876     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160212121     Document Type: Article

References (5)

1. Evans, D.J. (1999) The Choleski Q.I.F. algorithm for solving symmetric linear systems, Intern. J. Computer Math. 72, 283-288.
2. Evans, D.J. (1982) Parallel numerical algorithms for linear systems, In: Evans, D.J. (Ed.), Parallel Processing Systems (Cambridge University Press, Cambridge), pp. 357-384.
3. Abdullah, R. and Evans, D.J. (1998) Communication analysis of the PIE and QIF algorithms on distributed memory architectures, Intern. J. Computer Math. 67, 291-313.
4. Fox, L. (1964) An Introduction to Numerical Linear Algebra (Oxford University Press, Oxford).
5. Wendroff, B. (1966) Theoretical Numerical Analysis (Academic Press, New York).