linbox
|
Sparse Matrix in Triples storage. More...
#include <sparse-tpl-matrix.h>
Inherits BlackboxInterface.
Public Member Functions | |
std::ostream & | write (std::ostream &out) const |
void | finalize (sortPolicy s=cacheOpt) |
Establish triples order. Use after setEntry's, before any applies. | |
template<class Mat1 , class Mat2 > | |
Mat1 & | applyLeft (Mat1 &Y, const Mat2 &X) const |
Mul with this on left: Y <- AX. Requires conformal shapes. | |
template<class Mat1 , class Mat2 > | |
Mat1 & | applyRight (Mat1 &Y, const Mat2 &X) const |
Mul with this on right: Y <- XA. Requires conformal shapes. | |
template<class OutVector , class InVector > | |
OutVector & | apply (OutVector &y, const InVector &x) const |
y <- A x. More... | |
template<class OutVector , class InVector > | |
OutVector & | applyTranspose (OutVector &, const InVector &) const |
y <- A^T x. More... | |
size_t | size () const |
Returns number of non-zero entries. More... | |
Protected Attributes | |
Index | rows_ |
The number of rows, columns. | |
Sparse Matrix in Triples storage.
Sparse matrix representation which stores nonzero entries by i,j,value triples.
std::ostream & write | ( | std::ostream & | out | ) | const |
OutVector & apply | ( | OutVector & | y, |
const InVector & | x | ||
) | const |
y <- A x.
Performance will generally be best if A is in cacheOpt order, and rowMajor, colMajor orders are generally better than random.
OutVector & applyTranspose | ( | OutVector & | y, |
const InVector & | x | ||
) | const |
y <- A^T x.
Performance will generally be best if A is in cacheOpt order, and rowMajor, colMajor orders are generally better than random.
size_t size | ( | ) | const |
Returns number of non-zero entries.