Skip to search formSkip to main contentSkip to account menu

BLAS

Known as: AXPY, CGEMM, DGEMM 
Basic Linear Algebra Subprograms (BLAS) is a specification that prescribes a set of low-level routines for performing common linear algebra… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Dense linear algebra has been traditionally used to evaluate the performance and efficiency of new architectures. This trend has… 
Highly Cited
2012
Highly Cited
2012
Transferring quantum states efficiently between distant nodes of an information processing circuit is of paramount importance for… 
Highly Cited
2009
Highly Cited
2009
This paper presents a dynamic task scheduling approach to executing dense linear algebra algorithms on multicore systems (either… 
Highly Cited
2006
Highly Cited
2006
Nearly quantitative agreement between density functional theory DFT and diffusion Monte Carlo DMC calculations is shown for the… 
Highly Cited
2005
Highly Cited
2005
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering… 
Highly Cited
2005
Highly Cited
2005
As processor complexity increases compilers tend to deliver suboptimal performance. Library generators such as ATLAS, FFTW and… 
Review
2002
Review
2002
We discuss the interface design for the Sparse Basic Linear Algebra Subprograms (BLAS), the kernels in the recent standard from… 
Highly Cited
2002
Highly Cited
2002
Triangular matrix equations appear naturally in estimating the condition numbers of matrix equations and different eigenspace… 
Highly Cited
1997
Highly Cited
1997
Although Gaussian elimination with partial pivoting is a robust algorithm to solve unsymmetric sparse linear systems of equations… 
Highly Cited
1984
Highly Cited
1984
This paper examines common implementations of linear algebra algorithms, such as matrix-vector multiplication, matrix-matrix…