34#include "DGtal/base/Common.h"
35#include "ConfigTest.h"
36#include "DGtal/helpers/StdDefs.h"
37#include "DGtal/math/linalg/CLinearAlgebraSolver.h"
38#include "DGtal/math/linalg/CSparseMatrix.h"
39#include "DGtal/math/linalg/CDynamicMatrix.h"
40#include "DGtal/math/linalg/CDenseVector.h"
41#include "DGtal/math/linalg/CDynamicVector.h"
42#include "DGtal/math/linalg/EigenSupport.h"
58 typedef LAB::DenseVector
Vector;
59 typedef LAB::SparseMatrix Matrix;
60 typedef LAB::Triplet Triplet;
61 typedef std::vector<Triplet> TripletsVector;
62 typedef std::list<Triplet> TripletsList;
81int main(
int argc,
char** argv )
85 for (
int i = 0; i < argc; ++i )
90 trace.
emphase() << ( res ?
"Passed." :
"Error." ) << endl;
void beginBlock(const std::string &keyword="")
DGtal is the top-level namespace which contains all DGtal functions and types.
Aim: Provide linear algebra backend using Eigen dense and sparse matrix as well as dense vector....
Aim: Represent any dynamic or static sized matrix having dense representation.
Aim: Represent any dynamic sized matrix having sparse or dense representation.
Aim: Represent any dynamic sized column vector having sparse or dense representation.
Aim: Describe a linear solver defined over a linear algebra. Problems are of the form:
Aim: Represent any dynamic or static sized matrix having sparse representation.
FreemanChain< int >::Vector Vector
bool testEigenSolverConcepts()