24
edits
Changes
→Power Point Attached
Level 3: Matrix-matrix operations
There are many different implementations of these subprograms available. These different implementations are created with different purposes or platforms in mind. Intel's oneAPI implementation heavily focuses on performance, specifically with x86 and x64 in mind.
[[File:BLAS.png]]
==== Sparse Linear Algebra Functions ====
Able to perform low-level inspector-executor routines on sparse matrices, such as:
A sparse matrix is matrix that is mostly empty, these are common in machine learning applications. Using standard linear algebra functions would lead to poor performance and would require greater amounts of storage. Specially written sparse linear algebra functions have better performance and can better compress matrices to save space. [[File:Sparse.png]]
==== Fast Fourier Transforms ====
Enabling technology today such as most digital communications, audio compression, image compression, satellite tv, FFT is at the heart of it.
A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT).
[[File:Download.jpg]]
==== Random Number Generator ====
All RNG routines can be categorized in several different categories.
The generation of numbers is done in 2 steps:
Data Fitting routines use the following workflow to process a task:
Data Fitting functions:
==== Summary Statistics ====
Summary Statistics calculate:
Additional Features:
* Compute quantiles for streaming data.
==== Vector Math ====
There are two main set of functions for the Vector Math library that the intel MKL uses they are:
=== Code Samples ===
== Power Point Attached Presentation == Animated GIF of the Presentation [[File:Intel Math Kernel Library.gif]] PDF File:
[File:https://wiki.cdot.senecacollege.ca/w/imgs/Intel_Math_Kernel_Library.pdf]