]> https://gitweb.dealii.org/ - dealii.git/commitdiff
Move comment about the implementation to the function that actually does the
authorWolfgang Bangerth <bangerth@math.tamu.edu>
Fri, 25 Mar 2011 01:40:53 +0000 (01:40 +0000)
committerWolfgang Bangerth <bangerth@math.tamu.edu>
Fri, 25 Mar 2011 01:40:53 +0000 (01:40 +0000)
(internal) implementation, rather than leaving it with the general class.

git-svn-id: https://svn.dealii.org/trunk@23529 0785d39b-7218-0410-832d-ea1e28bc413d

deal.II/include/deal.II/base/polynomial.h

index d8aee0b869a6dc9526257a0c4b0300a715d7bf8c..5a302a5e6077c80c5b63c052bc7a5ae74940f534 100644 (file)
@@ -2,7 +2,7 @@
 //    $Id$
 //    Version: $Name$
 //
-//    Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2009, 2010 by the deal.II authors
+//    Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2009, 2010, 2011 by the deal.II authors
 //
 //    This file is subject to QPL and may not be  distributed
 //    without copyright and license information. Please refer
@@ -390,11 +390,7 @@ namespace Polynomials
  * Legendre polynomials of arbitrary degree on <tt>[0,1]</tt>.
  *
  * Constructing a Legendre polynomial of degree <tt>p</tt>, the coefficients
- * will be computed by the three-term recursion formula.  The
- * coefficients are stored in a static data vector to be available
- * when needed next time. Since the recursion is performed for the
- * interval $[-1,1]$, the polynomials are shifted to $[0,1]$ by the
- * <tt>scale</tt> and <tt>shift</tt> functions of <tt>Polynomial</tt>, afterwards.
+ * will be computed by the three-term recursion formula.
  *
  * @author Guido Kanschat, 2000
  */
@@ -446,6 +442,15 @@ namespace Polynomials
 
                                        /**
                                         * Compute coefficients recursively.
+                                       * The coefficients are stored in a
+                                       * static data vector to be available
+                                       * when needed next time. Since the
+                                       * recursion is performed for the
+                                       * interval $[-1,1]$, the polynomials
+                                       * are shifted to $[0,1]$ by the
+                                       * <tt>scale</tt> and <tt>shift</tt>
+                                       * functions of <tt>Polynomial</tt>,
+                                       * afterwards.
                                         */
       static void compute_coefficients (const unsigned int p);
 

In the beginning the Universe was created. This has made a lot of people very angry and has been widely regarded as a bad move.

Douglas Adams


Typeset in Trocchi and Trocchi Bold Sans Serif.