/* $Id: polynomial.cc $ */
/* Author: Andrew McBride, 2010 */
/* */
-/* Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 by the deal.II authors */
+/* Copyright (C) 2010 by the deal.II authors */
/* */
/* This file is subject to QPL and may not be distributed */
/* without copyright and license information. Please refer */
/* to the file deal.II/doc/license.html for the text and */
/* further information on this license. */
-// check on the Polynomial -= operator
+// check on the Polynomial::operator -=
#include <base/logstream.h>
#include <base/polynomial.h>
using namespace dealii;
-int main ()
+int main ()
{
std::ofstream logfile("polynomial_minus_equals/output");
deallog << std::setprecision(3);
deallog.attach(logfile);
deallog.depth_console(0);
-
+
// subtract two equal polynomials up to order p_dim
- // the result evaluated at an arbitrary point
+ // the result evaluated at an arbitrary point
// should always be zero
-
+
// check polynomials up to order 32
const unsigned int p_dim = 32;
-
+
std::vector<double> coefficients_a;
-
+
// arbitrary point
double evalutation_number = 12.123;
-
- for (unsigned int pp = 0; pp < p_dim; pp++)
+
+ for (unsigned int pp = 0; pp < p_dim; pp++)
{
coefficients_a.push_back(pp);
-
+
Polynomials::Polynomial<double> test_poly_a(coefficients_a);
Polynomials::Polynomial<double> test_poly_b(coefficients_a);
-
+
test_poly_b -= test_poly_a;
-
+
deallog << test_poly_b.value(evalutation_number) << std::endl;
}
}