Solution of sparse positive definite systems on a shared-memory multiprocessor
Alan D. George, Michael T. Heath, J. Liu, E. Ng · 1987
Algorithms and software for performing sparse Cholesky decomposition and using the Cholesky factors in the solution of sparse symmetric positive definite systems on serial computers have reached a high state of development. In this paper we present algorithms for performing these two phases on a shared-memory multiprocessor computer, along with some numerical experiments demonstrating their performance on a Sequent Balance 8000 system. 10 refs., 3 figs., 7 tabs.