commons-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From er...@apache.org
Subject svn commit: r1291806 [1/2] - /commons/proper/math/trunk/src/site/xdoc/userguide/
Date Tue, 21 Feb 2012 14:31:58 GMT
Author: erans
Date: Tue Feb 21 14:31:56 2012
New Revision: 1291806

URL: http://svn.apache.org/viewvc?rev=1291806&view=rev
Log:
Base package name: Changed "math" -> "math3" in userguide links.

Modified:
    commons/proper/math/trunk/src/site/xdoc/userguide/analysis.xml
    commons/proper/math/trunk/src/site/xdoc/userguide/complex.xml
    commons/proper/math/trunk/src/site/xdoc/userguide/distribution.xml
    commons/proper/math/trunk/src/site/xdoc/userguide/filter.xml
    commons/proper/math/trunk/src/site/xdoc/userguide/fraction.xml
    commons/proper/math/trunk/src/site/xdoc/userguide/genetics.xml
    commons/proper/math/trunk/src/site/xdoc/userguide/geometry.xml
    commons/proper/math/trunk/src/site/xdoc/userguide/linear.xml
    commons/proper/math/trunk/src/site/xdoc/userguide/ode.xml
    commons/proper/math/trunk/src/site/xdoc/userguide/optimization.xml
    commons/proper/math/trunk/src/site/xdoc/userguide/overview.xml
    commons/proper/math/trunk/src/site/xdoc/userguide/random.xml
    commons/proper/math/trunk/src/site/xdoc/userguide/special.xml
    commons/proper/math/trunk/src/site/xdoc/userguide/stat.xml
    commons/proper/math/trunk/src/site/xdoc/userguide/transform.xml
    commons/proper/math/trunk/src/site/xdoc/userguide/utilities.xml

Modified: commons/proper/math/trunk/src/site/xdoc/userguide/analysis.xml
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/site/xdoc/userguide/analysis.xml?rev=1291806&r1=1291805&r2=1291806&view=diff
==============================================================================
--- commons/proper/math/trunk/src/site/xdoc/userguide/analysis.xml (original)
+++ commons/proper/math/trunk/src/site/xdoc/userguide/analysis.xml Tue Feb 21 14:31:56 2012
@@ -93,13 +93,13 @@
       </subsection>
       <subsection name="4.3 Root-finding" href="rootfinding">
         <p>
-          <a href="../apidocs/org/apache/commons/math/analysis/solvers/UnivariateRealSolver.html">
-          UnivariateRealSolver</a>, <a href="../apidocs/org/apache/commons/math/analysis/solvers/DifferentiableUnivariateRealSolver.html">
-          DifferentiableUnivariateRealSolver</a> and <a href="../apidocs/org/apache/commons/math/analysis/solvers/PolynomialSolver.html">
+          <a href="../apidocs/org/apache/commons/math3/analysis/solvers/UnivariateRealSolver.html">
+          UnivariateRealSolver</a>, <a href="../apidocs/org/apache/commons/math3/analysis/solvers/DifferentiableUnivariateRealSolver.html">
+          DifferentiableUnivariateRealSolver</a> and <a href="../apidocs/org/apache/commons/math3/analysis/solvers/PolynomialSolver.html">
           PolynomialSolver</a> provide means to find roots of
-          <a href="../apidocs/org/apache/commons/math/analysis/UnivariateRealFunction.html">univariate real-valued functions</a>,
-          <a href="../apidocs/org/apache/commons/math/analysis/DifferentiableUnivariateRealFunction.html">differentiable univariate real-valued functions</a>,
-          and <a href="../apidocs/org/apache/commons/math/analysis/polynomials/PolynomialFunction.html">polynomial functions</a> respectively.
+          <a href="../apidocs/org/apache/commons/math3/analysis/UnivariateRealFunction.html">univariate real-valued functions</a>,
+          <a href="../apidocs/org/apache/commons/math3/analysis/DifferentiableUnivariateRealFunction.html">differentiable univariate real-valued functions</a>,
+          and <a href="../apidocs/org/apache/commons/math3/analysis/polynomials/PolynomialFunction.html">polynomial functions</a> respectively.
           A root is the value where the function takes the value 0.  Commons-Math
           includes implementations of the several root-finding algorithms:
         </p>
@@ -107,84 +107,84 @@
             <tr BGCOLOR="#CCCCFF"><td colspan="5"><font size="+2">Root solvers</font></td></tr>
             <tr BGCOLOR="#EEEEFF"><font size="+1"><td>Name</td><td>Function type</td><td>Convergence</td><td>Needs initial bracketing</td><td>Bracket side selection</td></font></tr>
             <tr>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/solvers/BisectionSolver.html">Bisection</a></td>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/solvers/BisectionSolver.html">Bisection</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
               <td>linear, guaranteed</td>
               <td>yes</td>
               <td>yes</td>
             </tr>
             <tr>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/solvers/BrentSolver.html">Brent-Dekker</a></td>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/solvers/BrentSolver.html">Brent-Dekker</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
               <td>super-linear, guaranteed</td>
               <td>yes</td>
               <td>no</td>
             </tr>
             <tr>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/solvers/BracketingNthOrderBrentSolver.html">bracketing n<sup>th</sup> order Brent</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/solvers/BracketingNthOrderBrentSolver.html">bracketing n<sup>th</sup> order Brent</a></td>
               <td>variable order, guaranteed</td>
               <td>yes</td>
               <td>yes</td>
             </tr>
             <tr>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/solvers/IllinoisSolver.html">Illinois Method</a></td>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/solvers/IllinoisSolver.html">Illinois Method</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
               <td>super-linear, guaranteed</td>
               <td>yes</td>
               <td>yes</td>
             </tr>
             <tr>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/solvers/LaguerreSolver.html">Laguerre's Method</a></td>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/polynomials/PolynomialFunction.html">polynomial functions</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/solvers/LaguerreSolver.html">Laguerre's Method</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/polynomials/PolynomialFunction.html">polynomial functions</a></td>
               <td>cubic for simple root, linear for multiple root</td>
               <td>yes</td>
               <td>no</td>
             </tr>
             <tr>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/solvers/MullerSolver.html">Muller's Method</a> using bracketing to deal with real-valued functions</td>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/solvers/MullerSolver.html">Muller's Method</a> using bracketing to deal with real-valued functions</td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
               <td>quadratic close to roots</td>
               <td>yes</td>
               <td>no</td>
             </tr>
             <tr>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/solvers/MullerSolver2.html">Muller's Method</a> using modulus to deal with real-valued functions</td>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/solvers/MullerSolver2.html">Muller's Method</a> using modulus to deal with real-valued functions</td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
               <td>quadratic close to root</td>
               <td>yes</td>
               <td>no</td>
             </tr>
             <tr>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/solvers/NewtonSolver.html">Newton's Method</a></td>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/DifferentiableUnivariateRealFunction.html">differentiable univariate real-valued functions</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/solvers/NewtonSolver.html">Newton's Method</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/DifferentiableUnivariateRealFunction.html">differentiable univariate real-valued functions</a></td>
               <td>quadratic, non-guaranteed</td>
               <td>no</td>
               <td>no</td>
             </tr>
             <tr>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/solvers/PegasusSolver.html">Pegasus Method</a></td>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/solvers/PegasusSolver.html">Pegasus Method</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
               <td>super-linear, guaranteed</td>
               <td>yes</td>
               <td>yes</td>
             </tr>
             <tr>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/solvers/RegulaFalsiSolver.html">Regula Falsi (false position) Method</a></td>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/solvers/RegulaFalsiSolver.html">Regula Falsi (false position) Method</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
               <td>linear, guaranteed</td>
               <td>yes</td>
               <td>yes</td>
             </tr>
             <tr>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/solvers/RiddersSolver.html">Ridder's Method</a></td>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/solvers/RiddersSolver.html">Ridder's Method</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
               <td>super-linear</td>
               <td>yes</td>
               <td>no</td>
             </tr>
             <tr>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/solvers/SecantSolver.html">Secant Method</a></td>
-              <td><a href="../apidocs/org/apache/commons/math/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/solvers/SecantSolver.html">Secant Method</a></td>
+              <td><a href="../apidocs/org/apache/commons/math3/analysis/UnivariateRealFunction.html">univariate real-valued functions</a></td>
               <td>super-linear, non-guaranteed</td>
               <td>yes</td>
               <td>no</td>
@@ -240,9 +240,9 @@
           ill-conditioned problems is to be solved, this number can be decreased in order
           to avoid wasting time.
           <a
-          href="../apidocs/org/apache/commons/math/analysis/solvers/BracketedUnivariateRealSolver.html">Bracketed
+          href="../apidocs/org/apache/commons/math3/analysis/solvers/BracketedUnivariateRealSolver.html">Bracketed
           solvers</a> also take an <a
-          href="../apidocs/org/apache/commons/math/analysis/solvers/AllowedSolutions.html">allowedSolutions</a>
+          href="../apidocs/org/apache/commons/math3/analysis/solvers/AllowedSolutions.html">allowedSolutions</a>
           enum parameter to specify which side of the final convergence interval should be
           selected as the root. It can be <code>ANY_SIDE</code>, <code>LEFT_SIDE</code>, <code>RIGHT_SIDE</code>,
           <code>BELOW_SIDE</code> or <code>ABOVE_SIDE</code>. Left and right are used to specify the root along
@@ -376,13 +376,13 @@ double c = UnivariateRealSolverUtils.for
       </subsection>
       <subsection name="4.4 Interpolation" href="interpolation">
         <p>
-          A <a href="../apidocs/org/apache/commons/math/analysis/interpolation/UnivariateRealInterpolator.html">
+          A <a href="../apidocs/org/apache/commons/math3/analysis/interpolation/UnivariateRealInterpolator.html">
           UnivariateRealInterpolator</a> is used to find a univariate real-valued
           function <code>f</code> which for a given set of ordered pairs 
           (<code>x<sub>i</sub></code>,<code>y<sub>i</sub></code>) yields
           <code>f(x<sub>i</sub>)=y<sub>i</sub></code> to the best accuracy possible. The result
           is provided as an object implementing the <a
-          href="../apidocs/org/apache/commons/math/analysis/UnivariateRealFunction.html">
+          href="../apidocs/org/apache/commons/math3/analysis/UnivariateRealFunction.html">
           UnivariateRealFunction</a> interface. It can therefore be evaluated at any point,
           including point not belonging to the original set.
           Currently, only an interpolator for generating natural cubic splines and a polynomial
@@ -437,13 +437,13 @@ System.out println("f(" + interpolationX
           href="http://www.dudziak.com/microsphere.pdf">MS thesis</a>.
         </p>
         <p>
-          A <a href="../apidocs/org/apache/commons/math/analysis/interpolation/BivariateRealGridInterpolator.html">
+          A <a href="../apidocs/org/apache/commons/math3/analysis/interpolation/BivariateRealGridInterpolator.html">
           BivariateRealGridInterpolator</a> is used to find a bivariate real-valued
           function <code>f</code> which for a given set of tuples
           (<code>x<sub>i</sub></code>,<code>y<sub>j</sub></code>,<code>f<sub>ij</sub></code>)
           yields <code>f(x<sub>i</sub>,y<sub>j</sub>)=f<sub>ij</sub></code> to the best accuracy
           possible. The result is provided as an object implementing the
-          <a href="../apidocs/org/apache/commons/math/analysis/BivariateRealFunction.html">
+          <a href="../apidocs/org/apache/commons/math3/analysis/BivariateRealFunction.html">
           BivariateRealFunction</a> interface. It can therefore be evaluated at any point,
           including a point not belonging to the original set.
           The arrays <code>x<sub>i</sub></code> and <code>y<sub>j</sub></code> must be
@@ -455,25 +455,25 @@ System.out println("f(" + interpolationX
           are computed from the function values sampled on a grid, as well as the values of the
           partial derivatives of the function at those grid points.
           From two-dimensional data sampled on a grid, the
-          <a href="../apidocs/org/apache/commons/math/analysis/interpolation/BicubicSplineInterpolator.html">
+          <a href="../apidocs/org/apache/commons/math3/analysis/interpolation/BicubicSplineInterpolator.html">
           BicubicSplineInterpolator</a> computes a
-          <a href="../apidocs/org/apache/commons/math/analysis/interpolation/BicubicSplineInterpolatingFunction.html">
+          <a href="../apidocs/org/apache/commons/math3/analysis/interpolation/BicubicSplineInterpolatingFunction.html">
           bicubic interpolating function</a>.
           Prior to computing an interpolating function, the
-          <a href="../apidocs/org/apache/commons/math/analysis/interpolation/SmoothingPolynomialBicubicSplineInterpolator.html">
+          <a href="../apidocs/org/apache/commons/math3/analysis/interpolation/SmoothingPolynomialBicubicSplineInterpolator.html">
           SmoothingPolynomialBicubicSplineInterpolator</a> class performs smoothing of
           the data by computing the polynomial that best fits each of the one-dimensional
           curves along each of the coordinate axes.
         </p>
         <p>
-          A <a href="../apidocs/org/apache/commons/math/analysis/interpolation/TrivariateRealGridInterpolator.html">
+          A <a href="../apidocs/org/apache/commons/math3/analysis/interpolation/TrivariateRealGridInterpolator.html">
           TrivariateRealGridInterpolator</a> is used to find a trivariate real-valued
           function <code>f</code> which for a given set of tuples
           (<code>x<sub>i</sub></code>,<code>y<sub>j</sub></code>,<code>z<sub>k</sub></code>,
           <code>f<sub>ijk</sub></code>)
           yields <code>f(x<sub>i</sub>,y<sub>j</sub>,z<sub>k</sub>)=f<sub>ijk</sub></code>
           to the best accuracy possible. The result is provided as an object implementing the
-          <a href="../apidocs/org/apache/commons/math/analysis/TrivariateRealFunction.html">
+          <a href="../apidocs/org/apache/commons/math3/analysis/TrivariateRealFunction.html">
           TrivariateRealFunction</a> interface. It can therefore be evaluated at any point,
           including a point not belonging to the original set.
           The arrays <code>x<sub>i</sub></code>, <code>y<sub>j</sub></code> and
@@ -486,41 +486,41 @@ System.out println("f(" + interpolationX
           are computed from the function values sampled on a grid, as well as the values of the
           partial derivatives of the function at those grid points.
           From three-dimensional data sampled on a grid, the
-          <a href="../apidocs/org/apache/commons/math/analysis/interpolation/TricubicSplineInterpolator.html">
+          <a href="../apidocs/org/apache/commons/math3/analysis/interpolation/TricubicSplineInterpolator.html">
           TricubicSplineInterpolator</a> computes a
-          <a href="../apidocs/org/apache/commons/math/analysis/interpolation/TricubicSplineInterpolatingFunction.html">
+          <a href="../apidocs/org/apache/commons/math3/analysis/interpolation/TricubicSplineInterpolatingFunction.html">
           tricubic interpolating function</a>.
         </p>
       </subsection>
       <subsection name="4.5 Integration" href="integration">
         <p>
-          A <a href="../apidocs/org/apache/commons/math/analysis/integration/UnivariateRealIntegrator.html">
+          A <a href="../apidocs/org/apache/commons/math3/analysis/integration/UnivariateRealIntegrator.html">
           UnivariateRealIntegrator</a> provides the means to numerically integrate
-          <a href="../apidocs/org/apache/commons/math/analysis/UnivariateRealFunction.html">
+          <a href="../apidocs/org/apache/commons/math3/analysis/UnivariateRealFunction.html">
           univariate real-valued functions</a>.
           Commons-Math includes implementations of the following integration algorithms: <ul>
-          <li><a href="../apidocs/org/apache/commons/math/analysis/integration/RombergIntegrator.html">
+          <li><a href="../apidocs/org/apache/commons/math3/analysis/integration/RombergIntegrator.html">
           Romberg's method</a></li>
-          <li><a href="../apidocs/org/apache/commons/math/analysis/integration/SimpsonIntegrator.html">
+          <li><a href="../apidocs/org/apache/commons/math3/analysis/integration/SimpsonIntegrator.html">
           Simpson's method</a></li>
-          <li><a href="../apidocs/org/apache/commons/math/analysis/integration/TrapezoidIntegrator.html">
+          <li><a href="../apidocs/org/apache/commons/math3/analysis/integration/TrapezoidIntegrator.html">
           trapezoid method</a></li>
-          <li><a href="../apidocs/org/apache/commons/math/analysis/integration/LegendreGaussIntegrator.html">
+          <li><a href="../apidocs/org/apache/commons/math3/analysis/integration/LegendreGaussIntegrator.html">
           Legendre-Gauss method</a></li>
           </ul>      
         </p>
       </subsection>
       <subsection name="4.6 Polynomials" href="polynomials">
         <p>
-          The <a href="../apidocs/org/apache/commons/math/analysis/polynomials/package-summary.html">
+          The <a href="../apidocs/org/apache/commons/math3/analysis/polynomials/package-summary.html">
           org.apache.commons.math3.analysis.polynomials</a> package provides real
           coefficients polynomials.
         </p>
         <p>
-          The <a href="../apidocs/org/apache/commons/math/analysis/polynomials/PolynomialFunction.html">
+          The <a href="../apidocs/org/apache/commons/math3/analysis/polynomials/PolynomialFunction.html">
           PolynomialFunction</a> class is the most general one, using traditional
           coefficients arrays. The
-          <a href="../apidocs/org/apache/commons/math/analysis/polynomials/PolynomialsUtils.html">
+          <a href="../apidocs/org/apache/commons/math3/analysis/polynomials/PolynomialsUtils.html">
           PolynomialsUtils</a> utility class provides static factory methods to build
           Chebyshev, Hermite, Jacobi, Laguerre and Legendre polynomials. Coefficients are
           computed using exact fractions so these factory methods can build polynomials

Modified: commons/proper/math/trunk/src/site/xdoc/userguide/complex.xml
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/site/xdoc/userguide/complex.xml?rev=1291806&r1=1291805&r2=1291806&view=diff
==============================================================================
--- commons/proper/math/trunk/src/site/xdoc/userguide/complex.xml (original)
+++ commons/proper/math/trunk/src/site/xdoc/userguide/complex.xml Tue Feb 21 14:31:56 2012
@@ -34,7 +34,7 @@
       </subsection>
       <subsection name="7.2 Complex Numbers" href="complex">
         <p>
-          <a href="../apidocs/org/apache/commons/math/complex/Complex.html">
+          <a href="../apidocs/org/apache/commons/math3/complex/Complex.html">
           Complex</a> provides a complex number type that forms the basis for
           the complex functionality found in commons-math.
          </p>  
@@ -45,9 +45,9 @@
            handling infinite and <code>NaN</code> values.  No attempt is made
            to comply with ANSII/IEC C99x Annex G or any other standard for
            Complex arithmetic.  See the class and method javadocs for the 
-           <a href="../apidocs/org/apache/commons/math/complex/Complex.html">
+           <a href="../apidocs/org/apache/commons/math3/complex/Complex.html">
            Complex</a> and
-           <a href="../apidocs/org/apache/commons/math/complex/ComplexUtils.html">
+           <a href="../apidocs/org/apache/commons/math3/complex/ComplexUtils.html">
            ComplexUtils</a> classes for details on computing formulas.
         </p>
         <p>
@@ -78,11 +78,11 @@ Complex answer = lhs.add(rhs);       // 
       </subsection>
       <subsection name="7.3 Complex Transcendental Functions" href="function">
         <p>
-          <a href="../apidocs/org/apache/commons/math/complex/Complex.html">
+          <a href="../apidocs/org/apache/commons/math3/complex/Complex.html">
           Complex</a> also provides implementations of serveral transcendental
           functions involving complex number arguments.
           Prior to version 1.2, these functions were provided
-          by <a href="../apidocs/org/apache/commons/math/complex/ComplexUtils.html">
+          by <a href="../apidocs/org/apache/commons/math3/complex/ComplexUtils.html">
           ComplexUtils</a> in a way similar to the real number functions found in
           <code>java.lang.Math</code>, but this has been deprecated.
           These operations provide the means to compute the log, sine, tangent,
@@ -98,7 +98,7 @@ Complex answer = first.log();        // 
       <subsection name="7.4 Complex Formatting and Parsing" href="formatting">
         <p>
           <code>Complex</code> instances can be converted to and from strings
-          using the<a href="../apidocs/org/apache/commons/math/complex/ComplexFormat.html">
+          using the<a href="../apidocs/org/apache/commons/math3/complex/ComplexFormat.html">
           ComplexFormat</a> class.
           <code>ComplexFormat</code> is a <code>java.text.Format</code>
           extension and, as such, is used like other formatting objects (e.g.

Modified: commons/proper/math/trunk/src/site/xdoc/userguide/distribution.xml
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/site/xdoc/userguide/distribution.xml?rev=1291806&r1=1291805&r2=1291806&view=diff
==============================================================================
--- commons/proper/math/trunk/src/site/xdoc/userguide/distribution.xml (original)
+++ commons/proper/math/trunk/src/site/xdoc/userguide/distribution.xml Tue Feb 21 14:31:56 2012
@@ -70,19 +70,19 @@ double upperTail = 1.0 - t.cumulativePro
         Since there are numerous distributions and Commons-Math only directly
         supports a handful, it may be necessary to extend the distribution
         framework to satisfy individual needs.  It is recommended that the
-        <a href="../apidocs/org/apache/commons/math/distribution/Distribution.html">Distribution</a>,
-        <a href="../apidocs/org/apache/commons/math/distribution/ContinuousDistribution.html">
+        <a href="../apidocs/org/apache/commons/math3/distribution/Distribution.html">Distribution</a>,
+        <a href="../apidocs/org/apache/commons/math3/distribution/ContinuousDistribution.html">
         ContinuousDistribution</a>,
-        <a href="../apidocs/org/apache/commons/math/distribution/DiscreteDistribution.html">
-        DiscreteDistribution</a>, and <a href="../apidocs/org/apache/commons/math/distribution/IntegerDistribution.html">
+        <a href="../apidocs/org/apache/commons/math3/distribution/DiscreteDistribution.html">
+        DiscreteDistribution</a>, and <a href="../apidocs/org/apache/commons/math3/distribution/IntegerDistribution.html">
         IntegerDistribution</a> interfaces serve as
         base types for any extension.  These serve as the basis for all the
         distributions directly supported by Commons-Math and using those interfaces
         for implementation purposes will ensure any extension is compatible with the
         remainder of Commons-Math.  To aid in implementing a distribution extension,
-        the <a href="../apidocs/org/apache/commons/math/distribution/AbstractDistribution.html">
-        AbstractDistribution</a>, <a href="../apidocs/org/apache/commons/math/distribution/AbstractContinuousDistribution.html">
-        AbstractContinuousDistribution</a>, and <a href="../apidocs/org/apache/commons/math/distribution/AbstractIntegerDistribution.html">
+        the <a href="../apidocs/org/apache/commons/math3/distribution/AbstractDistribution.html">
+        AbstractDistribution</a>, <a href="../apidocs/org/apache/commons/math3/distribution/AbstractContinuousDistribution.html">
+        AbstractContinuousDistribution</a>, and <a href="../apidocs/org/apache/commons/math3/distribution/AbstractIntegerDistribution.html">
         AbstractIntegerDistribution</a> provide implementation building blocks and
         offer basic distribution functionality.  By extending these abstract classes
         directly, much of the repetitive distribution implementation is already

Modified: commons/proper/math/trunk/src/site/xdoc/userguide/filter.xml
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/site/xdoc/userguide/filter.xml?rev=1291806&r1=1291805&r2=1291806&view=diff
==============================================================================
--- commons/proper/math/trunk/src/site/xdoc/userguide/filter.xml (original)
+++ commons/proper/math/trunk/src/site/xdoc/userguide/filter.xml Tue Feb 21 14:31:56 2012
@@ -32,12 +32,12 @@
       </subsection>
       <subsection name="15.2 Kalman Filter" href="kalman">
         <p>
-          <a href="../apidocs/org/apache/commons/math/filter/KalmanFilter.html">
+          <a href="../apidocs/org/apache/commons/math3/filter/KalmanFilter.html">
           KalmanFilter</a> provides a discrete-time filter to estimate
           a stochastic linear process.</p>
           
-        <p>A Kalman filter is initialized with a <a href="../apidocs/org/apache/commons/math/filter/ProcessModel.html">
-          ProcessModel</a> and a <a href="../apidocs/org/apache/commons/math/filter/MeasurementModel.html">
+        <p>A Kalman filter is initialized with a <a href="../apidocs/org/apache/commons/math3/filter/ProcessModel.html">
+          ProcessModel</a> and a <a href="../apidocs/org/apache/commons/math3/filter/MeasurementModel.html">
           MeasurementModel</a>, which contain the corresponding transformation and noise covariance matrices. 
           The parameter names used in the respective models correspond to the following names commonly used 
           in the mathematical literature:

Modified: commons/proper/math/trunk/src/site/xdoc/userguide/fraction.xml
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/site/xdoc/userguide/fraction.xml?rev=1291806&r1=1291805&r2=1291806&view=diff
==============================================================================
--- commons/proper/math/trunk/src/site/xdoc/userguide/fraction.xml (original)
+++ commons/proper/math/trunk/src/site/xdoc/userguide/fraction.xml Tue Feb 21 14:31:56 2012
@@ -33,8 +33,8 @@
       </subsection>
       <subsection name="9.2 Fraction Numbers" href="fraction">
         <p>
-          <a href="../apidocs/org/apache/commons/math/fraction/Fraction.html">
-          Fraction</a> and <a href="../apidocs/org/apache/commons/math/fraction/BigFraction.html">
+          <a href="../apidocs/org/apache/commons/math3/fraction/Fraction.html">
+          Fraction</a> and <a href="../apidocs/org/apache/commons/math3/fraction/BigFraction.html">
           BigFraction</a> provide fraction number type that forms the basis for
           the fraction functionality found in Commons-Math. The former one can be
           used for fractions whose numerators and denominators are small enough
@@ -71,7 +71,7 @@ Fraction answer = lhs.add(rhs);     // a
       <subsection name="9.3 Fraction Formatting and Parsing" href="formatting">
         <p>
           <code>Fraction</code> instances can be converted to and from strings
-          using the<a href="../apidocs/org/apache/commons/math/fraction/FractionFormat.html">
+          using the<a href="../apidocs/org/apache/commons/math3/fraction/FractionFormat.html">
           FractionFormat</a> class. <code>FractionFormat</code> is a
           <code>java.text.Format</code> extension and, as such, is used like other
           formatting objects (e.g. <code>java.text.SimpleDateFormat</code>):

Modified: commons/proper/math/trunk/src/site/xdoc/userguide/genetics.xml
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/site/xdoc/userguide/genetics.xml?rev=1291806&r1=1291805&r2=1291806&view=diff
==============================================================================
--- commons/proper/math/trunk/src/site/xdoc/userguide/genetics.xml (original)
+++ commons/proper/math/trunk/src/site/xdoc/userguide/genetics.xml Tue Feb 21 14:31:56 2012
@@ -33,15 +33,15 @@
       </subsection>
       <subsection name="14.2 GA Framework">
       <p>
-      <a href="../apidocs/org/apache/commons/math/genetics/GeneticAlgorithm.html">
+      <a href="../apidocs/org/apache/commons/math3/genetics/GeneticAlgorithm.html">
       GeneticAlgorithm</a> provides an execution framework for Genetic Algorithms (GA).  
-      <a href="../apidocs/org/apache/commons/math/genetics/Population.html">
-      Populations,</a> consisting of <a href="../apidocs/org/apache/commons/math/genetics/Chromosome.html">
+      <a href="../apidocs/org/apache/commons/math3/genetics/Population.html">
+      Populations,</a> consisting of <a href="../apidocs/org/apache/commons/math3/genetics/Chromosome.html">
       Chromosomes</a> are evolved by the <code>GeneticAlgorithm</code> until a 
-      <a href="../apidocs/org/apache/commons/math/genetics/StoppingCondition.html">
-      StoppingCondition</a> is reached. Evolution is determined by <a href="../apidocs/org/apache/commons/math/genetics/SelectionPolicy.html">
-      SelectionPolicy</a>, <a href="../apidocs/org/apache/commons/math/genetics/MutationPolicy.html">
-      MutationPolicy</a> and <a href="../apidocs/org/apache/commons/math/genetics/Fitness.html">
+      <a href="../apidocs/org/apache/commons/math3/genetics/StoppingCondition.html">
+      StoppingCondition</a> is reached. Evolution is determined by <a href="../apidocs/org/apache/commons/math3/genetics/SelectionPolicy.html">
+      SelectionPolicy</a>, <a href="../apidocs/org/apache/commons/math3/genetics/MutationPolicy.html">
+      MutationPolicy</a> and <a href="../apidocs/org/apache/commons/math3/genetics/Fitness.html">
       Fitness</a>.
       </p>
       <p>
@@ -64,10 +64,10 @@
           <ul><li>Apply configured <code>SelectionPolicy</code> to select a pair of parents
                  from <code>current</code></li>
              <li>With probability = 
-                 <a href="../apidocs/org/apache/commons/math/genetics/GeneticAlgorithm.html#getCrossoverRate()">
+                 <a href="../apidocs/org/apache/commons/math3/genetics/GeneticAlgorithm.html#getCrossoverRate()">
                  getCrossoverRate()</a>, apply configured <code>CrossoverPolicy</code> to parents</li>
              <li>With probability = 
-                 <a href="../apidocs/org/apache/commons/math/genetics/GeneticAlgorithm.html#getMutationRate()">
+                 <a href="../apidocs/org/apache/commons/math3/genetics/GeneticAlgorithm.html#getMutationRate()">
                  getMutationRate()</a>,
                  apply configured <code>MutationPolicy</code> to each of the offspring</li>
              <li>Add offspring individually to nextGeneration,
@@ -106,27 +106,27 @@ Chromosome bestFinal = finalPopulation.g
         <table>
         <tr><th>Parameter</th><th>value in example</th><th>meaning</th></tr>
         <tr><td>crossoverPolicy</td>
-        <td><a href="../apidocs/org/apache/commons/math/genetics/OnePointCrossover.html">OnePointCrossover</a></td>
+        <td><a href="../apidocs/org/apache/commons/math3/genetics/OnePointCrossover.html">OnePointCrossover</a></td>
         <td>A random crossover point is selected and the first part from each parent is copied to the corresponding
         child, and the second parts are copied crosswise.</td></tr>
         <tr><td>crossoverRate</td>
         <td>1</td>
         <td>Always apply crossover</td></tr>
         <tr><td>mutationPolicy</td>
-        <td><a href="../apidocs/org/apache/commons/math/genetics/RandomKeyMutation.html">RandomKeyMutation</a></td>
+        <td><a href="../apidocs/org/apache/commons/math3/genetics/RandomKeyMutation.html">RandomKeyMutation</a></td>
         <td>Changes a randomly chosen element of the array representation to a random value uniformly distributed in [0,1].</td></tr>
         <tr><td>mutationRate</td>
         <td>.1</td>
         <td>Apply mutation with probability 0.1 - that is, 10% of the time.</td></tr>
         <tr><td>selectionPolicy</td>
-        <td><a href="../apidocs/org/apache/commons/math/genetics/TournamentSelection.html">TournamentSelection</a></td>
+        <td><a href="../apidocs/org/apache/commons/math3/genetics/TournamentSelection.html">TournamentSelection</a></td>
         <td>Each of the two selected chromosomes is selected based on an n-ary tournament -- this is done by drawing
         n random chromosomes without replacement from the population, and then selecting the fittest chromosome among them.</td></tr>
         </table><br/>
         The algorithm starts with an <code>initial</code> population of <code>Chromosomes.</code> and executes until 
-        the specified <a href="../apidocs/org/apache/commons/math/genetics/StoppingCondition.html">StoppingCondition</a>
+        the specified <a href="../apidocs/org/apache/commons/math3/genetics/StoppingCondition.html">StoppingCondition</a>
         is reached.  In the example above, a
-        <a href="../apidocs/org/apache/commons/math/genetics/FixedGenerationCount.html">FixedGenerationCount</a>
+        <a href="../apidocs/org/apache/commons/math3/genetics/FixedGenerationCount.html">FixedGenerationCount</a>
         stopping condition is used, which means the algorithm proceeds through a fixed number of generations.
       </p>
       </subsection>

Modified: commons/proper/math/trunk/src/site/xdoc/userguide/geometry.xml
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/site/xdoc/userguide/geometry.xml?rev=1291806&r1=1291805&r2=1291806&view=diff
==============================================================================
--- commons/proper/math/trunk/src/site/xdoc/userguide/geometry.xml (original)
+++ commons/proper/math/trunk/src/site/xdoc/userguide/geometry.xml Tue Feb 21 14:31:56 2012
@@ -36,8 +36,8 @@
       </subsection>
       <subsection name="11.2 Euclidean spaces" href="euclidean">
       <p>
-          <a href="../apidocs/org/apache/commons/math/geometry/euclidean/oned/Interval.html">
-          Interval</a> and <a href="../apidocs/org/apache/commons/math/geometry/euclidean/oned/IntervalsSet.html">
+          <a href="../apidocs/org/apache/commons/math3/geometry/euclidean/oned/Interval.html">
+          Interval</a> and <a href="../apidocs/org/apache/commons/math3/geometry/euclidean/oned/IntervalsSet.html">
           IntervalsSet</a> represent one dimensional regions. All classical set operations are available
           for intervals sets: union, intersection, symmetric difference (exclusive or), difference, complement,
           as well as region predicates (point inside/outside/on boundary, emptiness, other region contained).
@@ -46,7 +46,7 @@
           representation.
       </p>
       <p>
-          <a href="../apidocs/org/apache/commons/math/geometry/euclidean/twod/PolygonsSet.html">
+          <a href="../apidocs/org/apache/commons/math3/geometry/euclidean/twod/PolygonsSet.html">
           PolygonsSet</a> represent two dimensional regions. All classical set operations are available
           for polygons sets: union, intersection, symmetric difference (exclusive or), difference, complement,
           as well as region predicates (point inside/outside/on boundary, emptiness, other region contained).
@@ -55,7 +55,7 @@
           or from a boundary representation.
       </p>
       <p>
-          <a href="../apidocs/org/apache/commons/math/geometry/euclidean/threed/PolyhedronsSet.html">
+          <a href="../apidocs/org/apache/commons/math3/geometry/euclidean/threed/PolyhedronsSet.html">
           PolyhedronsSet</a> represent three dimensional regions. All classical set operations are available
           for polyhedrons sets: union, intersection, symmetric difference (exclusive or), difference, complement,
           as well as region predicates (point inside/outside/on boundary, emptiness, other region contained).
@@ -64,7 +64,7 @@
           or from a boundary representation.
       </p>
         <p>
-          <a href="../apidocs/org/apache/commons/math/geometry/euclidean/threed/Vector3D.html">
+          <a href="../apidocs/org/apache/commons/math3/geometry/euclidean/threed/Vector3D.html">
           Vector3D</a> provides a simple vector type. One important feature is
           that instances of this class are guaranteed
           to be immutable, this greatly simplifies modelling dynamical systems
@@ -86,12 +86,12 @@
           is of course also implemented.
         </p>
         <p>
-          <a href="../apidocs/org/apache/commons/math/geometry/euclidean/threed/Vector3DFormat.html">
+          <a href="../apidocs/org/apache/commons/math3/geometry/euclidean/threed/Vector3DFormat.html">
           Vector3DFormat</a> is a specialized format for formatting output or parsing
           input with text representation of 3D vectors.
         </p>
         <p>
-          <a href="../apidocs/org/apache/commons/math/geometry/euclidean/threed/Rotation.html">
+          <a href="../apidocs/org/apache/commons/math3/geometry/euclidean/threed/Rotation.html">
           Rotation</a> represents 3D rotations.
           Rotation instances are also immutable objects, as Vector3D instances.
         </p>
@@ -165,7 +165,7 @@
       </subsection>
       <subsection name="11.3 Binary Space Partitioning" href="partitioning">
 	    <p>
-          <a href="../apidocs/org/apache/commons/math/geometry/partitioning/BSPTree.html">
+          <a href="../apidocs/org/apache/commons/math3/geometry/partitioning/BSPTree.html">
           BSP trees</a> are an efficient way to represent space partitions and
           to associate attributes with each cell. Each node in a BSP tree
           represents a convex region which is partitioned in two convex

Modified: commons/proper/math/trunk/src/site/xdoc/userguide/linear.xml
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/site/xdoc/userguide/linear.xml?rev=1291806&r1=1291805&r2=1291806&view=diff
==============================================================================
--- commons/proper/math/trunk/src/site/xdoc/userguide/linear.xml (original)
+++ commons/proper/math/trunk/src/site/xdoc/userguide/linear.xml Tue Feb 21 14:31:56 2012
@@ -37,7 +37,7 @@
       </subsection>
       <subsection name="3.2 Real matrices" href="real_matrices">
         <p>
-          The <a href="../apidocs/org/apache/commons/math/linear/RealMatrix.html">
+          The <a href="../apidocs/org/apache/commons/math3/linear/RealMatrix.html">
           RealMatrix</a> interface represents a matrix with real numbers as 
           entries.  The following basic matrix operations are supported:
           <ul>
@@ -72,18 +72,18 @@ RealMatrix pInverse = new LUDecompositio
         </p>
         <p>
         The three main implementations of the interface are <a
-        href="../apidocs/org/apache/commons/math/linear/Array2DRowRealMatrix.html">
+        href="../apidocs/org/apache/commons/math3/linear/Array2DRowRealMatrix.html">
         Array2DRowRealMatrix</a> and <a
-        href="../apidocs/org/apache/commons/math/linear/BlockRealMatrix.html">
+        href="../apidocs/org/apache/commons/math3/linear/BlockRealMatrix.html">
         BlockRealMatrix</a> for dense matrices (the second one being more suited to
         dimensions above 50 or 100) and <a
-        href="../apidocs/org/apache/commons/math/linear/SparseRealMatrix.html">
+        href="../apidocs/org/apache/commons/math3/linear/SparseRealMatrix.html">
         SparseRealMatrix</a> for sparse matrices.
         </p>
       </subsection>
       <subsection name="3.3 Real vectors" href="real_vectors">
         <p>
-          The <a href="../apidocs/org/apache/commons/math/linear/RealVector.html">
+          The <a href="../apidocs/org/apache/commons/math3/linear/RealVector.html">
           RealVector</a> interface represents a vector with real numbers as 
           entries.  The following basic matrix operations are supported:
           <ul>
@@ -96,7 +96,7 @@ RealMatrix pInverse = new LUDecompositio
           </ul>
         </p>
         <p>
-          The <a href="../apidocs/org/apache/commons/math/linear/RealVectorFormat.html">
+          The <a href="../apidocs/org/apache/commons/math3/linear/RealVectorFormat.html">
           RealVectorFormat</a> class handles input/output of vectors in a customizable
           textual format.
         </p>
@@ -104,7 +104,7 @@ RealMatrix pInverse = new LUDecompositio
       <subsection name="3.4 Solving linear systems" href="solve">
         <p>
           The <code>solve()</code> methods of the <a
-          href="../apidocs/org/apache/commons/math/linear/DecompositionSolver.html">DecompositionSolver</a>
+          href="../apidocs/org/apache/commons/math3/linear/DecompositionSolver.html">DecompositionSolver</a>
           interface support solving linear systems of equations of the form AX=B, either
           in linear sense or in least square sense. A <code>RealMatrix</code> instance is
           used to represent the coefficient matrix of the system. Solving the system is a
@@ -151,11 +151,11 @@ RealVector solution = solver.solve(const
           <table border="1" align="center">
           <tr BGCOLOR="#CCCCFF"><td colspan="2"><font size="+2">Decomposition algorithms</font></td></tr>
           <tr BGCOLOR="#EEEEFF"><font size="+1"><td>Name</td><td>coefficients matrix</td><td>problem type</td></font></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/linear/LUDecomposition.html">LU</a></td><td>square</td><td>exact solution only</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/linear/CholeskyDecomposition.html">Cholesky</a></td><td>symmetric positive definite</td><td>exact solution only</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/linear/QRDecomposition.html">QR</a></td><td>any</td><td>least squares solution</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/linear/EigenDecomposition.html">eigen decomposition</a></td><td>square</td><td>exact solution only</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/linear/SingularValueDecomposition.html">SVD</a></td><td>any</td><td>least squares solution</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/linear/LUDecomposition.html">LU</a></td><td>square</td><td>exact solution only</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/linear/CholeskyDecomposition.html">Cholesky</a></td><td>symmetric positive definite</td><td>exact solution only</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/linear/QRDecomposition.html">QR</a></td><td>any</td><td>least squares solution</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/linear/EigenDecomposition.html">eigen decomposition</a></td><td>square</td><td>exact solution only</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/linear/SingularValueDecomposition.html">SVD</a></td><td>any</td><td>least squares solution</td></tr>
           </table>
         </p>
         <p>
@@ -190,13 +190,13 @@ RealVector solution = solver.solve(const
       <subsection name="3.6 Non-real fields (complex, fractions ...)" href="field">
         <p>
           In addition to the real field, matrices and vectors using non-real <a
-          href="../apidocs/org/apache/commons/math/FieldElement.html">field elements</a> can be used.
+          href="../apidocs/org/apache/commons/math3/FieldElement.html">field elements</a> can be used.
           The fields already supported by the library are:
           <ul>
-            <li><a href="../apidocs/org/apache/commons/math/complex/Complex.html">Complex</a></li>
-            <li><a href="../apidocs/org/apache/commons/math/fraction/Fraction.html">Fraction</a></li>
-            <li><a href="../apidocs/org/apache/commons/math/fraction/BigFraction.html">BigFraction</a></li>
-            <li><a href="../apidocs/org/apache/commons/math/util/BigReal.html">BigReal</a></li>
+            <li><a href="../apidocs/org/apache/commons/math3/complex/Complex.html">Complex</a></li>
+            <li><a href="../apidocs/org/apache/commons/math3/fraction/Fraction.html">Fraction</a></li>
+            <li><a href="../apidocs/org/apache/commons/math3/fraction/BigFraction.html">BigFraction</a></li>
+            <li><a href="../apidocs/org/apache/commons/math3/util/BigReal.html">BigReal</a></li>
           </ul>
         </p>
       </subsection>

Modified: commons/proper/math/trunk/src/site/xdoc/userguide/ode.xml
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/site/xdoc/userguide/ode.xml?rev=1291806&r1=1291805&r2=1291806&view=diff
==============================================================================
--- commons/proper/math/trunk/src/site/xdoc/userguide/ode.xml (original)
+++ commons/proper/math/trunk/src/site/xdoc/userguide/ode.xml Tue Feb 21 14:31:56 2012
@@ -40,7 +40,7 @@
           All integrators provide dense output. This means that besides computing the state vector
           at discrete times, they also provide a cheap mean to get both the state and its derivative
           between the time steps. They do so through classes extending the
-          <a href="../apidocs/org/apache/commons/math/ode/sampling/StepInterpolator.html">StepInterpolator</a>
+          <a href="../apidocs/org/apache/commons/math3/ode/sampling/StepInterpolator.html">StepInterpolator</a>
           abstract class, which are made available to the user at the end of each step.
         </p>
         <p>
@@ -64,9 +64,9 @@
         </p>
         <p>
           The user should describe his problem in his own classes which should implement the
-          <a href="../apidocs/org/apache/commons/math/ode/FirstOrderDifferentialEquations.html">FirstOrderDifferentialEquations</a>
+          <a href="../apidocs/org/apache/commons/math3/ode/FirstOrderDifferentialEquations.html">FirstOrderDifferentialEquations</a>
           interface. Then he should pass it to the integrator he prefers among all the classes that implement
-          the <a href="../apidocs/org/apache/commons/math/ode/FirstOrderIntegrator.html">FirstOrderIntegrator</a>
+          the <a href="../apidocs/org/apache/commons/math3/ode/FirstOrderIntegrator.html">FirstOrderIntegrator</a>
           interface. The following example shows how to implement the simple two-dimensional problem:
           <ul>
             <li>y'<sub>0</sub>(t) = &#x3c9; &#xD7; (c<sub>1</sub> - y<sub>1</sub>(t))</li>
@@ -116,10 +116,10 @@ dp853.integrate(ode, 0.0, y, 16.0, y); /
           <code>FirstOrderIntegrator.integrate</code> method, as shown by previous example. The second one
           should be used when more in-depth information is needed throughout the integration process. The user
           can register an object implementing the
-          <a href="../apidocs/org/apache/commons/math/ode/sampling/StepHandler.html">StepHandler</a> interface or a
-          <a href="../apidocs/org/apache/commons/math/ode/sampling/StepNormalizer.html">StepNormalizer</a> object wrapping
+          <a href="../apidocs/org/apache/commons/math3/ode/sampling/StepHandler.html">StepHandler</a> interface or a
+          <a href="../apidocs/org/apache/commons/math3/ode/sampling/StepNormalizer.html">StepNormalizer</a> object wrapping
           a user-specified object implementing the
-          <a href="../apidocs/org/apache/commons/math/ode/sampling/FixedStepHandler.html">FixedStepHandler</a> interface
+          <a href="../apidocs/org/apache/commons/math3/ode/sampling/FixedStepHandler.html">FixedStepHandler</a> interface
           into the integrator before calling the <code>FirstOrderIntegrator.integrate</code> method. The user object
           will be called appropriately during the integration process, allowing the user to process intermediate
           results. The default step handler does nothing. Considering again the previous example, we want to print the
@@ -140,7 +140,7 @@ StepHandler stepHandler = new StepHandle
 integrator.addStepHandler(stepHandler);
         </source>
         <p>
-          <a href="../apidocs/org/apache/commons/math/ode/ContinuousOutputModel.html">ContinuousOutputModel</a>
+          <a href="../apidocs/org/apache/commons/math3/ode/ContinuousOutputModel.html">ContinuousOutputModel</a>
           is a special-purpose step handler that is able to store all steps and to provide transparent access to
           any intermediate result once the integration is over. An important feature of this class is that it
           implements the <code>Serializable</code> interface. This means that a complete continuous model of the
@@ -149,10 +149,10 @@ integrator.addStepHandler(stepHandler);
           Only the result of the integration is stored, there is no reference to the integrated problem by itself.
         </p>
         <p>
-          Other default implementations of the <a href="../apidocs/org/apache/commons/math/ode/sampling/StepHandler.html">StepHandler</a>
+          Other default implementations of the <a href="../apidocs/org/apache/commons/math3/ode/sampling/StepHandler.html">StepHandler</a>
           interface are available for general needs
-          (<a href="../apidocs/org/apache/commons/math/ode/sampling/DummyStepHandler.html">DummyStepHandler</a>,
-          <a href="../apidocs/org/apache/commons/math/ode/sampling/StepNormalizer.html">StepNormalizer</a>) and custom
+          (<a href="../apidocs/org/apache/commons/math3/ode/sampling/DummyStepHandler.html">DummyStepHandler</a>,
+          <a href="../apidocs/org/apache/commons/math3/ode/sampling/StepNormalizer.html">StepNormalizer</a>) and custom
           implementations can be developed for specific needs. As an example, if an application is to be
           completely driven by the integration process, then most of the application code will be run inside a
           step handler specific to this application.
@@ -161,11 +161,11 @@ integrator.addStepHandler(stepHandler);
           Some integrators (the simple ones) use fixed steps that are set at creation time. The more efficient
           integrators use variable steps that are handled internally in order to control the integration error
           with respect to a specified accuracy (these integrators extend the
-          <a href="../apidocs/org/apache/commons/math/ode/AdaptiveStepsizeIntegrator.html">AdaptiveStepsizeIntegrator</a>
+          <a href="../apidocs/org/apache/commons/math3/ode/AdaptiveStepsizeIntegrator.html">AdaptiveStepsizeIntegrator</a>
           abstract class). In this case, the step handler which is called after each successful step shows up
-          the variable stepsize. The <a href="../apidocs/org/apache/commons/math/ode/sampling/StepNormalizer.html">StepNormalizer</a>
+          the variable stepsize. The <a href="../apidocs/org/apache/commons/math3/ode/sampling/StepNormalizer.html">StepNormalizer</a>
           class can be used to convert the variable stepsize into a fixed stepsize that can be handled by classes
-          implementing the <a href="../apidocs/org/apache/commons/math/ode/sampling/FixedStepHandler.html">FixedStepHandler</a>
+          implementing the <a href="../apidocs/org/apache/commons/math3/ode/sampling/FixedStepHandler.html">FixedStepHandler</a>
           interface. Adaptive stepsize integrators can automatically compute the initial stepsize by themselves,
           however the user can specify it if he prefers to retain full control over the integration or if the
           automatic guess is wrong.
@@ -180,7 +180,7 @@ integrator.addStepHandler(stepHandler);
         </p>
         <p>
           Discrete events detection is based on switching functions. The user provides
-          a simple <a href="../apidocs/org/apache/commons/math/ode/events/EventHandler.html">g(t, y)</a>
+          a simple <a href="../apidocs/org/apache/commons/math3/ode/events/EventHandler.html">g(t, y)</a>
           function depending on the current time and state. The integrator will monitor
           the value of the function throughout integration range and will trigger the
           event when its sign changes. The magnitude of the value is almost irrelevant.
@@ -260,23 +260,23 @@ public int eventOccurred(double t, doubl
           <table border="1" align="center">
           <tr BGCOLOR="#CCCCFF"><td colspan="2"><font size="+2">Fixed Step Integrators</font></td></tr>
           <tr BGCOLOR="#EEEEFF"><font size="+1"><td>Name</td><td>Order</td></font></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/ode/nonstiff/EulerIntegrator.html">Euler</a></td><td>1</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/ode/nonstiff/MidpointIntegrator.html">Midpoint</a></td><td>2</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/ode/nonstiff/ClassicalRungeKuttaIntegrator.html">Classical Runge-Kutta</a></td><td>4</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/ode/nonstiff/GillIntegrator.html">Gill</a></td><td>4</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/ode/nonstiff/ThreeEighthesIntegrator.html">3/8</a></td><td>4</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/ode/nonstiff/EulerIntegrator.html">Euler</a></td><td>1</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/ode/nonstiff/MidpointIntegrator.html">Midpoint</a></td><td>2</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/ode/nonstiff/ClassicalRungeKuttaIntegrator.html">Classical Runge-Kutta</a></td><td>4</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/ode/nonstiff/GillIntegrator.html">Gill</a></td><td>4</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/ode/nonstiff/ThreeEighthesIntegrator.html">3/8</a></td><td>4</td></tr>
           </table>
         </p>
         <p>
           <table border="1" align="center">
           <tr BGCOLOR="#CCCCFF"><td colspan="3"><font size="+2">Adaptive Stepsize Integrators</font></td></tr>
           <tr BGCOLOR="#EEEEFF"><font size="+1"><td>Name</td><td>Integration Order</td><td>Error Estimation Order</td></font></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/ode/nonstiff/HighamHall54Integrator.html">Higham and Hall</a></td><td>5</td><td>4</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/ode/nonstiff/DormandPrince54Integrator.html">Dormand-Prince 5(4)</a></td><td>5</td><td>4</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/ode/nonstiff/DormandPrince853Integrator.html">Dormand-Prince 8(5,3)</a></td><td>8</td><td>5 and 3</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/ode/nonstiff/GraggBulirschStoerIntegrator.html">Gragg-Bulirsch-Stoer</a></td><td>variable (up to 18 by default)</td><td>variable</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/ode/nonstiff/AdamsBashforthIntegrator.html">Adams-Bashforth</a></td><td>variable</td><td>variable</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/ode/nonstiff/AdamsMoultonIntegrator.html">Adams-Moulton</a></td><td>variable</td><td>variable</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/ode/nonstiff/HighamHall54Integrator.html">Higham and Hall</a></td><td>5</td><td>4</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/ode/nonstiff/DormandPrince54Integrator.html">Dormand-Prince 5(4)</a></td><td>5</td><td>4</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/ode/nonstiff/DormandPrince853Integrator.html">Dormand-Prince 8(5,3)</a></td><td>8</td><td>5 and 3</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/ode/nonstiff/GraggBulirschStoerIntegrator.html">Gragg-Bulirsch-Stoer</a></td><td>variable (up to 18 by default)</td><td>variable</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/ode/nonstiff/AdamsBashforthIntegrator.html">Adams-Bashforth</a></td><td>variable</td><td>variable</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/ode/nonstiff/AdamsMoultonIntegrator.html">Adams-Moulton</a></td><td>variable</td><td>variable</td></tr>
           </table>
         </p>
       </subsection>
@@ -285,7 +285,7 @@ public int eventOccurred(double t, doubl
           If in addition to state y(t) the user needs to compute the sensitivity of the state to
           the initial state or some parameter of the ODE, he will use the classes and interfaces
           from the <a
-          href="../apidocs/org/apache/commons/math/ode/jacobians/package-summary.html">org.apache.commons.ode.jacobians</a>
+          href="../apidocs/org/apache/commons/math3/ode/jacobians/package-summary.html">org.apache.commons.ode.jacobians</a>
           package instead of the top level ode package. These classes compute the jacobians
           dy(t)/dy<sub>0</sub> and dy(t)/dp where y<sub>0</sub> is the initial state
           and p is some ODE parameter.
@@ -323,9 +323,9 @@ public int eventOccurred(double t, doubl
         <p>
           If the function f is too complex, the user can simply rely on internal differentiation
           using finite differences to compute these local jacobians. So rather than the <a
-          href="../apidocs/org/apache/commons/math/ode/FirstOrderDifferentialEquations.html">FirstOrderDifferentialEquations</a>
+          href="../apidocs/org/apache/commons/math3/ode/FirstOrderDifferentialEquations.html">FirstOrderDifferentialEquations</a>
           interface he will implement the <a
-          href="../apidocs/org/apache/commons/math/ode/jacobians/ParameterizedODE.html">ParameterizedODE</a>
+          href="../apidocs/org/apache/commons/math3/ode/jacobians/ParameterizedODE.html">ParameterizedODE</a>
           interface. Considering again our example where only &#x3c9; is considered a parameter, we get:
         </p>
         <source>
@@ -373,9 +373,9 @@ integrator.integrate(t0, y0, dy0dp, t, y
         <p>
           If the function f is simple, the user can simply provide the local jacobians
           by himself. So rather than the <a
-          href="../apidocs/org/apache/commons/math/ode/FirstOrderDifferentialEquations.html">FirstOrderDifferentialEquations</a>
+          href="../apidocs/org/apache/commons/math3/ode/FirstOrderDifferentialEquations.html">FirstOrderDifferentialEquations</a>
           interface he will implement the <a
-          href="../apidocs/org/apache/commons/math/ode/jacobians/ODEWithJacobians.html">ODEWithJacobians</a>
+          href="../apidocs/org/apache/commons/math3/ode/jacobians/ODEWithJacobians.html">ODEWithJacobians</a>
           interface. Considering again our example where only &#x3c9; is considered a parameter, we get:
         </p>
         <source>

Modified: commons/proper/math/trunk/src/site/xdoc/userguide/optimization.xml
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/site/xdoc/userguide/optimization.xml?rev=1291806&r1=1291805&r2=1291806&view=diff
==============================================================================
--- commons/proper/math/trunk/src/site/xdoc/userguide/optimization.xml (original)
+++ commons/proper/math/trunk/src/site/xdoc/userguide/optimization.xml Tue Feb 21 14:31:56 2012
@@ -54,7 +54,7 @@
         </p>
         <p>
         The type of goal, i.e. minimization or maximization, is defined by the enumerated
-        <a href="../apidocs/org/apache/commons/math/optimization/GoalType.html">
+        <a href="../apidocs/org/apache/commons/math3/optimization/GoalType.html">
         GoalType</a> which has only two values: <code>MAXIMIZE</code> and <code>MINIMIZE</code>.
         </p>
         <p>
@@ -63,21 +63,21 @@
         are only four interfaces defining the common behavior of optimizers, one for each
         supported type of objective function:
         <ul>
-          <li><a href="../apidocs/org/apache/commons/math/optimization/UnivariateRealOptimizer.html">
+          <li><a href="../apidocs/org/apache/commons/math3/optimization/UnivariateRealOptimizer.html">
               UnivariateRealOptimizer</a> for <a
-              href="../apidocs/org/apache/commons/math/analysis/UnivariateRealFunction.html">
+              href="../apidocs/org/apache/commons/math3/analysis/UnivariateRealFunction.html">
               univariate real functions</a></li>
-          <li><a href="../apidocs/org/apache/commons/math/optimization/MultivariateRealOptimizer.html">
+          <li><a href="../apidocs/org/apache/commons/math3/optimization/MultivariateRealOptimizer.html">
               MultivariateRealOptimizer</a> for <a
-              href="../apidocs/org/apache/commons/math/analysis/MultivariateRealFunction.html">
+              href="../apidocs/org/apache/commons/math3/analysis/MultivariateRealFunction.html">
               multivariate real functions</a></li>
-          <li><a href="../apidocs/org/apache/commons/math/optimization/DifferentiableMultivariateRealOptimizer.html">
+          <li><a href="../apidocs/org/apache/commons/math3/optimization/DifferentiableMultivariateRealOptimizer.html">
               DifferentiableMultivariateRealOptimizer</a> for <a
-              href="../apidocs/org/apache/commons/math/analysis/DifferentiableMultivariateRealFunction.html">
+              href="../apidocs/org/apache/commons/math3/analysis/DifferentiableMultivariateRealFunction.html">
               differentiable multivariate real functions</a></li>
-          <li><a href="../apidocs/org/apache/commons/math/optimization/DifferentiableMultivariateVectorialOptimizer.html">
+          <li><a href="../apidocs/org/apache/commons/math3/optimization/DifferentiableMultivariateVectorialOptimizer.html">
               DifferentiableMultivariateVectorialOptimizer</a> for <a
-              href="../apidocs/org/apache/commons/math/analysis/DifferentiableMultivariateVectorialFunction.html">
+              href="../apidocs/org/apache/commons/math3/analysis/DifferentiableMultivariateVectorialFunction.html">
               differentiable multivariate vectorial functions</a></li>
         </ul>
         </p>
@@ -85,14 +85,14 @@
         <p>
         Despite there are only four types of supported optimizers, it is possible to optimize
         a transform a <a
-        href="../apidocs/org/apache/commons/math/analysis/MultivariateVectorialFunction.html">
+        href="../apidocs/org/apache/commons/math3/analysis/MultivariateVectorialFunction.html">
         non-differentiable multivariate vectorial function</a> by converting it to a <a
-        href="../apidocs/org/apache/commons/math/analysis/MultivariateRealFunction.html">
+        href="../apidocs/org/apache/commons/math3/analysis/MultivariateRealFunction.html">
         non-differentiable multivariate real function</a> thanks to the <a
-        href="../apidocs/org/apache/commons/math/optimization/LeastSquaresConverter.html">
+        href="../apidocs/org/apache/commons/math3/optimization/LeastSquaresConverter.html">
         LeastSquaresConverter</a> helper class. The transformed function can be optimized using
         any implementation of the <a
-        href="../apidocs/org/apache/commons/math/optimization/MultivariateRealOptimizer.html">
+        href="../apidocs/org/apache/commons/math3/optimization/MultivariateRealOptimizer.html">
         MultivariateRealOptimizer</a> interface.
         </p>
 
@@ -106,7 +106,7 @@
       </subsection>
       <subsection name="12.2 Univariate Functions" href="univariate">
         <p>
-          A <a href="../apidocs/org/apache/commons/math/optimization/UnivariateRealOptimizer.html">
+          A <a href="../apidocs/org/apache/commons/math3/optimization/UnivariateRealOptimizer.html">
           UnivariateRealOptimizer</a> is used to find the minimal values of a univariate real-valued
           function <code>f</code>.
         </p>
@@ -157,16 +157,16 @@
           The <code>direct</code> package provides four solvers:
           <ul>
             <li>the classical <a
-                href="../apidocs/org/apache/commons/math/optimization/direct/NelderMeadSimplex.html">
+                href="../apidocs/org/apache/commons/math3/optimization/direct/NelderMeadSimplex.html">
                 Nelder-Mead</a> method,</li>
             <li>Virginia Torczon's <a
-                href="../apidocs/org/apache/commons/math/optimization/direct/MultiDirectionalSimplex.html">
+                href="../apidocs/org/apache/commons/math3/optimization/direct/MultiDirectionalSimplex.html">
                 multi-directional</a> method,</li>
             <li>Nikolaus Hansen's <a
-               href="../apidocs/org/apache/commons/math/optimization/direct/CMAESOptimizer.html">
+               href="../apidocs/org/apache/commons/math3/optimization/direct/CMAESOptimizer.html">
                </a>Covariance Matrix Adaptation Evolution Strategy (CMA-ES),</li>
             <li>Mike Powell's <a
-               href="../apidocs/org/apache/commons/math/optimization/direct/BOBYQAOptimizer.html">
+               href="../apidocs/org/apache/commons/math3/optimization/direct/BOBYQAOptimizer.html">
                BOBYQA</a> method.
             </li>
           </ul>
@@ -174,9 +174,9 @@
         <p>
           The first two simplex-based methods do not handle simple bounds constraints by themselves.
           However there are two adapters(<a
-          href="../apidocs/org/apache/commons/math/optimization/direct/MultivariateRealFunctionMappingAdapter.html">
+          href="../apidocs/org/apache/commons/math3/optimization/direct/MultivariateRealFunctionMappingAdapter.html">
           MultivariateRealFunctionMappingAdapter</a> and <a
-          href="../apidocs/org/apache/commons/math/optimization/direct/MultivariateRealFunctionPenaltyAdapter.html">
+          href="../apidocs/org/apache/commons/math3/optimization/direct/MultivariateRealFunctionPenaltyAdapter.html">
           MultivariateRealFunctionPenaltyAdapter</a>) that can be used to wrap the user function in
           such a way the wrapped function is unbounded and can be used with these optimizers, despite
           the fact the underlying function is still bounded and will be called only with feasible
@@ -230,15 +230,15 @@
         <p>
           Two optimizers are available in the general package, both devoted to least-squares
           problems. The first one is based on the <a
-          href="../apidocs/org/apache/commons/math/optimization/general/GaussNewtonOptimizer.html">
+          href="../apidocs/org/apache/commons/math3/optimization/general/GaussNewtonOptimizer.html">
           Gauss-Newton</a> method. The second one is the <a
-          href="../apidocs/org/apache/commons/math/optimization/general/LevenbergMarquardtOptimizer.html">
+          href="../apidocs/org/apache/commons/math3/optimization/general/LevenbergMarquardtOptimizer.html">
           Levenberg-Marquardt</a> method.
         </p>
         <p>
           In order to solve a vectorial optimization problem, the user must provide it as
           an object implementing the <a
-          href="../apidocs/org/apache/commons/math/analysis/DifferentiableMultivariateVectorialFunction.html">
+          href="../apidocs/org/apache/commons/math3/analysis/DifferentiableMultivariateVectorialFunction.html">
           DifferentiableMultivariateVectorialFunction</a> interface. The object will be provided to
           the <code>estimate</code> method of the optimizer, along with the target and weight arrays,
           thus allowing the optimizer to compute the residuals at will. The last parameter to the
@@ -303,7 +303,7 @@
 </table>
 
 <p>
-First we need to implement the interface <a href="../apidocs/org/apache/commons/math/analysis/DifferentiableMultivariateVectorialFunction.html">DifferentiableMultivariateVectorialFunction</a>.
+First we need to implement the interface <a href="../apidocs/org/apache/commons/math3/analysis/DifferentiableMultivariateVectorialFunction.html">DifferentiableMultivariateVectorialFunction</a>.
 This requires the implementation of the method signatures:
 </p>
 
@@ -571,17 +571,17 @@ C: 16.324008168386605
     </dd></dl>
         <p>
           In addition to least squares solving, the <a
-          href="../apidocs/org/apache/commons/math/optimization/general/NonLinearConjugateGradientOptimizer.html">
+          href="../apidocs/org/apache/commons/math3/optimization/general/NonLinearConjugateGradientOptimizer.html">
           NonLinearConjugateGradientOptimizer</a> class provides a non-linear conjugate gradient algorithm
           to optimize <a
-          href="../apidocs/org/apache/commons/math/optimization/DifferentiableMultivariateRealFunction.html">
+          href="../apidocs/org/apache/commons/math3/optimization/DifferentiableMultivariateRealFunction.html">
           DifferentiableMultivariateRealFunction</a>. Both the Fletcher-Reeves and the Polak-Ribi&#232;re
           search direction update methods are supported. It is also possible to set up a preconditioner
           or to change the line-search algorithm of the inner loop if desired (the default one is a Brent
           solver).
         </p>
         <p>
-          The <a href="../apidocs/org/apache/commons/math/optimization/general/PowellOptimizer.html">
+          The <a href="../apidocs/org/apache/commons/math3/optimization/general/PowellOptimizer.html">
           PowellOptimizer</a> provides an optimization method for non-differentiable functions.
         </p>
       </subsection>
@@ -608,16 +608,16 @@ C: 16.324008168386605
         </p>
         <p>
           The <a
-          href="../apidocs/org/apache/commons/math/optimization/fitting/CurveFitter.html">
+          href="../apidocs/org/apache/commons/math3/optimization/fitting/CurveFitter.html">
           CurveFitter</a> class provides curve fitting for general curves. Users must
           provide their own implementation of the curve template as a class implementing
           the <a
-          href="../apidocs/org/apache/commons/math/optimization/fitting/ParametricRealFunction.html">
+          href="../apidocs/org/apache/commons/math3/optimization/fitting/ParametricRealFunction.html">
           ParametricRealFunction</a> interface and they must provide the initial guess of the
           parameters. The more specialized <a
-          href="../apidocs/org/apache/commons/math/optimization/fitting/PolynomialFitter.html">
+          href="../apidocs/org/apache/commons/math3/optimization/fitting/PolynomialFitter.html">
           PolynomialFitter</a> and <a
-          href="../apidocs/org/apache/commons/math/optimization/fitting/HarmonicFitter.html">
+          href="../apidocs/org/apache/commons/math3/optimization/fitting/HarmonicFitter.html">
           HarmonicFitter</a> classes require neither an implementation of the parametric real function
           not an initial guess as they are able to compute them by themselves.
         </p>

Modified: commons/proper/math/trunk/src/site/xdoc/userguide/overview.xml
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/site/xdoc/userguide/overview.xml?rev=1291806&r1=1291805&r2=1291806&view=diff
==============================================================================
--- commons/proper/math/trunk/src/site/xdoc/userguide/overview.xml (original)
+++ commons/proper/math/trunk/src/site/xdoc/userguide/overview.xml Tue Feb 21 14:31:56 2012
@@ -104,9 +104,9 @@
   <p>
     When the actual parameters provided to a method or the internal state of an object 
     make a computation meaningless, a
-    <a href="../apidocs/org/apache/commons/math/exception/MathIllegalArgumentException.html">
+    <a href="../apidocs/org/apache/commons/math3/exception/MathIllegalArgumentException.html">
       IllegalArgumentException</a> or
-    <a href="../apidocs/org/apache/commons/math/exception/MathIllegalStateException.html">
+    <a href="../apidocs/org/apache/commons/math3/exception/MathIllegalStateException.html">
       MathIllegalStateException</a> may be thrown. Exact conditions under which runtime
     exceptions (and any other exceptions) are thrown are specified in the javadoc method
     comments.
@@ -118,7 +118,7 @@
   <p>
     As of version 2.2, the policy for dealing with null references is as
     follows: When an argument is unexpectedly null, a
-    <a href="../apidocs/org/apache/commons/math/exception/NullArgumentException.html">
+    <a href="../apidocs/org/apache/commons/math3/exception/NullArgumentException.html">
       NullArgumentException</a> is raised for signalling the illegal argument. Note that this
     class does not inherit from the standard <code>NullPointerException</code> but is a subclass
     of <code>MathIllegalArgumentException</code>.

Modified: commons/proper/math/trunk/src/site/xdoc/userguide/random.xml
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/site/xdoc/userguide/random.xml?rev=1291806&r1=1291805&r2=1291806&view=diff
==============================================================================
--- commons/proper/math/trunk/src/site/xdoc/userguide/random.xml (original)
+++ commons/proper/math/trunk/src/site/xdoc/userguide/random.xml Tue Feb 21 14:31:56 2012
@@ -68,7 +68,7 @@
 
 <subsection name="2.2 Random numbers" href="deviates">
     <p>
-    The <a href="../apidocs/org/apache/commons/math/random/RandomData.html">
+    The <a href="../apidocs/org/apache/commons/math3/random/RandomData.html">
     RandomData</a> interface defines methods for generating random sequences
     of numbers. The API contracts of these methods use the following concepts:
     <dl>
@@ -87,10 +87,10 @@
     ranges in the set  of possible values of a random variable have
     different probabilities of containing the value.  Commons Math supports
     generating random sequences from each of the distributions in the
-    <a href="../apidocs/org/apache/commons/math/distribution/package-summary.html">
+    <a href="../apidocs/org/apache/commons/math3/distribution/package-summary.html">
     distributions</a> package.
     The javadoc for the <code>nextXxx</code> methods in 
-    <a href="../apidocs/org/apache/commons/math/random/RandomDataImpl.html">
+    <a href="../apidocs/org/apache/commons/math3/random/RandomDataImpl.html">
     RandomDataImpl</a> describes the algorithms used to generate
     random deviates.   
     </dd>
@@ -168,11 +168,11 @@ for (int i = 0; i &lt; 1000; i++) {
     Some algorithms require random vectors instead of random scalars. When the
     components of these vectors are uncorrelated, they may be generated simply
     one at a time and packed together in the vector. The <a
-    href="../apidocs/org/apache/commons/math/random/UncorrelatedRandomVectorGenerator.html">
+    href="../apidocs/org/apache/commons/math3/random/UncorrelatedRandomVectorGenerator.html">
     UncorrelatedRandomVectorGenerator</a> class simplifies this
     process by setting the mean and deviation of each component once and
     generating complete vectors. When the components are correlated however,
-    generating them is much more difficult. The <a href="../apidocs/org/apache/commons/math/random/CorrelatedRandomVectorGenerator.html">
+    generating them is much more difficult. The <a href="../apidocs/org/apache/commons/math3/random/CorrelatedRandomVectorGenerator.html">
     CorrelatedRandomVectorGenerator</a> class provides this service. In this
     case, the user must set up a complete covariance matrix instead of a simple
     standard deviations vector. This matrix gathers both the variance and the
@@ -221,10 +221,10 @@ RealMatrix covariance = MatrixUtils.crea
     <p>
     In addition to multivariate normal distributions, correlated vectors from multivariate uniform
     distributions can be generated by creating a
-    <a href="../apidocs/org/apache/commons/math/random/UniformRandomGenerator.html">UniformRandomGenerator</a>
+    <a href="../apidocs/org/apache/commons/math3/random/UniformRandomGenerator.html">UniformRandomGenerator</a>
     in place of the 
     <code>GaussianRandomGenerator</code> above.  More generally, any
-    <a href="../apidocs/org/apache/commons/math/random/NormalizedRandomGenerator.html">NormalizedRandomGenerator</a>
+    <a href="../apidocs/org/apache/commons/math3/random/NormalizedRandomGenerator.html">NormalizedRandomGenerator</a>
     may be used.
     </p>
 </subsection>
@@ -345,41 +345,41 @@ RealMatrix covariance = MatrixUtils.crea
       generation utilities and to provide a generic means to replace 
       <code>java.util.Random</code> in applications, a random generator 
       adaptor framework has been added to commons-math.  The
-      <a href="../apidocs/org/apache/commons/math/random/RandomGenerator.html">
+      <a href="../apidocs/org/apache/commons/math3/random/RandomGenerator.html">
       RandomGenerator</a> interface abstracts the public interface of
       <code>java.util.Random</code> and any implementation of this
       interface can be used as the source of random data for the commons-math 
       data generation classes.  An abstract base class, 
-      <a href="../apidocs/org/apache/commons/math/random/AbstractRandomGenerator.html">
+      <a href="../apidocs/org/apache/commons/math3/random/AbstractRandomGenerator.html">
       AbstractRandomGenerator</a> is provided to make implementation easier.
       This class provides default implementations of "derived" data generation
       methods based on the primitive,  <code>nextDouble()</code>.
       To support generic replacement of <code>java.util.Random</code>, the 
-      <a href="../apidocs/org/apache/commons/math/random/RandomAdaptor.html">
+      <a href="../apidocs/org/apache/commons/math3/random/RandomAdaptor.html">
       RandomAdaptor</a> class is provided, which extends
       <code>java.util.Random</code> and wraps and delegates calls to
       a <code>RandomGenerator</code> instance.   
   </p>
 
       <p>Commons-math provides by itself several implementations of the <a
-      href="../apidocs/org/apache/commons/math/random/RandomGenerator.html">
+      href="../apidocs/org/apache/commons/math3/random/RandomGenerator.html">
       RandomGenerator</a> interface:
       <ul>
-        <li><a href="../apidocs/org/apache/commons/math/random/JDKRandomGenerator.html">JDKRandomGenerator</a>
+        <li><a href="../apidocs/org/apache/commons/math3/random/JDKRandomGenerator.html">JDKRandomGenerator</a>
             that extends the JDK provided generator</li>
-        <li><a href="../apidocs/org/apache/commons/math/random/AbstractRandomGenerator.html">
+        <li><a href="../apidocs/org/apache/commons/math3/random/AbstractRandomGenerator.html">
             AbstractRandomGenerator</a> as a helper for users generators</li>
-        <li><a href="../apidocs/org/apache/commons/math/random/BitStreamGenerator.html">
+        <li><a href="../apidocs/org/apache/commons/math3/random/BitStreamGenerator.html">
             BitStreamGenerator</a> which is an abstract class for several generators and
             which in turn is extended by:
             <ul>
-              <li><a href="../apidocs/org/apache/commons/math/random/MersenneTwister.html">MersenneTwister</a></li>
-              <li><a href="../apidocs/org/apache/commons/math/random/Well512a.html">Well512a</a></li>
-              <li><a href="../apidocs/org/apache/commons/math/random/Well1024a.html">Well1024a</a></li>
-              <li><a href="../apidocs/org/apache/commons/math/random/Well19937a.html">Well19937a</a></li>
-              <li><a href="../apidocs/org/apache/commons/math/random/Well19937c.html">Well19937c</a></li>
-              <li><a href="../apidocs/org/apache/commons/math/random/Well44497a.html">Well44497a</a></li>
-              <li><a href="../apidocs/org/apache/commons/math/random/Well44497b.html">Well44497b</a></li>
+              <li><a href="../apidocs/org/apache/commons/math3/random/MersenneTwister.html">MersenneTwister</a></li>
+              <li><a href="../apidocs/org/apache/commons/math3/random/Well512a.html">Well512a</a></li>
+              <li><a href="../apidocs/org/apache/commons/math3/random/Well1024a.html">Well1024a</a></li>
+              <li><a href="../apidocs/org/apache/commons/math3/random/Well19937a.html">Well19937a</a></li>
+              <li><a href="../apidocs/org/apache/commons/math3/random/Well19937c.html">Well19937c</a></li>
+              <li><a href="../apidocs/org/apache/commons/math3/random/Well44497a.html">Well44497a</a></li>
+              <li><a href="../apidocs/org/apache/commons/math3/random/Well44497b.html">Well44497b</a></li>
             </ul>
           </li>
         </ul>
@@ -450,21 +450,21 @@ RealMatrix covariance = MatrixUtils.crea
         <table border="1" align="center">
           <tr BGCOLOR="#CCCCFF"><td colspan="2"><font size="+2">Example of performances</font></td></tr>
           <tr BGCOLOR="#EEEEFF"><font size="+1"><td>Name</td><td>generation rate (relative to MersenneTwister)</td></font></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/random/MersenneTwister.html">MersenneTwister</a></td><td>1</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/random/JDKRandomGenerator.html">JDKRandomGenerator</a></td><td>between 0.96 and 1.16</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/random/Well512a.html">Well512a</a></td><td>between 0.85 and 0.88</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/random/Well1024a.html">Well1024a</a></td><td>between 0.63 and 0.73</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/random/Well19937a.html">Well19937a</a></td><td>between 0.70 and 0.71</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/random/Well19937c.html">Well19937c</a></td><td>between 0.57 and 0.71</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/random/Well44497a.html">Well44497a</a></td><td>between 0.69 and 0.71</td></tr>
-          <tr><td><a href="../apidocs/org/apache/commons/math/random/Well44497b.html">Well44497b</a></td><td>between 0.65 and 0.71</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/random/MersenneTwister.html">MersenneTwister</a></td><td>1</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/random/JDKRandomGenerator.html">JDKRandomGenerator</a></td><td>between 0.96 and 1.16</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/random/Well512a.html">Well512a</a></td><td>between 0.85 and 0.88</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/random/Well1024a.html">Well1024a</a></td><td>between 0.63 and 0.73</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/random/Well19937a.html">Well19937a</a></td><td>between 0.70 and 0.71</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/random/Well19937c.html">Well19937c</a></td><td>between 0.57 and 0.71</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/random/Well44497a.html">Well44497a</a></td><td>between 0.69 and 0.71</td></tr>
+          <tr><td><a href="../apidocs/org/apache/commons/math3/random/Well44497b.html">Well44497b</a></td><td>between 0.65 and 0.71</td></tr>
         </table>
       </p>
 
       <p>
       So for most simulation problems, the better generators like <a
-      href="../apidocs/org/apache/commons/math/random/Well19937c.html">Well19937c</a> and <a
-      href="../apidocs/org/apache/commons/math/random/Well44497b.html">Well44497b</a> are probably very good choices.
+      href="../apidocs/org/apache/commons/math3/random/Well19937c.html">Well19937c</a> and <a
+      href="../apidocs/org/apache/commons/math3/random/Well44497b.html">Well44497b</a> are probably very good choices.
       </p>
 
       <p>



Mime
View raw message