PolynomialSum.h

Go to the documentation of this file.

/*
 *  Copyright (c) 2018, Martin Duy Tat
 *  All rights reserved.
 *  Redistribution and use in source and binary forms, with or without
 *  modification, are permitted provided that the following conditions are met:
 *  1. Redistributions of source code must retain the above copyright notice,
 *     this list of conditions and the following disclaimer.
 *  2. 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.
 *  3. Neither the name of STFC 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 COPYRIGHT OWNER OR CONTRIBUTORS 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 POLYNOMIAL_SUM_H
#define POLYNOMIAL_SUM_H
 
#include <vector>
#include "TwoPolynomial.h"
 
namespace polynomial {
 
class PolynomialSum {
public:
    PolynomialSum();
    explicit PolynomialSum(const TwoPolynomial &polynomial);
    PolynomialSum(const PolynomialSum &polynomialSum);
    ~PolynomialSum();
    PolynomialSum& operator= (const PolynomialSum &sum);
    void differentiateX();
    void differentiateS();
    void multiplyPolynomial(const TwoPolynomial &poly);
    void printPolynomial() const;
    std::size_t numberOfTerms() const;
    bool isPolynomialZero(const std::size_t &p) const;
    void truncate(const std::size_t &truncateOrder);
    double evaluatePolynomial(const std::size_t &p,
                              const double &x,
                              const double &s) const;
    void putSumTogether(const std::vector<double> &dSvalues,
                        std::vector<std::vector<double>> &finalPolynomial) const;
    double evaluatePolynomial2(const double &x,
                               const double &s,
                               const std::vector<double> &dSvalues) const;
    void addPolynomial(const PolynomialSum &poly);
    std::vector<std::size_t> getdSfactors(const std::size_t &p) const;
    void sortTerms();
private:
    std::vector<TwoPolynomial> polynomialSum_m;
};
 
inline
    std::size_t PolynomialSum::numberOfTerms() const {
        return polynomialSum_m.size();
}
inline
    double PolynomialSum::evaluatePolynomial(const std::size_t &p,
                                             const double &x,
                                             const double &s) const {
        if (p >= polynomialSum_m.size()) {
            return 0.0;
        }
        return polynomialSum_m[p].evaluatePolynomial(x, s);
}
 
}
 
#endif