Jacobi-Type Algorithms for LDC and Cholesky Factorization

Abstract It is demonstrated how conventional algorithms for computing the LDU decomposition of a square matrix, or Cholesky factorization for symmetric positive definite matrices, can be reordered into Jacobi-type algorithms. For efficient parallel implementation on a systolic array, the resulting schemes compare favorably with earlier implementations.