|
template<class M , class X , class Y > |
void | Dune::bltsolve (const M &A, X &v, const Y &d) |
| block lower triangular solve More...
|
|
template<class M , class X , class Y , class K > |
void | Dune::bltsolve (const M &A, X &v, const Y &d, const K &w) |
| relaxed block lower triangular solve More...
|
|
template<class M , class X , class Y > |
void | Dune::ubltsolve (const M &A, X &v, const Y &d) |
| unit block lower triangular solve More...
|
|
template<class M , class X , class Y , class K > |
void | Dune::ubltsolve (const M &A, X &v, const Y &d, const K &w) |
| relaxed unit block lower triangular solve More...
|
|
template<class M , class X , class Y > |
void | Dune::butsolve (const M &A, X &v, const Y &d) |
| block upper triangular solve More...
|
|
template<class M , class X , class Y , class K > |
void | Dune::butsolve (const M &A, X &v, const Y &d, const K &w) |
| relaxed block upper triangular solve More...
|
|
template<class M , class X , class Y > |
void | Dune::ubutsolve (const M &A, X &v, const Y &d) |
| unit block upper triangular solve More...
|
|
template<class M , class X , class Y , class K > |
void | Dune::ubutsolve (const M &A, X &v, const Y &d, const K &w) |
| relaxed unit block upper triangular solve More...
|
|
template<class M , class X , class Y , int l> |
void | Dune::bltsolve (const M &A, X &v, const Y &d, BL< l >) |
| block lower triangular solve More...
|
|
template<class M , class X , class Y , class K , int l> |
void | Dune::bltsolve (const M &A, X &v, const Y &d, const K &w, BL< l >) |
| relaxed block lower triangular solve More...
|
|
template<class M , class X , class Y , int l> |
void | Dune::ubltsolve (const M &A, X &v, const Y &d, BL< l >) |
| unit block lower triangular solve More...
|
|
template<class M , class X , class Y , class K , int l> |
void | Dune::ubltsolve (const M &A, X &v, const Y &d, const K &w, BL< l >) |
| relaxed unit block lower triangular solve More...
|
|
template<class M , class X , class Y , int l> |
void | Dune::butsolve (const M &A, X &v, const Y &d, BL< l > bl) |
| block upper triangular solve More...
|
|
template<class M , class X , class Y , class K , int l> |
void | Dune::butsolve (const M &A, X &v, const Y &d, const K &w, BL< l > bl) |
| relaxed block upper triangular solve More...
|
|
template<class M , class X , class Y , int l> |
void | Dune::ubutsolve (const M &A, X &v, const Y &d, BL< l > bl) |
| unit block upper triangular solve More...
|
|
template<class M , class X , class Y , class K , int l> |
void | Dune::ubutsolve (const M &A, X &v, const Y &d, const K &w, BL< l > bl) |
| relaxed unit block upper triangular solve More...
|
|
template<class M , class X , class Y > |
void | Dune::bdsolve (const M &A, X &v, const Y &d) |
| block diagonal solve, no relaxation More...
|
|
template<class M , class X , class Y , class K > |
void | Dune::bdsolve (const M &A, X &v, const Y &d, const K &w) |
| block diagonal solve, with relaxation More...
|
|
template<class M , class X , class Y , int l> |
void | Dune::bdsolve (const M &A, X &v, const Y &d, BL< l >) |
| block diagonal solve, no relaxation More...
|
|
template<class M , class X , class Y , class K , int l> |
void | Dune::bdsolve (const M &A, X &v, const Y &d, const K &w, BL< l >) |
| block diagonal solve, with relaxation More...
|
|
template<class M , class X , class Y , class K > |
void | Dune::dbgs (const M &A, X &x, const Y &b, const K &w) |
| GS step. More...
|
|
template<class M , class X , class Y , class K , int l> |
void | Dune::dbgs (const M &A, X &x, const Y &b, const K &w, BL< l >) |
| GS step. More...
|
|
template<class M , class X , class Y , class K > |
void | Dune::bsorf (const M &A, X &x, const Y &b, const K &w) |
| SOR step. More...
|
|
template<class M , class X , class Y , class K , int l> |
void | Dune::bsorf (const M &A, X &x, const Y &b, const K &w, BL< l >) |
| SOR step. More...
|
|
template<class M , class X , class Y , class K > |
void | Dune::bsorb (const M &A, X &x, const Y &b, const K &w) |
| SSOR step. More...
|
|
template<class M , class X , class Y , class K , int l> |
void | Dune::bsorb (const M &A, X &x, const Y &b, const K &w, BL< l >) |
| Backward SOR step. More...
|
|
template<class M , class X , class Y , class K > |
void | Dune::dbjac (const M &A, X &x, const Y &b, const K &w) |
| Jacobi step. More...
|
|
template<class M , class X , class Y , class K , int l> |
void | Dune::dbjac (const M &A, X &x, const Y &b, const K &w, BL< l >) |
| Jacobi step. More...
|
|
template<class M > |
void | Dune::bilu0_decomposition (M &A) |
| compute ILU decomposition of A. A is overwritten by its decomposition More...
|
|
template<class M , class X , class Y > |
void | Dune::bilu_backsolve (const M &A, X &v, const Y &d) |
| LU backsolve with stored inverse. More...
|
|
template<class M > |
M::field_type & | Dune::firstmatrixelement (M &A, typename std::enable_if_t<!Dune::IsNumber< M >::value > *sfinae=nullptr) |
|
template<class K > |
K & | Dune::firstmatrixelement (K &A, typename std::enable_if_t< Dune::IsNumber< K >::value > *sfinae=nullptr) |
|
template<class K , int n, int m> |
K & | Dune::firstmatrixelement (FieldMatrix< K, n, m > &A) |
|
template<class M > |
void | Dune::bilu_decomposition (const M &A, int n, M &ILU) |
|
Generic iterative kernels for the solvers which work on the block recursive structure of the matrices and vectors.