Partitioning sparse rectangular matrices for parallel computations of Ax and A T v-Reference-Cited by-同舟云学术

Partitioning sparse rectangular matrices for parallel computations of Ax and A T v

Published:1998 Issue: Volume: Page:239-247
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Hendrickson Bruce,Kolda Tamara G.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0095342

Reference15 articles.

1. Stephen T. Barnard and Horst D. Simon. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience, 6:101–117, 1994.

2. Michael W. Berry, Bruce Hendrickson, and Padma Raghavan. Sparse matrix reordering schemes for browsing hypertext. In James Renegar, Michael Shub, and Steve Smale, editors, The Mathematics of Numerical Analysis, volume 32 of Lectures in Applied Mathematics, pages 99–122. American Mathematical Society, 1996.

3. Roland W. Freund and Noël M. Nachtigal. QMR: A quasi-minimal residual method for non-Hermitian linear systems. Numer. Math., 60:315–339, 1991.

4. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.

5. Technical Report TR-PA-93-50;M. Hegland,1993

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Survey of graph partitioning algorithms;Keldysh Institute Preprints;2020

2. Graph partitioning models for parallel computing;Parallel Computing;2000-11

3. Partitioning sparse rectangular matrices for parallel processing;Solving Irregularly Structured Problems in Parallel;1998