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 121 articles )
Showing results 1 to 20 of 121.
Sorted by year (- 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)
- Kačala, Viliam; Török, Csaba: Speedup of tridiagonal system solvers (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)
- Katharina Boguslawski, Aleksandra Leszczyk, Artur Nowak, Filip Brzęk, Piotr Szymon Żuchowski, Dariusz Kędziera, Paweł Tecmer: Pythonic Black-box Electronic Structure Tool (PyBEST). An open-source Python platform for electronic structure calculations at the interface between chemistry and physics (2020) arXiv
- Khimich, O. M.; Popov, O. V.; Chistyakov, O. V.; Sidoruk, V. A.: A parallel algorithm for solving a partial eigenvalue problem for block-diagonal bordered matrices (2020)
- Miao, Zhuqi; Balasundaram, Balabhaskar: An ellipsoidal bounding scheme for the quasi-clique number of a graph (2020)
- Phalippou, P.; Bouabdallah, S.; Breitkopf, P.; Villon, P.; Zarroug, M.: `On-the-fly’ snapshots selection for proper orthogonal decomposition with application to nonlinear dynamics (2020)
- Sashikumaar Ganesan, Manan Shah: SParSH-AMG: A library for hybrid CPU-GPU algebraic multigrid and preconditioned iterative methods (2020) arXiv
- Van Zee, Field G.: Implementing high-performance complex matrix multiplication via the 1M method (2020)
- Yeung, Yu-Hong; Pothen, Alex; Crouch, Jessica: AMPS: Real-time mesh cutting with augmented matrices for surgical simulations. (2020)
- Bylina, Beata; Bylina, Jarosław: The parallel tiled WZ factorization algorithm for multicore architectures (2019)
- Cho, Haeseong; Gong, DuHyun; Lee, Namhun; Shin, SangJoon; Lee, Seungsoo: Combined co-rotational beam/shell elements for fluid-structure interaction analysis of insect-like flapping wing (2019)
- Gebhardt, Cristian Guillermo; Hofmeister, Benedikt; Hente, Christian; Rolfes, Raimund: Nonlinear dynamics of slender structures: a new object-oriented framework (2019)
- Grigori, Laura; Tissot, Olivier: Scalable linear solvers based on enlarged Krylov subspaces with dynamic reduction of search directions (2019)