The parallel solution of nonsymmetric sparse linear systems using the H* reordering and an associated factorization

doi:10.1145/181181.181575

**The parallel solution of nonsymmetric sparse linear systems using the H* reordering and an associated factorization**

Full Text:

Pdf

Buy this Article

Authors:	K. A. Gallivan	Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign Urbana, Illinois
	B. A. Marsolf	Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign Urbana, Illinois
	H. A. G. Wijshoff	High Performance Computing Division, Department of Computer Science, Leiden University, Leiden, The Netherlands

Published in:

	· Proceeding
	ICS '94 Proceedings of the 8th international conference on Supercomputing
	ACM New York, NY, USA ©1994 table of contents ISBN:0-89791-665-4 doi>10.1145/181181.181575

	1994 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 11 · Citation Count: 5

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- ICS'12

Tags: algorithms computations on matrices measurement parallel algorithms performance sparse, structured, and very large systems theory

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player