devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

Clang-format tests, examples, libraries, benchmarks, etc.

Browse Source
This commit is contained in:
Antonio Sánchez
2023-12-05 21:22:55 +00:00
committed by Rasmus Munk Larsen
parent 3252ecc7a4
commit 46e9cdb7fe
876 changed files with 33453 additions and 37795 deletions
Download Patch File Download Diff File Expand all files Collapse all files

134
unsupported/test/forward_adolc.cpp
View File

@@ -13,24 +13,19 @@
#define NUMBER_DIRECTIONS 16
#include <unsupported/Eigen/AdolcForward>
template<typename Vector>
EIGEN_DONT_INLINE typename Vector::Scalar foo(const Vector& p)
{
template <typename Vector>
EIGEN_DONT_INLINE typename Vector::Scalar foo(const Vector& p) {
typedef typename Vector::Scalar Scalar;
return (p-Vector(Scalar(-1),Scalar(1.))).norm() + (p.array().sqrt().abs() * p.array().sin()).sum() + p.dot(p);
return (p - Vector(Scalar(-1), Scalar(1.))).norm() + (p.array().sqrt().abs() * p.array().sin()).sum() + p.dot(p);
}
template<typename Scalar_, int NX=Dynamic, int NY=Dynamic>
struct TestFunc1
{
template <typename Scalar_, int NX = Dynamic, int NY = Dynamic>
struct TestFunc1 {
typedef Scalar_ Scalar;
enum {
InputsAtCompileTime = NX,
ValuesAtCompileTime = NY
};
typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;
typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;
typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;
enum { InputsAtCompileTime = NX, ValuesAtCompileTime = NY };
typedef Matrix<Scalar, InputsAtCompileTime, 1> InputType;
typedef Matrix<Scalar, ValuesAtCompileTime, 1> ValueType;
typedef Matrix<Scalar, ValuesAtCompileTime, InputsAtCompileTime> JacobianType;
int m_inputs, m_values;
@@ -40,102 +35,93 @@ struct TestFunc1
int inputs() const { return m_inputs; }
int values() const { return m_values; }
template<typename T>
void operator() (const Matrix<T,InputsAtCompileTime,1>& x, Matrix<T,ValuesAtCompileTime,1>* _v) const
{
Matrix<T,ValuesAtCompileTime,1>& v = *_v;
template <typename T>
void operator()(const Matrix<T, InputsAtCompileTime, 1>& x, Matrix<T, ValuesAtCompileTime, 1>* _v) const {
Matrix<T, ValuesAtCompileTime, 1>& v = *_v;
v[0] = 2 * x[0] * x[0] + x[0] * x[1];
v[1] = 3 * x[1] * x[0] + 0.5 * x[1] * x[1];
if(inputs()>2)
{
if (inputs() > 2) {
v[0] += 0.5 * x[2];
v[1] += x[2];
}
if(values()>2)
{
if (values() > 2) {
v[2] = 3 * x[1] * x[0] * x[0];
}
if (inputs()>2 && values()>2)
v[2] *= x[2];
if (inputs() > 2 && values() > 2) v[2] *= x[2];
}
void operator() (const InputType& x, ValueType* v, JacobianType* _j) const
{
void operator()(const InputType& x, ValueType* v, JacobianType* _j) const {
(*this)(x, v);
if(_j)
{
if (_j) {
JacobianType& j = *_j;
j(0,0) = 4 * x[0] + x[1];
j(1,0) = 3 * x[1];
j(0, 0) = 4 * x[0] + x[1];
j(1, 0) = 3 * x[1];
j(0,1) = x[0];
j(1,1) = 3 * x[0] + 2 * 0.5 * x[1];
j(0, 1) = x[0];
j(1, 1) = 3 * x[0] + 2 * 0.5 * x[1];
if (inputs()>2)
{
j(0,2) = 0.5;
j(1,2) = 1;
if (inputs() > 2) {
j(0, 2) = 0.5;
j(1, 2) = 1;
}
if(values()>2)
{
j(2,0) = 3 * x[1] * 2 * x[0];
j(2,1) = 3 * x[0] * x[0];
if (values() > 2) {
j(2, 0) = 3 * x[1] * 2 * x[0];
j(2, 1) = 3 * x[0] * x[0];
}
if (inputs()>2 && values()>2)
{
j(2,0) *= x[2];
j(2,1) *= x[2];
if (inputs() > 2 && values() > 2) {
j(2, 0) *= x[2];
j(2, 1) *= x[2];
j(2,2) = 3 * x[1] * x[0] * x[0];
j(2,2) = 3 * x[1] * x[0] * x[0];
j(2, 2) = 3 * x[1] * x[0] * x[0];
j(2, 2) = 3 * x[1] * x[0] * x[0];
}
}
}
};
template<typename Func> void adolc_forward_jacobian(const Func& f)
{
typename Func::InputType x = Func::InputType::Random(f.inputs());
typename Func::ValueType y(f.values()), yref(f.values());
typename Func::JacobianType j(f.values(),f.inputs()), jref(f.values(),f.inputs());
template <typename Func>
void adolc_forward_jacobian(const Func& f) {
typename Func::InputType x = Func::InputType::Random(f.inputs());
typename Func::ValueType y(f.values()), yref(f.values());
typename Func::JacobianType j(f.values(), f.inputs()), jref(f.values(), f.inputs());
jref.setZero();
yref.setZero();
f(x,&yref,&jref);
// std::cerr << y.transpose() << "\n\n";;
// std::cerr << j << "\n\n";;
jref.setZero();
yref.setZero();
f(x, &yref, &jref);
// std::cerr << y.transpose() << "\n\n";;
// std::cerr << j << "\n\n";;
j.setZero();
y.setZero();
AdolcForwardJacobian<Func> autoj(f);
autoj(x, &y, &j);
// std::cerr << y.transpose() << "\n\n";;
// std::cerr << j << "\n\n";;
j.setZero();
y.setZero();
AdolcForwardJacobian<Func> autoj(f);
autoj(x, &y, &j);
// std::cerr << y.transpose() << "\n\n";;
// std::cerr << j << "\n\n";;
VERIFY_IS_APPROX(y, yref);
VERIFY_IS_APPROX(j, jref);
VERIFY_IS_APPROX(y, yref);
VERIFY_IS_APPROX(j, jref);
}
EIGEN_DECLARE_TEST(forward_adolc)
{
EIGEN_DECLARE_TEST(forward_adolc) {
adtl::setNumDir(NUMBER_DIRECTIONS);
for(int i = 0; i < g_repeat; i++) {
CALL_SUBTEST(( adolc_forward_jacobian(TestFunc1<double,2,2>()) ));
CALL_SUBTEST(( adolc_forward_jacobian(TestFunc1<double,2,3>()) ));
CALL_SUBTEST(( adolc_forward_jacobian(TestFunc1<double,3,2>()) ));
CALL_SUBTEST(( adolc_forward_jacobian(TestFunc1<double,3,3>()) ));
CALL_SUBTEST(( adolc_forward_jacobian(TestFunc1<double>(3,3)) ));
for (int i = 0; i < g_repeat; i++) {
CALL_SUBTEST((adolc_forward_jacobian(TestFunc1<double, 2, 2>())));
CALL_SUBTEST((adolc_forward_jacobian(TestFunc1<double, 2, 3>())));
CALL_SUBTEST((adolc_forward_jacobian(TestFunc1<double, 3, 2>())));
CALL_SUBTEST((adolc_forward_jacobian(TestFunc1<double, 3, 3>())));
CALL_SUBTEST((adolc_forward_jacobian(TestFunc1<double>(3, 3))));
}
{
// simple instantiation tests
Matrix<adtl::adouble,2,1> x;
Matrix<adtl::adouble, 2, 1> x;
foo(x);
Matrix<adtl::adouble,Dynamic,Dynamic> A(4,4);;
Matrix<adtl::adouble, Dynamic, Dynamic> A(4, 4);
;
A.selfadjointView<Lower>().eigenvalues();
}
}