메뉴 건너뛰기




Volumn , Issue , 2009, Pages

Optimization of the FIND algorithm to compute the inverse of a sparse matrix

Author keywords

[No Author keywords available]

Indexed keywords

BEST-KNOWN ALGORITHMS; CONSTANT FACTORS; FAST ALGORITHMS; NANO-DEVICES; QUANTUM TRANSPORT; REAL APPLICATIONS; RUNNING TIME; SPARSE MATRICES;

EID: 70350230310     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWCE.2009.5091136     Document Type: Conference Paper
Times cited : (3)

References (6)
  • 1
    • 17044409756 scopus 로고    scopus 로고
    • Calculating transport properties of nanodevices
    • Philadelphia, PA
    • E. Darve, S. Li, and Y. Teslyar. Calculating transport properties of nanodevices. In Proceedings of SPIE, Philadelphia, PA, volume 5593, pages 452-463, 2004.
    • (2004) Proceedings of SPIE , vol.5593 , pp. 452-463
    • Darve, E.1    Li, S.2    Teslyar, Y.3
  • 3
    • 52749085483 scopus 로고    scopus 로고
    • Computing entries of the inverse of a sparse matrix using the FIND algorithm
    • S. Li, S. Ahmed, G. Klimeck, and E. Darve. Computing entries of the inverse of a sparse matrix using the FIND algorithm. Journal of Computational Physics, 227:9408-9427, 2008.
    • (2008) Journal of Computational Physics , vol.227 , pp. 9408-9427
    • Li, S.1    Ahmed, S.2    Klimeck, G.3    Darve, E.4
  • 4
    • 0000264382 scopus 로고
    • Nested dissection of a regular finite-element mesh
    • A. George. Nested dissection of a regular finite-element mesh. SIAM Journal on Numerical Analysis, 10(2):345-63, 1973.
    • (1973) SIAM Journal on Numerical Analysis , vol.10 , Issue.2 , pp. 345-363
    • George, A.1


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