Optimizing Tpetra%3CU%2B2019%3Es sparse matrix-matrix multiplication routine. | Zendy

Kurtis Nusbaum | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Optimizing Tpetra%3CU%2B2019%3Es sparse matrix-matrix multiplication routine.

Author(s) -

Kurtis Nusbaum

Publication year - 2011

Publication title -

osti oai (u.s. department of energy office of scientific and technical information)

Language(s) - English

Resource type - Reports

DOI - 10.2172/1029781

Subject(s) - matrix multiplication , sparse matrix , multiplication (music) , matrix (chemical analysis) , computer science , state (computer science) , algorithm , parallel computing , arithmetic , mathematics , physics , materials science , combinatorics , quantum mechanics , composite material , quantum , gaussian

Over the course of the last year, a sparse matrix-matrix multiplication routine has been developed for the Tpetra package. This routine is based on the same algorithm that is used in EpetraExt with heavy modifications. Since it achieved a working state, several major optimizations have been made in an effort to speed up the routine. This report will discuss the optimizations made to the routine, its current state, and where future work needs to be done

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research