메뉴 건너뛰기




Volumn 22, Issue 6, 2001, Pages 1962-1973

Exact prediction of QR fill-in by row-merge trees

Author keywords

Elimination trees; QR factorization; Row merge trees

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; VECTORS;

EID: 0035683165     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827599333965     Document Type: Article
Times cited : (4)

References (22)
  • 14
    • 0026840122 scopus 로고
    • The multifrontal method for sparse matrix solution: Theory and practice
    • (1992) SIAM Rev. , vol.34 , pp. 82-109
    • Liu, J.W.H.1
  • 16
    • 0032340220 scopus 로고    scopus 로고
    • A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form
    • (1998) Math. Comp. , vol.67 , pp. 221-235
    • Oliveira, S.1
  • 17
    • 85160636288 scopus 로고    scopus 로고
    • Reprocessing a postprocessed elimination tree to obtain exact sparsity prediction in QR factorization
    • Tech. report TR-127, The University of Iowa, Iowa City, IA
    • (1999)
    • Oliveira, S.1


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