Difference between revisions of "LU Decomposition"
From NaplesPU Documentation
(→Summary) |
|||
| Line 3: | Line 3: | ||
LU Decomposition is an example of how to use Nu+ features to optimize an algorithm, using multithreaded and vectorial code. | LU Decomposition is an example of how to use Nu+ features to optimize an algorithm, using multithreaded and vectorial code. | ||
| − | Reusable code decomposition and multithreaded and vectorial methods | + | Reusable code decomposition and multithreaded and vectorial optimization methods are shown; they can be applied to every other parallelizable algorithm, from image processing to machine learning ones. |
= Algorithm Description = | = Algorithm Description = | ||
Revision as of 18:54, 1 February 2018
Summary
LU Decomposition is an example of how to use Nu+ features to optimize an algorithm, using multithreaded and vectorial code.
Reusable code decomposition and multithreaded and vectorial optimization methods are shown; they can be applied to every other parallelizable algorithm, from image processing to machine learning ones.
