Difference between revisions of "LU Decomposition"
From NaplesPU Documentation
| Line 1: | Line 1: | ||
| + | __FORCETOC__ | ||
| + | |||
= Summary = | = Summary = | ||
| Line 6: | Line 8: | ||
= Algorithm Description = | = Algorithm Description = | ||
| + | LU Decomposition is used in solving systems of linear equations | ||
| + | |||
| + | [[File:ax=b.png|center|75px]] | ||
| + | |||
| + | Algorithm decomposes A in: | ||
| + | |||
| + | * [[File:U.png|15px]] upper triangolar matrix | ||
| + | * [[File:L.png|15px]] lower triangolar matrix | ||
Revision as of 18:16, 1 February 2018
Contents
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.
Algorithm Description
LU Decomposition is used in solving systems of linear equations
Algorithm decomposes A in:
-
upper triangolar matrix -
lower triangolar matrix
