Sparse Matrix implementation, that map over Eigen.
More...
template<typename T, typename id_t>
class SparseMatrix< T, id_t, PETSC_BASE >
Sparse Matrix implementation, that map over Eigen.
- Template Parameters
-
T | Type of the sparse Matrix store on each row,colums |
id_t | type of id |
impl | implementation |
Definition at line 96 of file SparseMatrix_petsc.hpp.
#include <SparseMatrix_petsc.hpp>
template<typename T , typename id_t >
template<typename T , typename id_t >
template<typename T , typename id_t >
template<typename T , typename id_t >
const Mat& SparseMatrix< T, id_t, PETSC_BASE >::getMat |
( |
| ) |
const |
|
inline |
template<typename T , typename id_t >
template<typename T , typename id_t >
template<typename T , typename id_t >
T SparseMatrix< T, id_t, PETSC_BASE >::getValue |
( |
size_t |
r, |
|
|
size_t |
c |
|
) |
| |
|
inline |
Get the value from triplet.
- Warning
- It is extremly slow because it do a full search across the triplets elements
- Parameters
-
Definition at line 345 of file SparseMatrix_petsc.hpp.
template<typename T , typename id_t >
T SparseMatrix< T, id_t, PETSC_BASE >::operator() |
( |
id_t |
i, |
|
|
id_t |
j |
|
) |
| |
|
inline |
Get the row i and the colum j of the Matrix.
- Warning
- it is slow, consider to get blocks of the matrix
- Returns
- the value of the matrix at row i colum j
Definition at line 328 of file SparseMatrix_petsc.hpp.
template<typename T , typename id_t >
void SparseMatrix< T, id_t, PETSC_BASE >::resize |
( |
size_t |
row, |
|
|
size_t |
col, |
|
|
size_t |
l_row, |
|
|
size_t |
l_col |
|
) |
| |
|
inline |
Resize the Sparse Matrix.
- Parameters
-
row | number for row |
col | number of colums |
local | number of row |
local | number of colums |
Definition at line 298 of file SparseMatrix_petsc.hpp.
The documentation for this class was generated from the following file: