// $Id$
// Version: $Name$
//
-// Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006 by the deal.II authors
+// Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2009 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
* happens through the Horner scheme which provides both numerical
* stability and a minimal number of numerical operations.
*
- * @author Ralf Hartmann, Guido Kanschat, 2000, 2006
+ * @author Ralf Hartmann, Guido Kanschat, 2000, 2006, 2009
*/
template <typename number>
class Polynomial : public Subscriptor
*/
Polynomial (const std::vector<number> &coefficients);
+ /**
+ * Constructor creating a zero
+ * polynomial of degree @p n.
+ */
+ Polynomial (const unsigned int n);
+
/**
* Default constructor creating
* an illegal object.
// $Id$
// Version: $Name$
//
-// Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006 by the deal.II authors
+// Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2009 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
+ template <typename number>
+ Polynomial<number>::Polynomial (const unsigned int n)
+ :
+ coefficients(n+1, 0.)
+ {}
+
+
+
template <typename number>
void
Polynomial<number>::value (const number x,