A Comparison of Three Column-Based Distributed Sparse Factorization Schemes.

Abstract

The solution of large sparse systems of linear is an important application of parallel computers. In this paper, we give a unified presentation and compare the performance of three distributed schemes to compute the Cholesky factor of a large sparse symmetric positive definite matrix on a local-memory parallel processor. (kr)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1990
Accession Number
ADA228143

Entities

People

  • Andrew H. Sherman
  • Cleve Ashcraft
  • Joseph W. Liu
  • Stanley C. Eisenstat

Organizations

  • Yale University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Science
  • Computers
  • Efficiency
  • Electrical Engineering
  • Elimination
  • Engineering
  • Equations
  • Floating Point Operations
  • Linear Systems
  • Network Topology
  • Parallel Processors
  • Separators
  • Sparse Matrix
  • Universities

Fields of Study

  • Computer science

Readers

  • Linear Algebra
  • Parallel and Distributed Computing.