Home»Documentation»Vector and Matrix Library User's Guide»Matrix Decompositions

## Matrix Decompositions | Extreme Optimization Numerical Libraries for .NET Professional |

A matrix decomposition or factorization is a representation of a matrix as a product of two or more matrices. Decomposing a matrix is often the first step in the solution of a problem in linear algebra. The matrices in the decomposition usually have some special properties, which can be used to simplify the solution. A decomposition is often called a factorization. The two words are synonyms.

The **Extreme Optimization Numerical Libraries for .NET** contains a series of classes that implement a
number of standard decompositions. These classes are contained in the Extreme.Mathematics.LinearAlgebra namespace.

In this section:

- The LU Decomposition
- The QR Decomposition
- The Cholesky Decomposition
- The Symmetric Indefinite Decomposition
- The Eigenvalue Decomposition
- The Generalized Eigenvalue Decomposition
- The Singular Value Decomposition
- The Generalized Singular Value Decomposition
- Non-Negative Matrix Factorization
- Solving Linear Systems

Copyright Â© 2004-2023,
Extreme Optimization. All rights reserved.

*Extreme Optimization,* *Complexity made simple*, *M#*, and *M
Sharp* are trademarks of ExoAnalytics Inc.

*Microsoft*, *Visual C#, Visual Basic, Visual Studio*, *Visual
Studio.NET*, and the *Optimized for Visual Studio* logo

are
registered trademarks of Microsoft Corporation.