메뉴 건너뛰기




Volumn 27, Issue 10, 2001, Pages 1365-1379

Parallel approximate factorization method for solving discrete elliptic equations

Author keywords

Approximate factorization; Discrete elliptic problem; Parallel computations; Preconditioned conjugate gradient method

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; COMPUTER SYSTEMS PROGRAMMING; DATA STORAGE EQUIPMENT; ITERATIVE METHODS;

EID: 0035452107     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(01)00092-8     Document Type: Article
Times cited : (11)

References (24)
  • 1
    • 0001160426 scopus 로고
    • A generalized SSOR method
    • (1972) BIT , vol.13 , pp. 443-467
    • Axelsson, O.1
  • 4
    • 0000674152 scopus 로고
    • On parallelism and convergence of incomplete LU factorizations
    • (1991) Appl. Numer. Math. , vol.7 , Issue.5 , pp. 417-436
    • Doi, S.1
  • 10
    • 0003039594 scopus 로고
    • A class of first order factorization methods
    • (1978) BIT , vol.18 , pp. 142-156
    • Gustafsson, I.1


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