z-logo
open-access-imgOpen Access
Block sparse Cholesky algorithms on advanced uniprocessor computers
Author(s) -
Esmond Ng,
Barry W. Peyton
Publication year - 1991
Language(s) - Uncategorized
Resource type - Reports
DOI - 10.2172/10104379
Subject(s) - cholesky decomposition , uniprocessor system , computer science , incomplete cholesky factorization , minimum degree algorithm , block (permutation group theory) , factorization , sparse matrix , algorithm , parallel computing , theoretical computer science , mathematics , eigenvalues and eigenvectors , quantum mechanics , multiprocessing , gaussian , physics , geometry

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