Go to the documentation of this file.
36 template<
class S,
class V,
class E>
38 const ConjugateGradientParameters &
parameters,
bool steepest =
false);
70 void print (
const std::string&
s =
"System")
const;
74 return A() ^ (
A() *
x -
b());
99 const IterativeOptimizationParameters &
parameters);
107 const ConjugateGradientParameters &
parameters);
118 const ConjugateGradientParameters &
parameters);
127 const ConjugateGradientParameters &
parameters);
133 const GaussianFactorGraph& fg,
135 const ConjugateGradientParameters &
parameters);
141 const GaussianFactorGraph& fg,
143 const ConjugateGradientParameters &
parameters);
System(const Matrix &A, const Vector &b)
Vector operator^(const Vector &e) const
Vector steepestDescent(const System &Ab, const Vector &x, const ConjugateGradientParameters ¶meters)
Array< double, 1, 3 > e(1./3., 0.5, 2.)
typedef and functions to augment Eigen's MatrixXd
set noclip points set clip one set noclip two set bar set border lt lw set xdata set ydata set zdata set x2data set y2data set boxwidth set dummy x
void transposeMultiplyAdd(double alpha, const Vector &e, Vector &x) const
Vector conjugateGradientDescent(const System &Ab, const Vector &x, const ConjugateGradientParameters ¶meters)
void print(const Matrix &A, const string &s, ostream &stream)
Implementation of Conjugate Gradient solver for a linear system.
V conjugateGradients(const S &Ab, V x, const ConjugateGradientParameters ¶meters, bool steepest)
static ConjugateGradientParameters parameters
Iterative methods, template implementation.
Vector operator*(const Vector &x) const
void multiplyInPlace(const Vector &x, Vector &e) const
Vector gradient(const Vector &x) const
gtsam
Author(s):
autogenerated on Sat Nov 16 2024 04:02:33