Polynomial.h

Go to the documentation of this file.

//Copyright (c) 2013-2014, The MercuryDPM Developers Team. All rights reserved.
//For the list of developers, see <http://www.MercuryDPM.org/Team>.
//
//Redistribution and use in source and binary forms, with or without
//modification, are permitted provided that the following conditions are met:
//  * Redistributions of source code must retain the above copyright
//    notice, this list of conditions and the following disclaimer.
//  * Redistributions in binary form must reproduce the above copyright
//    notice, this list of conditions and the following disclaimer in the
//    documentation and/or other materials provided with the distribution.
//  * Neither the name MercuryDPM nor the
//    names of its contributors may be used to endorse or promote products
//    derived from this software without specific prior written permission.
//
//THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
//ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
//WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
//DISCLAIMED. IN NO EVENT SHALL THE MERCURYDPM DEVELOPERS TEAM BE LIABLE FOR ANY
//DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
//(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
//LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
//ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
//(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
//SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

#ifndef POLY_H
#define POLY_H

#include <cmath>
#include <sstream>

template <StatType T>
class NORMALIZED_POLYNOMIAL
{

//definition of member variables

private:

    std::string name;
    
    unsigned int dim;
    
    std::vector<Mdouble> coefficients; //starting with the highest order
    
    std::vector<Mdouble> averaged_coefficients;

//definition of member functions

public:

    NORMALIZED_POLYNOMIAL () {  
        set_name("Polynomial");
        coefficients.resize(0);
        dim = 0;
    }

    void set_polynomial(std::vector<Mdouble> new_coefficients, unsigned int new_dim);

    void set_polynomial(Mdouble* new_coefficients, unsigned int num_coeff, unsigned int new_dim);

    void set_name(const char* new_name) {name = new_name;}

    std::string get_name() {return name;}

    Mdouble evaluate(Mdouble r);

    Mdouble evaluateGradient(Mdouble r);
    
    Mdouble evaluateIntegral(Mdouble a, Mdouble b, Mdouble t);

    int get_Order (void) {
      return coefficients.size()-1;
    }

    friend inline std::ostream& operator<<(std::ostream& os, const NORMALIZED_POLYNOMIAL &P) {
        unsigned int N = P.coefficients.size();
        for (unsigned int i=0; i<N; i++) {
            if (!P[i]) continue;
            if (P[i]>=0) os << "+";
            os << std::setprecision(2) << P[i];
            if (N-1-i>1) os << "r^" << N-1-i; 
            else if (N-1-i==1) os << "r"; 
        }
        return os;
    }

private:
    void finish_set_polynomial();

    Mdouble get_volume();
    
    Mdouble evaluate_1D(Mdouble r);
    
    Mdouble evaluate_2D(Mdouble r);

    void set_average();

    void set_average_1D();

    void set_average_2D();
    
    Mdouble evaluateGradient_1D(Mdouble r);

    Mdouble evaluateGradient_2D(Mdouble r);

    Mdouble evaluateIntegral_1D(Mdouble a, Mdouble b, Mdouble t);
    
    Mdouble evaluateIntegral_2D(Mdouble a, Mdouble b, Mdouble t);

    Mdouble operator[](int i) const {
      return coefficients[i];
    }

};
#include "Polynomial.hcc"
#endif