MKL
Intel® Math Kernel Library (Intel® MKL) 11.0 includes a wealth of routines to accelerate application performance and reduce development time. Today’s processors have increasing core counts, wider vector units and more varied architectures. The easiest way to take advantage of all of that processing power is to use a carefully optimized computing math library designed to harness that potential. Even the best compiler can’t compete with the level of performance possible from a hand-optimized library. Because Intel has done the engineering on these ready-to-use, royalty-free functions, you’ll not only have more time to develop new features for your application, but in the long run you’ll also save development, debug and maintenance time while knowing that the code you write today will run optimally on future generations of Intel processors. Intel® MKL includes highly vectorized and threaded Linear Algebra, Fast Fourier Transforms (FFT), Vector Math and Statistics functions. Through a single C or Fortran API call, these functions automatically scale across previous, current and future processor architectures by selecting the best code path for each.
Keywords for this software
References in zbMATH (referenced in 137 articles )
Showing results 1 to 20 of 137.
Sorted by year (- Curtin, Ryan R.; Edel, Marcus; Prabhu, Rahul Ganesh; Basak, Suryoday; Lou, Zhihao; Sanderson, Conrad: The ensmallen library for flexible numerical optimization (2021)
- Duan, Wenyang; Meng, Feiteng; Chen, Jikang: PTEBEM for wave drift forces based on hydrodynamic pressure integration (2021)
- Garstka, Michael; Cannon, Mark; Goulart, Paul: COSMO: a conic operator splitting method for convex conic problems (2021)
- Gradusov, Vitaly A.; Roudnev, Vladimir A.; Yarevsky, Evgeny A.; Yakovlev, Sergey L.: Solving the Faddeev-Merkuriev equations in total orbital momentum representation via spline collocation and tensor product preconditioning (2021)
- Hédin, Florent; Pichot, Géraldine; Ern, Alexandre: A hybrid high-order method for flow simulations in discrete fracture networks (2021)
- Hrga, Timotej; Lužar, Borut; Povh, Janez; Wiegele, Angelika: BiqBin: moving boundaries for NP-hard problems by HPC (2021)
- Huo, Zenan; Mei, Gang; Xu, Nengxiong: JuSFEM: a Julia-based open-source package of parallel smoothed finite element method (S-FEM) for elastic problems (2021)
- Jason Rumengan, Terry Yue Zhuo, Conrad Sanderson: PyArmadillo: a streamlined linear algebra library for Python (2021) arXiv
- Kačala, Viliam; Török, Csaba: Speedup of tridiagonal system solvers (2021)
- Lange, Nils; Hütter, Geralf; Kiefer, Björn: An efficient monolithic solution scheme for FE(^2) problems (2021)
- Lee, Chaemin; Kim, San; Lee, Phill-Seung: The strain-smoothed 4-node quadrilateral finite element (2021)
- Steel, Thijs; Camps, Daan; Meerbergen, Karl; Vandebril, Raf: A multishift, multipole rational QZ method with aggressive early deflation (2021)
- Xiao, Chuanfu; Yang, Chao; Li, Min: Efficient alternating least squares algorithms for low multilinear rank approximation of tensors (2021)
- Zdunek, Adam: Tests with FALKSOL. A massively parallel multi-level domain decomposing direct solver (2021)
- Ahrens, Peter; Demmel, James; Nguyen, Hong Diep: Algorithms for efficient reproducible floating point summation (2020)
- Carcenac, Manuel; Redif, Soydan: Application of the sequential matrix diagonalization algorithm to high-dimensional functional MRI data (2020)
- Cinal, M.: Highly accurate numerical solution of Hartree-Fock equation with pseudospectral method for closed-shell atoms (2020)
- Çuğu, İlke; Manguoğlu, Murat: A parallel multithreaded sparse triangular linear system solver (2020)
- Frison, Gianluca; Sartor, Tommaso; Zanelli, Andrea; Diehl, Moritz: The BLAS API of BLASFEO: optimizing performance for small matrices (2020)
- Il’in, V. P.; Kazantcev, G. Y.: Iterative solution of saddle-point systems of linear equations (2020)