.png){kind=icon}
返回
Self-adapting linear algebra algorithms and software
.png){kind=icon}
OA
AI
DOI：10.1109/JPROC.2004.840848.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
One of the main obstacles to the efficient solution of scientific problems is the problem of tuning software, both to the available architecture and to the user problem at hand. We describe approaches for-obtaining tuned high-performance kernals and for automatically choosing suitable algorithms. Specifically we describe the generation of dense and sparse Basic Linear Algebra Subprograms (BLAS) kernels, and the selection of linear solver algorithms. However the ideas presented here extend beyond these areas, which can be considered proof of concept.
Keyword:
adaptive methods
Basic Linear Algebra Subprograms (BLAS)
dense kernels
iterative methods
linear systems
matrix-matrix product
matrix-vector product
performance optimization
preconditioners
sparse kernels
期刊
IF:
25.9
论文数:
9.9K
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容