Discontinuous Galerkin Library
#include "dg/algorithm.h"
|
Fast (shared memory) tridiagonal sparse matrix. More...
Public Types | |
using | value_type = dg::get_value_type< Container > |
Public Member Functions | |
TriDiagonal ()=default | |
TriDiagonal (unsigned size) | |
TriDiagonal (Container M, Container O, Container P) | |
template<class Container2 > | |
TriDiagonal (const TriDiagonal< Container2 > &other) | |
unsigned | size () const |
void | operator() (const Container &x, Container &y) const |
dg::IHMatrix_t< value_type > | asIMatrix () const |
convert to a sparse matrix format More... | |
Public Attributes | |
Container | M |
Container | O |
Container | P |
Fast (shared memory) tridiagonal sparse matrix.
Consists of the three diagonal vectors [M, O, P] (for "Minus", "ZerO", "Plus), i.e. M is the subdiagonal, O the diagonal and P the superdiagonal vector.
dg::blas2::parallel_for
(which only works on shared memory vectors though) Container | One of the shared memory containers |
using dg::TriDiagonal< Container >::value_type = dg::get_value_type<Container> |
|
default |
|
inline |
|
inline |
|
inline |
|
inline |
convert to a sparse matrix format
|
inline |
|
inline |
Container dg::TriDiagonal< Container >::M |
Container dg::TriDiagonal< Container >::O |
Container dg::TriDiagonal< Container >::P |