LinearAlgebra::DecomposeLU< T > Class Template Reference

LU decomposition with partial pivoting. More...

#include <DecomposeLU.hpp>

Public Member Functions
	DecomposeLU (const VectorMatrix< T > &m)
	DecomposeLU (VectorMatrix< T > &&m)
T	det () const
	Determinant matrix A Computed as: det(A) = det(P) * product(diag(U))
VectorMatrix< T >	inv () const
const std::vector< std::vector< T > > &	getU () const
const std::vector< std::vector< T > > &	getL () const
const std::vector< int > &	getP () const

Detailed Description

template<typename T>
class LinearAlgebra::DecomposeLU< T >

LU decomposition with partial pivoting.

Decompose matrix A such that: PA = LU

Where: P is permutation matrix L is lower triangular with unit diagonal U is upper triangular

Constructor & Destructor Documentation

DecomposeLU() [1/2]

template<typename T >

LinearAlgebra::DecomposeLU< T >::DecomposeLU ( const VectorMatrix< T > &  m )

inline

DecomposeLU() [2/2]

template<typename T >

LinearAlgebra::DecomposeLU< T >::DecomposeLU ( VectorMatrix< T > &&  m )

inline

Member Function Documentation

det()

template<typename T >

T LinearAlgebra::DecomposeLU< T >::det

(

)

const

Determinant matrix A Computed as: det(A) = det(P) * product(diag(U))

getL()

template<typename T >

const std::vector< std::vector< T > > & LinearAlgebra::DecomposeLU< T >::getL ( ) const

inline

getP()

template<typename T >

const std::vector< int > & LinearAlgebra::DecomposeLU< T >::getP ( ) const

inline

getU()

template<typename T >

const std::vector< std::vector< T > > & LinearAlgebra::DecomposeLU< T >::getU ( ) const

inline

inv()

template<typename T >

VectorMatrix< T > LinearAlgebra::DecomposeLU< T >::inv

(

)

const

---

The documentation for this class was generated from the following file:

• /home/runner/work/linear-library/linear-library/include/linear-algebra/LU/DecomposeLU.hpp