New variants of the quadrant interlocking factorisation (Q.I.F.) method
New factorisation methods suitable for the solution of linear equations applicable to parallel computers are proposed in this paper. The methods are based on variations to the Quadrant Interlocking Factorisation (Q.I.F.) methods given earlier in Evans and Hadjidimos  and Evans and Hatzopoulos . The new methods can be considered as the Crout and Gauss-Jordan type for general real matrices and Choleski type for matrices which are positive definite. The paper also includes topics such as error analysis and computational cost analysis for the proposed methods.
KeywordsLinear System Coefficient Matrix Factorisation Method Root Operation Hand Side Vector
Unable to display preview. Download preview PDF.
- Flynn, M.J., "Some Computer Organisations and Their Effectiveness", IEEE Trans. on Computers C-21, pp.948–960 (1972).Google Scholar
- Stone, H.S., "Problems of Parallel Computation" in ‘Complexity of Sequential and Parallel Numerical Algorithms', (Edit. J.F. Traub), 1–16, Academic Press, (1973).Google Scholar
- Kuck, D.J., Multi-operation Machine Computational" in ‘Complexity of Sequential and Parallel Numerical Algorithms', see .Google Scholar
- Martin, R.S., Reinsch C. and Wilkinson, J.H., "Householder's Tridiagonalisation of a Symmetric Matrix", Nat.Bur. of Standards, A.M.S., No.57, pp.22–24, (1960).Google Scholar
- Shanehchi, J., "The Determination of Sparse Eigensystems and Parallel Linear System Solvers", Ph.D. Thesis, Loughborough University of Technology, (1980).Google Scholar
- Wilkinson, J.H., "Rounding Errors in Algebraic Processes", H.M.S.O., (1963).Google Scholar