Back to Results
First PageMeta Content
Numerical linear algebra / Matrix theory / Matrices / Sparse matrices / LU decomposition / Invertible matrix / Matrix / Triangular matrix / Tridiagonal matrix / Algebra / Linear algebra / Mathematics


Fast Methods for Computing Selected Elements of the Green’s Function in Massively Parallel Nanoelectronic Device Simulations Andrey Kuzmin1 , Mathieu Luisier2 , and Olaf Schenk1 1
Add to Reading List

Document Date: 2013-11-02 10:57:36


Open Document

File Size: 439,95 KB

Share Result on Facebook

City

Lugano / /

Company

IBM / Lg / AMD / The times / Integrated Systems Laboratory / /

Country

Switzerland / /

/

Facility

Institute of Computational Science / Argonne Leadership Computing Facility / Selinv3 library / Swiss National Supercomputing Center / /

IndustryTerm

selected inversion algorithm / logic devices / parallel efficient software / sparse matrix matrix products / energy point / implement efficient scalable algorithms / factorization algorithm / http /

OperatingSystem

DOS / Fermi / /

Organization

Institute of Computational Science / Swiss National Supercomputing Center / /

Person

Gordon Bell / Monte Rosa / /

Technology

matrix M. The algorithm / inversion algorithm / direct factorization algorithm / 2.2 RGF Algorithm / RAM / selected inversion algorithm / PowerPC processor / efficient BLAS level3 algorithm / nested dissection algorithm / http / serial inversion algorithm / simulation / efficient RGF algorithm / supernodal BLAS level-3 algorithm / LU factorization algorithm / RGF algorithm / 6272 2.1-GHz Interlagos processors / /

URL

www.iis.ee.ethz.ch / http /

SocialTag