36 parameters_(parameters) {
40 cout <<
"Split A into (A1) " << Ab1->size() <<
" and (A2) " << Ab2->size()
41 <<
" factors" << endl;
43 auto Rc1 = Ab1->eliminateSequential(ordering,
EliminateQR);
44 auto xbar = boost::make_shared<VectorValues>(Rc1->optimize());
45 pc_ = boost::make_shared<SubgraphPreconditioner>(Ab2, Rc1, xbar);
54 auto xbar = boost::make_shared<VectorValues>(Rc1->optimize());
55 pc_ = boost::make_shared<SubgraphPreconditioner>(Ab2, Rc1, xbar);
81 pair<GaussianFactorGraph::shared_ptr, GaussianFactorGraph::shared_ptr>
86 auto subgraph = builder(factorGraph);
std::pair< boost::shared_ptr< GaussianFactorGraph >, boost::shared_ptr< GaussianFactorGraph > > splitGraph(const GaussianFactorGraph &gfg)
Split graph using Kruskal algorithm, treating binary factors as edges.
boost::shared_ptr< SubgraphPreconditioner > pc_
preconditioner object
static enum @843 ordering
boost::shared_ptr< This > shared_ptr
shared_ptr to this class
Subgraph Solver from IROS 2010.
V conjugateGradients(const S &Ab, V x, const ConjugateGradientParameters ¶meters, bool steepest)
boost::shared_ptr< This > shared_ptr
std::pair< GaussianFactorGraph::shared_ptr, GaussianFactorGraph::shared_ptr > splitFactorGraph(const GaussianFactorGraph &factorGraph, const Subgraph &subgraph)
SubgraphBuilderParameters builderParams
VectorValues optimize() const
Optimize from zero.
Linear Factor Graph where all factors are Gaussians.
Iterative methods, template implementation.
Verbosity verbosity() const
static ConjugateGradientParameters parameters
cout<< "The eigenvalues of A are:"<< endl<< ces.eigenvalues()<< endl;cout<< "The matrix of eigenvectors, V, is:"<< endl<< ces.eigenvectors()<< endl<< endl;complex< float > lambda
SubgraphSolver(const GaussianFactorGraph &A, const Parameters ¶meters, const Ordering &ordering)
boost::shared_ptr< BayesNetType > eliminateSequential(OptionalOrderingType orderingType=boost::none, const Eliminate &function=EliminationTraitsType::DefaultEliminate, OptionalVariableIndex variableIndex=boost::none) const
Chordal Bayes Net, the result of eliminating a factor graph.
std::pair< GaussianConditional::shared_ptr, JacobianFactor::shared_ptr > EliminateQR(const GaussianFactorGraph &factors, const Ordering &keys)