Now showing items 1-3 of 3

    • A Parallel Algorithm for Finding Fill in a Sparse Symmetric Matrix 

      Gilbert, John R.; Hafsteinsson, Hjalmtyr (Cornell University, 1986-10)
      We describe a parallel algorithm for finding the fill that occurs when a sparse symmetric positive definite matrix A is factored into its Cholesky factor L. The algorithm is in two steps: First we determine the elimination ...
    • Parallel Cholesky Factorization of Sparse Matrices 

      Gilbert, John R.; Hafsteinsson, Hjalmtyr (Cornell University, 1987-12)
      We describe a parallel algorithm for finding the Cholesky factorization of a sparse symmetric positive definite matrix A. The algorithm runs in $O(h \log n)$ time with $m\*$ processors, where $h$ is the height of A's ...
    • Parallel Sparse Cholesky Factorization 

      Hafsteinsson, Hjalmtyr (Cornell University, 1988-09)
      As sequential computers seem to be approaching their limits in CPU speed there is increasing interest in parallel computers. This development calls for parallel algorithms for problems that may already have efficient ...