A Data Structure for Parallel L/U Decomposition

IEEE Transactions on Computers

Volumn C-31, Issue 3, 1982, Pages 231-239

  Jess, Jochen A G ^a   Kees, H G M ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Elimination tree; L U decomposition; parallel processing; schedule; sparse matrix pivoting; task graph; tearing; triangulated graph

Indexed keywords

DATA PROCESSING - DATA STRUCTURES;

COMPUTER SYSTEMS, DIGITAL;

EID: 0020100807     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1982.1675979     Document Type: Article

References (20)

1. C. Pottle and Y. M. Wong, “Nonlinear circuit simulation on a parallel microcomputer system,” in Proc. 1976 IEEE Int. Symp. Circuits and Syst., Apr. 1976, pp. 394-397.
2. J. A. G. Jess, “Some new results on decomposition and pivoting of large sparse systems of linear equations,” IEEE Trans. Circuits Syst., vol. CAS-23, pp. 729-738, Dec. 1976.
3. D. A. Calahan, “Parallel solution of sparse simultaneous linear equations,” in Proc. 11th Annu. Allerton Conf. Circuit and Syst. Theory, Oct. 1973, pp. 729-735.
4. G. Kron, “A set of principles to interconnect the solutions of physical systems,” J. Appl. Phys., vol. 24, pp. 965-980, Aug. 1953.
5. F. H. Branin, “A sparse matrix modification of Kron's method of piecewise analysis,” in Proc. 1975 IEEE Int. Symp. Circuits and Syst., Apr. 1975, pp. 383-386.
6. L. O. Chua and L. K. Chen, “Diakoptic and generalized hybrid analysis,” IEEE Trans. Circuits Syst., vol. CAS-23, pp. 694-705, Dec. 1976.
7. A. K. Kevorkian and J. Snoek, “Decomposition in large scale systems: Theory and application in solving large sets of nonlinear simultaneous equations,” in Decomposition of Large Scale Problems, D. M. Him-melblau, Ed. Amsterdam, The Netherlands: North-Holland, 1973.
8. A. L. Sangiovanni-Vincentelli, “A graph theoretical interpretation of nonsymmetric permutation on sparse matrices,” Int. J. Circuit Theory and Appl., vol 5, pp. 139-147, 1977.
9. O. Wing and J. Huang, “A computation model of parallel solution of linear equations,” IEEE Trans. Comput., vol. C-29, pp. 632-638, July 1980.
10. S. Parter, “The use of linear graphs in Gauss elimination,” SI AM Rev., vol.3, pp. 119-130, Apr. 1961.
11. D. J. Rose, “A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations,” in Graph Theory and Computing, R. Read, Ed. New York: Academic, 1972, pp. 183-217.
12. D. J. Rose, “Triangulated graphs and the elimination process,” J. Math. Anal. Appl, vol. 32, pp. 597-609, 1970.
13. C. Berge, “Some classes of perfect graphs,” in Graph Theory and Theoretical Physics, F. Harary, Ed. New York: Academic, 1967, pp. 155-166.
14. H. M. Markowitz, “The elimination form of the inverse and its application to linear programming,” Management Sci., vol. 3, pp. 255-269, 1957.
15. R. D. Berry, “An optimal ordering of electronic circuit equations for a sparse matrix solution,” IEEE Trans. Circuit Theory, vol. CT-18, pp. 40-50, Jan. 1971.
16. W. F. Tinney and J. W. Walker, “Direct solutions of sparse network equations by optimally ordered triangular factorisation,” Proc. IEEE, vol. 55, pp. 1801-1809, Nov. 1967.
17. I. S. Duff, “A survey of sparse matrix research,” Proc. IEEE, vol. 65, pp. 500-535, Apr. 1977.
18. E. G. Coffman, Computer and Job-Shop Scheduling Theory. New York: Wiley, 1976.
19. T. C. Hu, “Parallel sequencing and assembly line problems,” Oper. Res., vol. 9, pp. 841-848, 1961.
20. O. Wing and J. Huang, “A parallel triangulation process of sparse matrices,” in Proc. 1977 Int. Conf. Parallel Processing, Aug. 1977, pp. 207-214.