z-logo
open-access-imgOpen Access
Reducing elimination tree height for parallel LU factorization of sparse unsymmetric matrices
Author(s) -
Enver Kayaaslan,
Bora Uçar
Publication year - 2014
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - factorization , computer science , tree (set theory) , sparse matrix , matrix decomposition , parallel computing , algorithm , mathematics , combinatorics , physics , computational chemistry , chemistry , eigenvalues and eigenvectors , quantum mechanics , gaussian

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

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom