A parallel formulation of interior point algorithms
Book
·
OSTI ID:87624
- Univ. of Minnesota, Minneapolis, MN (United States). Computer Science Dept.
In this paper the authors describe a scalable parallel formulation of interior point algorithms. Through their implementation on a 256-processor nCUBE 2 parallel computer, their show that their parallel formulation utilizes hundreds of processors efficiently and delivers much higher performance and speedups than reported earlier. These speedups are a result of their highly efficient parallel algorithm for solving a linear symmetric positive definite system using Cholesky factorization. They also evaluate a number of ordering algorithms for sparse matrix factorization in terms of their suitability for parallel Cholesky factorization.
- OSTI ID:
- 87624
- Report Number(s):
- CONF-941118--; ISBN 0-8186-6605-6
- Country of Publication:
- United States
- Language:
- English
Similar Records
A scalable parallel algorithm for sparse Cholesky factorization
Parallel algorithms for matrix computations
Fan-in algorithm for distributed sparse numerical factorization. Research report
Book
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:87680
Parallel algorithms for matrix computations
Book
·
Sun Dec 31 23:00:00 EST 1989
·
OSTI ID:5182211
Fan-in algorithm for distributed sparse numerical factorization. Research report
Technical Report
·
Mon May 15 00:00:00 EDT 1989
·
OSTI ID:5173193