f3arr2.cpp

Go to the documentation of this file.

/*
 * $Id$
 *
 * Author: David Fournier
 * Copyright (c) 2008-2012 Regents of the University of California
 */
#include "fvar.hpp"

dvariable norm(const dvar3_array& m)
    {
      gradient_structure* gs = gradient_structure::_instance;
      gs->RETURN_ARRAYS_INCREMENT();
      dvariable tmp=0.0;
      for (int k=m.slicemin();k<=m.slicemax();k++)
      {
        tmp+=norm2(m(k));
      }
      tmp=sqrt(tmp);
      gs->RETURN_ARRAYS_DECREMENT();
      return tmp;
    }

dvariable norm2(const dvar3_array& m)
    {
      gradient_structure* gs = gradient_structure::_instance;
      gs->RETURN_ARRAYS_INCREMENT();
      dvariable tmp=0.0;
      for (int k=m.slicemin();k<=m.slicemax();k++)
      {
        tmp+=norm2(m(k));
      }
      gs->RETURN_ARRAYS_DECREMENT();
      return tmp;
    }
dvariable sumsq(const dvar3_array& m) {return(norm2(m));}

dvar3_array exp(const dvar3_array& m)
{
  gradient_structure* gs = gradient_structure::_instance;
  gs->RETURN_ARRAYS_INCREMENT();
  dvar3_array tmp;
  tmp.allocate(m);
  for (int i=tmp.slicemin();i<=tmp.slicemax();i++)
  {
    tmp(i)=exp(m(i));
  }
  gs->RETURN_ARRAYS_DECREMENT();
  return tmp;
}
dvar3_array log(const dvar3_array& m)
{
  gradient_structure* gs = gradient_structure::_instance;
  gs->RETURN_ARRAYS_INCREMENT();
  dvar3_array tmp;
  tmp.allocate(m);
  for (int i=tmp.slicemin();i<=tmp.slicemax();i++)
  {
    tmp(i)=log(m(i));
  }
  gs->RETURN_ARRAYS_DECREMENT();
  return tmp;
}
dvar3_array sin(const dvar3_array& m)
{
  gradient_structure* gs = gradient_structure::_instance;
  gs->RETURN_ARRAYS_INCREMENT();
  dvar3_array tmp;
  tmp.allocate(m);
  for (int i=tmp.slicemin();i<=tmp.slicemax();i++)
  {
    tmp(i)=sin(m(i));
  }
  gs->RETURN_ARRAYS_DECREMENT();
  return tmp;
}
dvar3_array cos(const dvar3_array& m)
{
  gradient_structure* gs = gradient_structure::_instance;
  gs->RETURN_ARRAYS_INCREMENT();
  dvar3_array tmp;
  tmp.allocate(m);
  for (int i=tmp.slicemin();i<=tmp.slicemax();i++)
  {
    tmp(i)=cos(m(i));
  }
  gs->RETURN_ARRAYS_DECREMENT();
  return tmp;
}
dvar3_array sqrt(const dvar3_array& m)
{
  gradient_structure* gs = gradient_structure::_instance;
  gs->RETURN_ARRAYS_INCREMENT();
  dvar3_array tmp;
  tmp.allocate(m);
  for (int i=tmp.slicemin();i<=tmp.slicemax();i++)
  {
    tmp(i)=sqrt(m(i));
  }
  gs->RETURN_ARRAYS_DECREMENT();
  return tmp;
}
dvar3_array sqr(const dvar3_array& m)
{
  gradient_structure* gs = gradient_structure::_instance;
  gs->RETURN_ARRAYS_INCREMENT();
  dvar3_array tmp;
  tmp.allocate(m);
  for (int i=tmp.slicemin();i<=tmp.slicemax();i++)
  {
    tmp(i)=sqr(m(i));
  }
  gs->RETURN_ARRAYS_DECREMENT();
  return tmp;
}

dvar3_array tan(const dvar3_array& m)
   {
     gradient_structure* gs = gradient_structure::_instance;
     gs->RETURN_ARRAYS_INCREMENT();
     dvar3_array tmp;
     tmp.allocate(m);
     for (int i=tmp.slicemin();i<=tmp.slicemax();i++)
     {
       tmp(i)=tan(m(i));
     }
     gs->RETURN_ARRAYS_DECREMENT();
     return tmp;
   }

dvar3_array elem_prod(const dvar3_array& m1, const dvar3_array& m2)
   {
     gradient_structure* gs = gradient_structure::_instance;
     gs->RETURN_ARRAYS_INCREMENT();
     dvar3_array tmp;
     tmp.allocate(m1);
     for (int i=tmp.slicemin();i<=tmp.slicemax();i++)
     {
       tmp(i)=elem_prod(m1(i),m2(i));
     }
     gs->RETURN_ARRAYS_DECREMENT();
     return tmp;
   }

dvar3_array elem_div(const dvar3_array& m1, const dvar3_array& m2)
   {
     gradient_structure* gs = gradient_structure::_instance;
     gs->RETURN_ARRAYS_INCREMENT();
     dvar3_array tmp;
     tmp.allocate(m1);
     for (int i=tmp.slicemin();i<=tmp.slicemax();i++)
     {
       tmp(i)=elem_div(m1(i),m2(i));
     }
     gs->RETURN_ARRAYS_DECREMENT();
     return tmp;
   }

dvar3_array operator+(const dvar3_array& m1,const dvar3_array& m2)
   {
     gradient_structure* gs = gradient_structure::_instance;
     gs->RETURN_ARRAYS_INCREMENT();
     dvar3_array tmp;
     tmp.allocate(m1);
     for (int i=tmp.slicemin();i<=tmp.slicemax();i++)
     {
       tmp(i)=m1(i)+m2(i);
     }
     gs->RETURN_ARRAYS_DECREMENT();
     return tmp;
   }

dvar3_array operator-(const dvar3_array& m1, const dvar3_array& m2)
   {
     gradient_structure* gs = gradient_structure::_instance;
     gs->RETURN_ARRAYS_INCREMENT();
     dvar3_array tmp;
     tmp.allocate(m1);
     for (int i=tmp.slicemin();i<=tmp.slicemax();i++)
     {
       tmp(i)=m1(i)-m2(i);
     }
     gs->RETURN_ARRAYS_DECREMENT();
     return tmp;
   }

dvar3_array elem_prod(const d3_array& m1, const dvar3_array& m2)
   {
     gradient_structure* gs = gradient_structure::_instance;
     gs->RETURN_ARRAYS_INCREMENT();
     dvar3_array tmp;
     tmp.allocate(m1);
     for (int i=tmp.slicemin();i<=tmp.slicemax();i++)
     {
       tmp(i)=elem_prod(m1(i),m2(i));
     }
     gs->RETURN_ARRAYS_DECREMENT();
     return tmp;
   }

dvar3_array elem_div(const d3_array& m1, const dvar3_array& m2)
   {
     gradient_structure* gs = gradient_structure::_instance;
     gs->RETURN_ARRAYS_INCREMENT();
     dvar3_array tmp;
     tmp.allocate(m1);
     for (int i=tmp.slicemin();i<=tmp.slicemax();i++)
     {
       tmp(i)=elem_div(m1(i),m2(i));
     }
     gs->RETURN_ARRAYS_DECREMENT();
     return tmp;
   }

dvar3_array operator+(const d3_array& m1, const dvar3_array& m2)
   {
     gradient_structure* gs = gradient_structure::_instance;
     gs->RETURN_ARRAYS_INCREMENT();
     dvar3_array tmp;
     tmp.allocate(m1);
     for (int i=tmp.slicemin();i<=tmp.slicemax();i++)
     {
       tmp(i)=m1(i)+m2(i);
     }
     gs->RETURN_ARRAYS_DECREMENT();
     return tmp;
   }

dvar3_array operator-(const d3_array& m1, const dvar3_array& m2)
   {
     gradient_structure* gs = gradient_structure::_instance;
     gs->RETURN_ARRAYS_INCREMENT();
     dvar3_array tmp;
     tmp.allocate(m1);
     for (int i=tmp.slicemin();i<=tmp.slicemax();i++)
     {
       tmp(i)=m1(i)-m2(i);
     }
     gs->RETURN_ARRAYS_DECREMENT();
     return tmp;
   }