An overview on the sparse linear algebra component (including BLAS functions, direct solvers, iterative solvers, and eigensolvers for sparse matrices) based on the FEAST algorithm.
Improve operations on a single CPU core with minimal effort for small data sets. Efficiently solve large-scale sparse linear systems with tens of millions of equations on clusters.
Get routines to help you resolve various numerical problems, such as multiplying matrices, solving a system of equations, and computations involving fast Fourier transforms (FFT). While many problems do not have dedicated routines, you can solve them by assembling the building blocks in these recipes: