can someone write the polynomials.cpp for this header? // CLASS PROVIDED: // cla

Question

can someone write the polynomials.cpp for this header? // CLASS PROVIDED: // class polynomial // A polynomial has one variable x, real number coefficients, and // non-negative integer exponents. Such a polynomial can be viewed // as having the form: // A[n]*x^n + A[n-1]*x^(n-1) + ... A[2]*x^2 + A[1]*x + A[0] // where the A[n] are the real number coefficients and x^i represents // the variable x raised to the i power. The coefficient A[0] is // called the "constant" or "zeroth" term of the polynomial. // // MEMBER CONSTANTS // const static size_t MAXIMUM_DEGREE // The size of the maximum exponent permitted for a polynomial. // // CONSTRUCTOR for the polynomial class // polynomial(double c = 0.0, unsigned int exponent = 0) // PRECONDITION: exponent <= MAXIMUM_DEGREE // POSTCONDITION: This polynomial has been created with all zero // coefficients, except for coefficient c for the specified exponent. // When used as a default constructor (using default values for // both arguments), the result is a polynomial with all zero // coefficients. // // MODIFICATION MEMBER FUNCTIONS for the polynomial class // void add_to_coef(double amount, unsigned int exponent) // PRECONDITION: exponent <= MAXIMUM_DEGREE. // POSTCONDITION: Adds the given amount to the coefficient of the // specified exponent. // // void assign_coef(double coefficient, unsigned int exponent) // PRECONDITION: exponent <= MAXIMUM_DEGREE. // POSTCONDITION: Sets the coefficient for the specified exponent. // // void clear( ) // POSTCONDITION: All coefficients of this polynomial are set to zero. // // CONSTANT MEMBER FUNCTIONS for the polynomial class // polynomial antiderivative( ) const // PRECONDITION: degree( ) < MAXIMUM_DEGREE // POSTCONDITION: The return value is the antiderivative (indefinite integral) // of this polynomial. // NOTE: The return polynomial always has a constant term of zero. // // double coefficient(unsigned int exponent) const // POSTCONDITION: Returns coefficient at specified exponent of this // polynomial. // NOTE: For exponents > MAXIMUM_DEGREE, the return value is always zero. // // double definite_integral(double x0, double x1) const // POSTCONDITION: Returns the value of the definite integral computed from // x0 to x1. The answer is computed analytically. // // unsigned int degree( ) const // POSTCONDITION: The function returns the value of the largest exponent // with a non-zero coefficient. // If all coefficients are zero, then the function returns zero (even // though, technically, this polynomial does not have a degree). // // polynomial derivative( ) const // POSTCONDITION: The return value is the first derivative of this // polynomial. // // double eval(double x) const // POSTCONDITION: The return value is the value of this polynomial with the // given value for the variable x. // // void find_root( // double& answer, // bool& success, // unsigned int& iterations, // double starting_guess = 0, // unsigned int maximum_iterations = 100, // ) // const // PRECONDITION: epsilon > 0. // POSTCONDITION: This function uses Newton's method to search for a root of // the polynomial (i.e., a value of x for which the polynomial is zero). // The method requires some starting guess for the value of the root. This // guess is improved over a series of iterations (with the maximum allowed // iterations defined by the parameter maximum_iterations). // // bool is_zero( ) const // POSTCONDITION: The return value is true if and only if the polynomial // is the zero polynomial. // // unsigned int next_term(unsigned int e) const // POSTCONDITION: The return value is the next exponent n which is LARGER // than e such that coefficient(n) != 0. // If there is no such term, then the return value is zero. // // double numeric_definite_integral(double x0, double x1, unsigned int n) const // POSTCONDITION: Returns the value of the definite integral computed from // x0 to x1 by using the trapezoid method with n sections of equal width. // // unsigned int previous_term(unsigned int e) const // POSTCONDITION: The return value is the next exponent n which is SMALLER // than e such that coefficient(n) != 0. // If there is no such term, then the return value is UINT_MAX // from . // // CONSTANT OPERATORS for the polynomial class // double operator( ) (double x) const // Same as the eval member function. // // NON-MEMBER BINARY OPERATORS for the polynomial Class // polynomial operator -(const polynomial& p1, const polynomial& p2) // POSTCONDITION: return-value is a polynomial with each coefficient // equal to the difference of the coefficients of p1 & p2 for any given // exponent. // // polynomial operator +(const polynomial& p1, const polynomial& p2) // POSTCONDITION: return-value is a polynomial with each coefficient // equal to the sum of the coefficients of p1 & p2 for any given // exponent. // // polynomial operator *(const polynomial& p1, const polynomial& p2) // PRECONDITION: p1.degree( ) + p2.degree( ) <= MAXIMUM_DEGREE. // POSTCONDITION: Each term of p1 has been multiplied by each term of p2, // and the answer is the sum of all these term-by-term products. // For example, if p1 is 2x^2 + 3x + 4 and p2 is 5x^2 - 1x + 7, then the // return value is 10x^4 + 13x^3 + 31x^2 + 17x + 28. // // NON-MEMBER OUTPUT FUNCTIONS for the polynomial Class // ostream& operator << (ostream& out, const polynomial& p) // POSTCONDITION: The polynomial has been printed to ostream out, which, // in turn, has been returned to the calling function. // // // The value semantics (copy constructor and assignment operator) are valid for // the polynomial class. #ifndef POLYNOMIALS_H #define POLYNOMIALS_H #include using namespace std; { class polynomial { public: // CONSTANTS static const unsigned int MAXIMUM_DEGREE = 29; // CONSTRUCTOR polynomial(double c = 0.0, unsigned int exponent = 0); // MODIFICATION MEMBER FUNCTIONS void add_to_coef(double amount, unsigned int exponent); void assign_coef(double coefficient, unsigned int exponent); void clear( ); // CONSTANT MEMBER FUNCTIONS polynomial antiderivative( ) const; double coefficient(unsigned int exponent) const; double definite_integral(double x0, double x1) const; unsigned int degree( ) const { return current_degree; } polynomial derivative( ) const; double eval(double x) const; bool is_zero( ) const; unsigned int next_term(unsigned int e) const; double numeric_definite_integral(double x0, double x1, unsigned int n); unsigned int previous_term(unsigned int e) const; // CONSTANT OPERATORS double operator( ) (double x) const { return eval(x); } private: double coef[MAXIMUM_DEGREE]; unsigned int current_degree; }; // NON-MEMBER BINARY OPERATORS polynomial operator +(const polynomial& p1, const polynomial& p2); polynomial operator -(const polynomial& p1, const polynomial& p2); polynomial operator *(const polynomial& p1, const polynomial& p2); // NON-MEMBER OUTPUT FUNCTIONS std::ostream& operator << (std::ostream& out, const polynomial& p); } #endif

Explanation / Answer

// #include "Polynomial.hpp" template Polynomial::Polynomial(const PolynomialBasis* basis, const Real* coefficients) { this->basis = basis; this->coefficients = new Real[this->basis->getSize()]; this->setCoefficients(coefficients); } template Polynomial::Polynomial(const Polynomial& polynomial) { (*this) = polynomial; } template Polynomial::~Polynomial(void) { delete[] this->coefficients; this->coefficients = NULL; } template void Polynomial::setCoefficients(const Real* coefficients) { if (coefficients != NULL) { for (register unsigned int i = 0; i basis->getSize(); ++i) { this->coefficients[i] = coefficients[i]; } } else { for (register unsigned int i = 0; i basis->getSize(); ++i) { this->coefficients[i] = static_cast(0.0f); } } } template Real* Polynomial::getCoefficients(void) const { return this->coefficients; } template Real* Polynomial::getCoefficients(void) { return this->coefficients; } template unsigned int Polynomial::getNumberOfCoefficients(void) const { return this->basis->getSize(); } template Real Polynomial::evaluate(const Real* point) const { return this->basis->evaluatePolynomial(this->coefficients, point); } template Polynomial& Polynomial::operator=(const Polynomial& polynomial) { if (this->basis->getSize() != polynomial.basis->getSize()) { delete[] this->coefficients; this->coefficients = new Real[polynomial.basis->getSize()]; } this->basis = polynomial.basis; this->setCoefficients(polynomial.coefficients); return (*this); }

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.