Skip to main content
OSTI.GOVU.S. Department of Energy Office of Scientific and Technical Information
U.S. Department of Energy
Office of Scientific and Technical Information
 

Solution of sparse positive definite systems on a shared-memory multiprocessor

Journal Article · · Int. J. Parallel Program.; (United States)
DOI:https://doi.org/10.1007/BF01407878· OSTI ID:5233207
; ; ;

Algorithms and software for solving sparse symmetric positive definite systems on serial computers have reached a high state of development. In this paper, they present algorithms for performing sparse Cholesky factorization and sparse triangular solutions on a shared-memory multiprocessor computer, along with some numerical experiments demonstrating their performance on a Sequent Balance 8000 system.

Research Organization:
Oak Ridge National Lab., TN (USA)
DOE Contract Number:
AC05-84OR21400
OSTI ID:
5233207
Journal Information:
Int. J. Parallel Program.; (United States), Journal Name: Int. J. Parallel Program.; (United States) Vol. 15:4; ISSN IJPPE
Country of Publication:
United States
Language:
English

Similar Records

Solution of sparse positive definite systems on a shared-memory multiprocessor
Technical Report · Wed Dec 31 23:00:00 EST 1986 · OSTI ID:6842453
A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
Technical Report · Sun Mar 31 23:00:00 EST 1991 · OSTI ID:5896533
Parallel sparse Cholesky factorization algorithms for shared-memory multiprocessor systems
Conference · Wed Jul 01 00:00:00 EDT 1992 · OSTI ID:10159845

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
COMPARATIVE EVALUATIONS
COMPUTER ARCHITECTURE
COMPUTER CODES
DATA PROCESSING
EXECUTIVE CODES
FACTORIZATION
FINITE ELEMENT METHOD
FORTRAN
IMPLEMENTATION
MATHEMATICAL LOGIC
MEMORY DEVICES
NUMERICAL SOLUTION
PARALLEL PROCESSING
PERFORMANCE
PERFORMANCE TESTING
PROCESSING
PROGRAMMING
PROGRAMMING LANGUAGES
S CODES
TASK SCHEDULING
TESTING