# ifndef CPPAD_EXAMPLE_ABS_NORMAL_ABS_EVAL_HPP
# define CPPAD_EXAMPLE_ABS_NORMAL_ABS_EVAL_HPP
/* --------------------------------------------------------------------------
CppAD: C++ Algorithmic Differentiation: Copyright (C) 2003-17 Bradley M. Bell

CppAD is distributed under the terms of the
             Eclipse Public License Version 2.0.

This Source Code may also be made available under the following
Secondary License when the conditions for such availability set forth
in the Eclipse Public License, Version 2.0 are satisfied:
      GNU General Public License, Version 2.0 or later.
---------------------------------------------------------------------------- */
/*
$begin abs_eval$$
$spell
    jac
    Jacobian
    eval
    hpp
$$
$section abs_normal: Evaluate First Order Approximation$$

$head Syntax$$
$icode%g_tilde% = abs_eval(%n%, %m%, %s%, %g_hat%, %g_jac%, %delta_x%)%$$

$head Prototype$$
$srcfile%example/abs_normal/abs_eval.hpp%
    0%// BEGIN PROTOTYPE%// END PROTOTYPE%
1%$$

$head Source$$
This following is a link to the source code for this example:
$cref/abs_eval.hpp/abs_eval.hpp/$$.

$head Purpose$$
Given a current that abs-normal representation at a point
$latex \hat{x} \in \B{R}^n$$,
and a $latex \Delta x \in \B{R}^n$$,
this routine evaluates the abs-normal
$cref/approximation for f(x)
    /abs_normal_fun
    /Abs-normal Approximation
    /Approximating f(x)
/$$
where $latex x = \hat{x} + \Delta x$$.

$head Vector$$
The type $icode Vector$$ is a
simple vector with elements of type $code double$$.

$head f$$
We use the notation $icode f$$ for the original function; see
$cref/f/abs_normal_fun/f/$$.

$head n$$
This is the dimension of the domain space for $icode f$$; see
$cref/n/abs_normal_fun/f/n/$$.

$head m$$
This is the dimension of the range space for $icode f$$; see
$cref/m/abs_normal_fun/f/m/$$.

$head s$$
This is the number of absolute value terms in $icode f$$; see

$head g$$
We use the notation $icode g$$ for the abs-normal representation of $icode f$$;
see $cref/g/abs_normal_fun/g/$$.

$head g_hat$$
This vector has size $icode%m% + %s%$$ and is the value of
$icode g(x, u)$$ at $latex x = \hat{x}$$ and $latex u = a( \hat{x} )$$.

$head g_jac$$
This vector has size $codei%(%m% + %s%) * (%n% + %s%)%$$ and is the Jacobian of
$latex g(x, u)$$ at $latex x = \hat{x}$$ and $latex u = a( \hat{x} )$$.

$head delta_x$$
This vector has size $icode n$$ and is the difference
$latex \Delta x = x - \hat{x}$$,
where $latex x$$ is the point that we are approximating $latex f(x)$$.

$head g_tilde$$
This vector has size $icode%m% + %s%$$ and is a the
first order approximation for
$cref/g/abs_normal_fun/g/$$
that corresponds to the point
$latex x = \hat{x} + \Delta x$$ and $latex u = a(x)$$.

$children%example/abs_normal/abs_eval.cpp
    %example/abs_normal/abs_eval.omh
%$$
$head Example$$
The file $cref abs_eval.cpp$$ contains an example and test of
$code abs_eval$$.

$end
-----------------------------------------------------------------------------
*/

// BEGIN C++
namespace CppAD { // BEGIN_CPPAD_NAMESPACE
// BEGIN PROTOTYPE
template <class Vector>
Vector abs_eval(
    size_t        n       ,
    size_t        m       ,
    size_t        s       ,
    const Vector& g_hat   ,
    const Vector& g_jac   ,
    const Vector& delta_x )
// END PROTOTYPE
{   using std::fabs;
    //
    CPPAD_ASSERT_KNOWN(
        size_t(delta_x.size()) == n,
        "abs_eval: size of delta_x not equal to n"
    );
    CPPAD_ASSERT_KNOWN(
        size_t(g_hat.size()) == m + s,
        "abs_eval: size of g_hat not equal to m + s"
    );
    CPPAD_ASSERT_KNOWN(
        size_t(g_jac.size()) == (m + s) * (n + s),
        "abs_eval: size of g_jac not equal to (m + s)*(n + s)"
    );
# ifndef NDEBUG
    // Check that partial_u z(x, u) is strictly lower triangular
    for(size_t i = 0; i < s; i++)
    {   for(size_t j = i; j < s; j++)
        {   // index in g_jac of partial of z_i w.r.t u_j
            // (note that g_jac has n + s elements in each row)
            size_t index = (m + i) * (n + s) + (n + j);
            CPPAD_ASSERT_KNOWN(
                g_jac[index] == 0.0,
                "abs_eval: partial z_i w.r.t u_j non-zero for i <= j"
            );
        }
    }
# endif
    // return value
    Vector g_tilde(m + s);
    //
    // compute z_tilde, the last s components of g_tilde
    for(size_t i = 0; i < s; i++)
    {   // start at z_hat_i
        g_tilde[m + i] = g_hat[m + i];
        // contribution for change x
        for(size_t j = 0; j < n; j++)
        {   // index in g_jac of partial of z_i w.r.t x_j
            size_t index = (m + i) * (n + s) + j;
            // add contribution for delta_x_j to z_tilde_i
            g_tilde[m + i] += g_jac[index] * delta_x[j];
        }
        // contribution for change in u_j for j < i
        for(size_t j = 0; j < i; j++)
        {   // approixmation for change in absolute value
            double delta_a_j = fabs(g_tilde[m + j]) - fabs(g_hat[m + j]);
            // index in g_jac of partial of z_i w.r.t u_j
            size_t index = (m + i) * (n + s) + n + j;
            // add constribution for delta_a_j to s_tilde_i
            g_tilde[m + i] += g_jac[index] * delta_a_j;
        }
    }
    //
    // compute y_tilde, the first m components of g_tilde
    for(size_t i = 0; i < m; i++)
    {   // start at y_hat_i
        g_tilde[i] = g_hat[i];
        // contribution for change x
        for(size_t j = 0; j < n; j++)
        {   // index in g_jac of partial of y_i w.r.t x_j
            size_t index = i * (n + s) + j;
            // add contribution for delta_x_j to y_tilde_i
            g_tilde[i] += g_jac[index] * delta_x[j];
        }
        // contribution for change in u_j
        for(size_t j = 0; j < s; j++)
        {   // approximation for change in absolute value
            double delta_a_j = fabs(g_tilde[m + j]) - fabs(g_hat[m + j]);
            // index in g_jac of partial of y_i w.r.t u_j
            size_t index = i * (n + s) + n + j;
            // add constribution for delta_a_j to s_tilde_i
            g_tilde[i] += g_jac[index] * delta_a_j;
        }
    }
    return g_tilde;
}
} // END_CPPAD_NAMESPACE
// END C++

# endif
