NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login

Press Enter or click the Search button to begin your search.

Back to Results
Parallel Sparse Cholesky Factorization with Spectral Nested Dissection OrderingWe show that the use of a new ordering computed from the spectral nested dissection (SND) algorithm leads to efficient parallel sparse Cholesky factorization on an Intel Paragon multiprocessor.
Document ID
20010121538
Acquisition Source
Ames Research Center
Document Type
Abstract
Authors
Pothen, Alex (Old Dominion Univ. Norfolk, VA United States)
Rothberg, Edward (INTEL Corp. United States)
Simon, Horst (Computer Sciences Corp. United States)
Wang, Lie (Pennsylvania State Univ. University Park, PA United States)
Cooper, D. M.
Date Acquired
August 20, 2013
Publication Date
January 1, 1994
Subject Category
Computer Programming And Software
Meeting Information
Meeting: 5th SIAM Conference on Applied Linear Algebra
Location: Snowbird, UT
Country: United States
Start Date: June 15, 1994
End Date: June 18, 1994
Sponsors: Society for Industrial and Applied Mathematics
Funding Number(s)
PROJECT: RTOP 536-01-11
CONTRACT_GRANT: NAS2-12961
CONTRACT_GRANT: NSERC-OGP-0008111
CONTRACT_GRANT: NSF CCR-90-24954
CONTRACT_GRANT: DE-FG02-91ER-25095
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Available Downloads

There are no available downloads for this record.

Related Records

There are no records associated with this record.
No Preview Available