SIGN IN
SIGN UP
The science of deriving dense linear algebra algorithms
Full Text:
PDF
Buy this Article
Authors:
Paolo Bientinesi
The University of Texas at Austin, Austin, TX
John A. Gunnels
IBM T.J. Watson Research Center, Yorktown Heights, NY
Margaret E. Myers
The University of Texas at Austin, Austin, TX
Enrique S. Quintana-Ortí
Universidad Jaume I, Spain
Robert A. van de Geijn
The University of Texas at Austin, Austin, TX
2005 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 56
· Downloads (cumulative): 819
· Citation Count: 35
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 31 Issue 1, March 2005
Pages 1-26
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1055531.1055532
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithm design and analysis
algorithms
design
domain-specific architectures
efficiency
formal derivation
high-performance computing
libraries
linear algebra
performance
software libraries
theory
user interfaces
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder