SLATE 2024.05.31
Software for Linear Algebra Targeting Exascale
|
Inverse, multiply. More...
Functions | |
template<typename scalar_t > | |
void | slate::trtri (TriangularMatrix< scalar_t > &A, Options const &opts) |
Distributed parallel inverse of a triangular matrix. | |
template<typename scalar_t > | |
void | slate::trtrm (TriangularMatrix< scalar_t > &A, Options const &opts) |
Distributed parallel inverse of a triangular matrix. | |
Inverse, multiply.
void slate::trtri | ( | TriangularMatrix< scalar_t > & | A, |
Options const & | opts | ||
) |
Distributed parallel inverse of a triangular matrix.
Computes the inverse of an upper or lower triangular matrix \(A\).
Complexity (in real): \(\approx \frac{1}{3} n^{3}\) flops.
scalar_t | One of float, double, std::complex<float>, std::complex<double>. |
[in,out] | A | On entry, the n-by-n triangular matrix \(A\). On exit, if return value = 0, the (triangular) inverse of the original matrix \(A\). |
[in] | opts | Additional options, as map of name = value pairs. Possible options:
|
TODO: return value
0 | successful exit |
>0 | for return value = \(i\), \(A(i,i)\) is exactly zero. The triangular matrix is singular and its inverse can not be computed. |
void slate::trtrm | ( | TriangularMatrix< scalar_t > & | A, |
Options const & | opts | ||
) |
Distributed parallel inverse of a triangular matrix.
Computes the inverse of an upper or lower triangular matrix \(A\).
scalar_t | One of float, double, std::complex<float>, std::complex<double>. |
[in,out] | A | On entry, the n-by-n triangular matrix \(A\). On exit, if return value = 0, the (triangular) inverse of the original matrix \(A\). |
[in] | opts | Additional options, as map of name = value pairs. Possible options:
|
TODO: return value
0 | successful exit |