Open AccessAn efficient algorithm to compute row and column counts for sparse Cholesky factorization
Author(s) -
John R. Gilbert,
Esmond Ng,
Barry W. Peyton
Publication year - 1992
Language(s) - English
Resource type - Reports
DOI - 10.2172/7258591
Subject(s) - ackermann function , cholesky decomposition , combinatorics , descendant , mathematics , matrix (chemical analysis) , column (typography) , algorithm , sparse matrix , inverse , factorization , minimum degree algorithm , vertex (graph theory) , discrete mathematics , graph , incomplete cholesky factorization , eigenvalues and eigenvectors , physics , quantum mechanics , geometry , materials science , astronomy , connection (principal bundle) , composite material , gaussian
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom