template<class T > | |
void | bitpit::linearalgebra::transpose (std::vector< std::vector< T > > &, std::vector< std::vector< T > > &) |
template<class T , size_t m, size_t n> | |
void | bitpit::linearalgebra::transpose (std::array< std::array< T, n >, m > &, std::array< std::array< T, m >, n > &) |
template<class T > | |
std::vector< std::vector< T > > | bitpit::linearalgebra::transpose (const std::vector< std::vector< T > > &) |
template<class T , size_t m, size_t n> | |
std::array< std::array< T, m >, n > | bitpit::linearalgebra::transpose (const std::array< std::array< T, n >, m > &) |
template<class T > | |
void | bitpit::linearalgebra::triL (std::vector< std::vector< T > > &, std::vector< std::vector< T > > &) |
template<class T , size_t m, size_t n> | |
void | bitpit::linearalgebra::triL (std::array< std::array< T, n >, m > &, std::array< std::array< T, n >, m > &) |
template<class T > | |
void | bitpit::linearalgebra::triU (std::vector< std::vector< T > > &, std::vector< std::vector< T > > &) |
template<class T , size_t m, size_t n> | |
void | bitpit::linearalgebra::triU (std::array< std::array< T, n >, m > &, std::array< std::array< T, n >, m > &) |
std::array< std::array< T, m >, n > bitpit::linearalgebra::transpose | ( | const std::array< std::array< T, n >, m > & | A | ) |
Given an input matrix, compute its transpose. Overloading of transpose() function for container array.
[in] | A | input matrix |
Definition at line 177 of file manipulation.tpp.
std::vector< std::vector< T > > bitpit::linearalgebra::transpose | ( | const std::vector< std::vector< T > > & | A | ) |
Given an input matrix, compute its transpose. Overloading of transpose() function.
[in] | A | input matrix |
Definition at line 133 of file manipulation.tpp.
void bitpit::linearalgebra::transpose | ( | std::array< std::array< T, n >, m > & | A, |
std::array< std::array< T, m >, n > & | B ) |
Given an input matrix, compute its transpose. Overloading of transpose() function for container array.
[in] | A | input matrix |
[in,out] | B | transpose of A |
Definition at line 92 of file manipulation.tpp.
void bitpit::linearalgebra::transpose | ( | std::vector< std::vector< T > > & | A, |
std::vector< std::vector< T > > & | B ) |
Given an input matrix, compute its transpose.
[in] | A | input matrix |
[in,out] | B | transpose of A |
Definition at line 41 of file manipulation.tpp.
void bitpit::linearalgebra::triL | ( | std::array< std::array< T, n >, m > & | A, |
std::array< std::array< T, n >, m > & | L ) |
Extract the lower triangular part of a matrix. Overloading of triL() function for container array.
[in] | A | input matrix |
[in,out] | L | lower triangular part of A |
Definition at line 261 of file manipulation.tpp.
void bitpit::linearalgebra::triL | ( | std::vector< std::vector< T > > & | A, |
std::vector< std::vector< T > > & | L ) |
Extract the lower triangular part of a matrix.
[in] | A | input matrix |
[in,out] | L | lower triangular part of A |
Definition at line 213 of file manipulation.tpp.
void bitpit::linearalgebra::triU | ( | std::array< std::array< T, n >, m > & | A, |
std::array< std::array< T, n >, m > & | U ) |
Extract the upper triangular part of a matrix. Overloading of triU() function for container array.
[in] | A | input matrix |
[in,out] | U | upper triangular part of A |
Definition at line 352 of file manipulation.tpp.
void bitpit::linearalgebra::triU | ( | std::vector< std::vector< T > > & | A, |
std::vector< std::vector< T > > & | U ) |
Extract the upper triangular part of a matrix.
[in] | A | input matrix |
[in,out] | U | upper triangular part of A |
Definition at line 305 of file manipulation.tpp.