Show simple item record

dc.contributor.authorSun, Chunguangen_US
dc.description.abstractWe consider several issues involved in the solution of sparse symmetric positive definite system by multifrontal method on distributed-memory multiprocessors. First, we present a new algorithm for computing the partial factorization of a frontal matrix on a subset of processors which significantly improves the performance of a distributed multifrontal algorithm previously designed. Second, new parallel algorithms for computing sparse forward elimination and sparse backward substitution are described. The new algorithms solve the sparse triangular systems in multi- frontal fashion. Numerical experiments run on an Intel iPSC/860 and an Intel iPSC/2 for a set of problems with regular and irregular sparsity structure are reported. More than 180 million flops per second during the numerical factorization are achieved for a three- dimensional grid problem on an iPSC/860 machine with 32 processors.en_US
dc.format.extent233287 bytes
dc.format.extent220962 bytes
dc.publisherCornell Universityen_US
dc.subjecttheory centeren_US
dc.titleEfficient Parallel Solutions of Large Sparse SPD Systems on Distributed-memory Multiprocessorsen_US
dc.typetechnical reporten_US

Files in this item


This item appears in the following Collection(s)

Show simple item record