Abstract
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 [1] and Evans and Hatzopoulos [2]. 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.
Preview
Unable to display preview. Download preview PDF.
References
Evans, D.J., and Hadjidimos A., "The Parallel Solution of Linear System", International Journal of Computer Mathematics, Vol.8, pp.149–166 (1980).
Evans, D.J., and Hatzopoulos, M., "Modification to the Quadrant Interlocking Factorisation Parallel Method", International Journal of Computer Mathematics, Vol.7, pp.227–238 (1979).
Flynn, M.J., "Some Computer Organisations and Their Effectiveness", IEEE Trans. on Computers C-21, pp.948–960 (1972).
Stone, H.S., "Problems of Parallel Computation" in ‘Complexity of Sequential and Parallel Numerical Algorithms', (Edit. J.F. Traub), 1–16, Academic Press, (1973).
Kuck, D.J., Multi-operation Machine Computational" in ‘Complexity of Sequential and Parallel Numerical Algorithms', see [4].
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).
Shanehchi, J., "The Determination of Sparse Eigensystems and Parallel Linear System Solvers", Ph.D. Thesis, Loughborough University of Technology, (1980).
Wilkinson, J.H., "Rounding Errors in Algebraic Processes", H.M.S.O., (1963).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shanehchi, J., Evans, D.J. (1981). New variants of the quadrant interlocking factorisation (Q.I.F.) method. In: Brauer, W., et al. Conpar 81. CONPAR 1981. Lecture Notes in Computer Science, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105140
Download citation
DOI: https://doi.org/10.1007/BFb0105140
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10827-6
Online ISBN: 978-3-540-38715-2
eBook Packages: Springer Book Archive