UblasCustomFunctions.hpp

/*

Copyright (C) University of Oxford, 2005-2009

University of Oxford means the Chancellor, Masters and Scholars of the
University of Oxford, having an administrative office at Wellington
Square, Oxford OX1 2JD, UK.

This file is part of Chaste.

Chaste is free software: you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as published
by the Free Software Foundation, either version 2.1 of the License, or
(at your option) any later version.

Chaste is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
License for more details. The offer of Chaste under the terms of the
License is subject to the License being interpreted in accordance with
English Law and subject to any action against the University of Oxford
being under the jurisdiction of the English Courts.

You should have received a copy of the GNU Lesser General Public License
along with Chaste. If not, see <http://www.gnu.org/licenses/>.

*/


#ifndef UBLASCUSTOMFUNCTIONS_HPP_
#define UBLASCUSTOMFUNCTIONS_HPP_

#include <boost/numeric/ublas/matrix.hpp>
#include <boost/numeric/ublas/vector.hpp>

#include <boost/numeric/ublas/matrix_proxy.hpp>
#include <boost/numeric/ublas/io.hpp>
#include <boost/numeric/ublas/matrix_expression.hpp>

#include "petscblaslapack.h"
//Promote universal LAPACK name if it's an old version of PETSc
#if (PETSC_VERSION_MINOR == 2) //Old API
#define LAPACKgeev_ LAgeev_
#endif

//#include <iostream>
//#include <fstream>
//#include <vector>

#include <cfloat>
#define TINY DBL_EPSILON

#include "Exception.hpp"

using namespace boost::numeric::ublas;
template<class T>
T Determinant(const boost::numeric::ublas::c_matrix<T,1,1> &m)
{
    using namespace boost::numeric::ublas;

    return m(0,0);
};
template<class T>
T SubDeterminant(const boost::numeric::ublas::c_matrix<T,1,1> &m, const unsigned missrow, const unsigned misscol)
{
    using namespace boost::numeric::ublas;

    assert(missrow==0);
    assert(misscol==0);
    return 1.0;
};

template<class T>
T Determinant(const boost::numeric::ublas::c_matrix<T,2,2> &m)
{
    using namespace boost::numeric::ublas;

    return m(0,0)*m(1,1)
           - m(1,0)*m(0,1);
};

template<class T>
T SubDeterminant(const boost::numeric::ublas::c_matrix<T,2,2> &m, const unsigned missrow, const unsigned misscol)
{
    using namespace boost::numeric::ublas;

    assert(missrow<2);
    assert(misscol<2);

    unsigned row=(missrow==1)?0:1;
    unsigned col=(misscol==1)?0:1;
    return m(row,col);
};

template<class T>
T Determinant(const boost::numeric::ublas::c_matrix<T,3,3> &m)
{
    using namespace boost::numeric::ublas;

    return   m(0,0) *
             (m(1,1)*m(2,2) - m(1,2)*m(2,1))
             - m(0,1) *
             (m(1,0)*m(2,2) - m(1,2)*m(2,0))
             + m(0,2) *
             (m(1,0)*m(2,1) - m(1,1)*m(2,0));
};


template<class T>
T SubDeterminant(const boost::numeric::ublas::c_matrix<T,3,3> &m, const unsigned missrow, const unsigned misscol)
{
    using namespace boost::numeric::ublas;

    assert(missrow<3);
    assert(misscol<3);

    unsigned lorow=(missrow==0)?1:0;
    unsigned hirow=(missrow==2)?1:2;
    unsigned locol=(misscol==0)?1:0;
    unsigned hicol=(misscol==2)?1:2;
    return (m(lorow,locol)*m(hirow,hicol) - m(lorow,hicol)*m(hirow,locol));
};

template<class T>
boost::numeric::ublas::c_matrix<T, 1, 1> Inverse(const boost::numeric::ublas::c_matrix<T, 1, 1> &m)
{
    using namespace boost::numeric::ublas;

    c_matrix<T, 1, 1> inverse;
    T det = Determinant(m);
    assert( fabs(det) > TINY ); //Else it is a singular matrix
    inverse(0,0) =  1.0/det;
    return inverse;
};

template<class T>
boost::numeric::ublas::c_matrix<T, 2, 2> Inverse(const boost::numeric::ublas::c_matrix<T, 2, 2> &m)
{
    using namespace boost::numeric::ublas;

    c_matrix<T, 2, 2> inverse;
    T det = Determinant(m);

    assert( fabs(det) > TINY ); //Else it is a singular matrix
    inverse(0,0)  =  m(1,1)/det;
    inverse(0,1)  = -m(0,1)/det;
    inverse(1,0)  = -m(1,0)/det;
    inverse(1,1)  =  m(0,0)/det;
    return inverse;
};

template<class T>
boost::numeric::ublas::c_matrix<T, 3, 3> Inverse(const boost::numeric::ublas::c_matrix<T, 3, 3> &m)
{
    using namespace boost::numeric::ublas;

    c_matrix<T, 3, 3> inverse;
    T det = Determinant(m);
    assert( fabs(det) > TINY ); //Else it is a singular matrix
    inverse(0,0)  =  (m(1,1)*m(2,2)-m(1,2)*m(2,1))/det;
    inverse(1,0)  =  -(m(1,0)*m(2,2)-m(1,2)*m(2,0))/det;
    inverse(2,0)  =  (m(1,0)*m(2,1)-m(1,1)*m(2,0))/det;
    inverse(0,1)  =  -(m(0,1)*m(2,2)-m(0,2)*m(2,1))/det;
    inverse(1,1)  =  (m(0,0)*m(2,2)-m(0,2)*m(2,0))/det;
    inverse(2,1)  =  -(m(0,0)*m(2,1)-m(0,1)*m(2,0))/det;
    inverse(0,2)  =  (m(0,1)*m(1,2)-m(0,2)*m(1,1))/det;
    inverse(1,2)  = - (m(0,0)*m(1,2)-m(0,2)*m(1,0))/det;
    inverse(2,2)  =  (m(0,0)*m(1,1)-m(0,1)*m(1,0))/det;
    return inverse;
};

template<class T>
c_vector<T, 3> VectorProduct(const c_vector<T, 3> &a, const c_vector<T, 3> &b)
{
    //This is a cross-product
    // What do you get when you cross an elephant with a banana?
    //only implemented for 3-vectors

    c_vector<T, 3>  result;

    double x1=a(0);
    double y1=a(1);
    double z1=a(2);
    double x2=b(0);
    double y2=b(1);
    double z2=b(2);

    result(0)=y1*z2-z1*y2;
    result(1)=z1*x2-x1*z2;
    result(2)=x1*y2-y1*x2;

    return result;
}

template<class T>
T Trace(const c_matrix<T,1,1> &m)
{
    return m(0,0);
}

template<class T>
T Trace(const c_matrix<T,2,2> &m)
{
    return m(0,0)+m(1,1);
}

template<class T>
T Trace(const c_matrix<T,3,3> &m)
{
    return m(0,0)+m(1,1)+m(2,2);
}

template<class T>
T Trace(const c_matrix<T,4,4> &m)
{
    return m(0,0)+m(1,1)+m(2,2)+m(3,3);
}

template<class T>
T SecondInvariant(const c_matrix<T,3,3> &m)
{
    return    m(0,0)*m(1,1) + m(1,1)*m(2,2) + m(2,2)*m(0,0)
            - m(1,0)*m(1,0) - m(2,1)*m(2,1) - m(2,0)*m(2,0);
}

template<class T>
T SecondInvariant(const c_matrix<T,2,2> &m)
{
    return Determinant(m);
}


c_vector<double, 1> Create_c_vector(double x);

c_vector<double, 2> Create_c_vector(double x, double y);

c_vector<double, 3> Create_c_vector(double x, double y, double z);

c_vector<double,3> CalculateEigenvectorForSmallestNonzeroEigenvalue(c_matrix<double,3,3> &A);

#endif /*UBLASCUSTOMFUNCTIONS_HPP_*/

---