18 :
public boost::python::def_visitor<
19 SimplicialLLTVisitor<_MatrixType, _UpLo, _Ordering>> {
21 typedef _MatrixType MatrixType;
23 typedef Eigen::SimplicialLLT<MatrixType> Solver;
24 typedef typename MatrixType::Scalar Scalar;
25 typedef typename MatrixType::RealScalar RealScalar;
26 typedef Eigen::Matrix<Scalar, Eigen::Dynamic, 1, MatrixType::Options>
28 typedef Eigen::Matrix<Scalar, Eigen::Dynamic, Eigen::Dynamic,
32 template <
class PyClass>
33 void visit(PyClass &cl)
const {
34 cl.def(bp::init<>(bp::arg(
"self"),
"Default constructor"))
35 .def(bp::init<MatrixType>(bp::args(
"self",
"matrix"),
36 "Constructs and performs the LLT " 37 "factorization from a given matrix."))
43 static const std::string classname =
44 "SimplicialLLT_" + scalar_name<Scalar>::shortname();
48 static void expose(
const std::string &name) {
49 bp::class_<Solver, boost::noncopyable>(
51 "A direct sparse LLT Cholesky factorizations.\n\n" 52 "This class provides a LL^T Cholesky factorizations of sparse matrices " 53 "that are selfadjoint and positive definite." 54 "The factorization allows for solving A.X = B where X and B can be " 55 "either dense or sparse.\n\n" 56 "In order to reduce the fill-in, a symmetric permutation P is applied " 57 "prior to the factorization such that the factorized matrix is P A "