메뉴 건너뛰기




Volumn 54, Issue 1, 1995, Pages 39-67

A locally optimized reordering algorithm and its application to a parallel sparse linear system solver

Author keywords

AMS Subject Classifications: 65F05, 65Y05; binary tree; block algorithm; coarse grain parallelism; drop tolerance; Gaussian elimination; general sparsity; re ordering; Sparse matrix; speed up

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; BLOCK CODES; LINEAR ALGEBRA; MATRIX ALGEBRA; OPTIMIZATION; PERFORMANCE;

EID: 0029209175     PISSN: 0010485X     EISSN: 14365057     Source Type: Journal    
DOI: 10.1007/BF02238079     Document Type: Article
Times cited : (13)

References (28)
  • 3
    • 84936517213 scopus 로고    scopus 로고
    • Alvarado, F. L., Pothen, A., Schreiber, R.: Highly parallel sparse triangular solution. Report No. CS-92-09, Department of Computer Science, The Pennsylvania State University, 1992.
  • 20
    • 84936517209 scopus 로고    scopus 로고
    • Gilbert, J. R.: An efficient parallel sparse partial pivoting algorithm. Report No. 88/45052-1. Chr. Michelsen Institute, Department of Science and Technology, Centre for Computer Science, Fantoftvegen 38, N-5036 Fantoft, Bergen, Norwary, 1988.
  • 25
    • 84936517218 scopus 로고    scopus 로고
    • Vinsome, P. K. W.: Orthomin, an iterative method for solving sparse sets of simultaneous linear equations. In: Proceedings of the fourth symposium on reservoir simulation, pp. 140–159. Society of Petroleum Engineers of AIME, 1976.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.