Analysis and comparison of two general sparse solvers for distributed memory computers

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Patrick R. Amestoy ENSEEIHT-IRIT
Iain S. Duff CERFACS and Rutherford Appleton Laboratoy
Jean-Yves L'excellent ENSEEIHT-IRIT and LIP-ENS Lyon
Xiaoye S. Li NERSC-Lawrence Berkeley National Laboratory
Analysis and comparison of two general sparse solvers for distributed memory computers Published by ACM 2001 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 58
· Downloads (cumulative): 790
· Citation Count: 13

Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 27 Issue 4, December 2001
Pages 388-421
ACM New York, NY, USA
table of contents doi>10.1145/504210.504212

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder