hybrj_functor Struct Reference

Inheritance diagram for hybrj_functor:

Public Member Functions
	hybrj_functor (void)
int	operator() (const VectorXd &x, VectorXd &fvec)
int	df (const VectorXd &x, MatrixXd &fjac)
Public Member Functions inherited from Functor< double >
	Functor ()
	Functor (int inputs, int values)
	Functor ()
	Functor (int inputs_, int values_)
int	inputs () const
int	inputs () const
int	values () const
int	values () const

Additional Inherited Members
Public Types inherited from Functor< double >
enum
enum
typedef double	Scalar
typedef double	Scalar
typedef Matrix< Scalar, InputsAtCompileTime, 1 >	InputType
typedef Matrix< Scalar, InputsAtCompileTime, 1 >	InputType
typedef Matrix< Scalar, ValuesAtCompileTime, 1 >	ValueType
typedef Matrix< Scalar, ValuesAtCompileTime, 1 >	ValueType
typedef Matrix< Scalar, ValuesAtCompileTime, InputsAtCompileTime >	JacobianType
typedef Matrix< Scalar, ValuesAtCompileTime, InputsAtCompileTime >	JacobianType
Public Attributes inherited from Functor< double >
const int	m_inputs
int	m_inputs
const int	m_values
int	m_values

Constructor & Destructor Documentation

hybrj_functor()

hybrj_functor::hybrj_functor ( void  )

inline

: Functor<double>(9, 9) {}

Member Function Documentation

df()

int hybrj_functor::df ( const VectorXd &  x, MatrixXd &  fjac  )

inline

                                            {
    const VectorXd::Index n = x.size();
    assert(fjac.rows() == n);
    assert(fjac.cols() == n);
    for (VectorXd::Index k = 0; k < n; k++) {
      for (VectorXd::Index j = 0; j < n; j++) fjac(k, j) = 0.;
      fjac(k, k) = 3. - 4. * x[k];
      if (k) fjac(k, k - 1) = -1.;
      if (k != n - 1) fjac(k, k + 1) = -2.;
    }
    return 0;
  }

References assert, j, k, n, and plotDoE::x.

operator()()

int hybrj_functor::operator() ( const VectorXd &  x, VectorXd &  fvec  )

inline

                                                    {
    double temp, temp1, temp2;
    const VectorXd::Index n = x.size();
    assert(fvec.size() == n);
    for (VectorXd::Index k = 0; k < n; k++) {
      temp = (3. - 2. * x[k]) * x[k];
      temp1 = 0.;
      if (k) temp1 = x[k - 1];
      temp2 = 0.;
      if (k != n - 1) temp2 = x[k + 1];
      fvec[k] = temp - temp1 - 2. * temp2 + 1.;
    }
    return 0;
  }

References assert, k, n, and plotDoE::x.

---

The documentation for this struct was generated from the following file:

• NonLinearOptimization.cpp