HTML cleanup
Project: http://git-wip-us.apache.org/repos/asf/commons-math/repo Commit: http://git-wip-us.apache.org/repos/asf/commons-math/commit/a25b7b58 Tree: http://git-wip-us.apache.org/repos/asf/commons-math/tree/a25b7b58 Diff: http://git-wip-us.apache.org/repos/asf/commons-math/diff/a25b7b58 Branch: refs/heads/master Commit: a25b7b584677c08c00d326d3d77f03ebb662262c Parents: 98d49ae Author: Gilles <[email protected]> Authored: Wed Feb 4 14:09:37 2015 +0100 Committer: Gilles <[email protected]> Committed: Wed Feb 4 14:09:37 2015 +0100 ---------------------------------------------------------------------- .../analysis/integration/gauss/HermiteRuleFactory.java | 10 +++++----- .../interpolation/TricubicInterpolatingFunction.java | 10 +++++----- .../commons/math3/analysis/solvers/BrentSolver.java | 8 ++++---- .../commons/math3/analysis/solvers/LaguerreSolver.java | 8 ++++---- .../commons/math3/distribution/PoissonDistribution.java | 8 ++++---- 5 files changed, 22 insertions(+), 22 deletions(-) ---------------------------------------------------------------------- http://git-wip-us.apache.org/repos/asf/commons-math/blob/a25b7b58/src/main/java/org/apache/commons/math3/analysis/integration/gauss/HermiteRuleFactory.java ---------------------------------------------------------------------- diff --git a/src/main/java/org/apache/commons/math3/analysis/integration/gauss/HermiteRuleFactory.java b/src/main/java/org/apache/commons/math3/analysis/integration/gauss/HermiteRuleFactory.java index bc430cf..3d873ab 100644 --- a/src/main/java/org/apache/commons/math3/analysis/integration/gauss/HermiteRuleFactory.java +++ b/src/main/java/org/apache/commons/math3/analysis/integration/gauss/HermiteRuleFactory.java @@ -41,11 +41,11 @@ import org.apache.commons.math3.util.FastMath; * The initial interval for the application of the bisection method is * based on the roots of the previous Hermite polynomial (interlacing). * Upper and lower bounds of these roots are provided by - * <quote> - * I. Krasikov, - * <em>Nonnegative quadratic forms and bounds on orthogonal polynomials</em>, - * Journal of Approximation theory <b>111</b>, 31-49 - * </quote> + * <blockquote> + * I. Krasikov,<br> + * <em>Nonnegative quadratic forms and bounds on orthogonal polynomials</em>,<br> + * Journal of Approximation theory <b>111</b>, 31-49<br> + * </blockquote> * * @since 3.3 */ http://git-wip-us.apache.org/repos/asf/commons-math/blob/a25b7b58/src/main/java/org/apache/commons/math3/analysis/interpolation/TricubicInterpolatingFunction.java ---------------------------------------------------------------------- diff --git a/src/main/java/org/apache/commons/math3/analysis/interpolation/TricubicInterpolatingFunction.java b/src/main/java/org/apache/commons/math3/analysis/interpolation/TricubicInterpolatingFunction.java index eaea339..9344d89 100644 --- a/src/main/java/org/apache/commons/math3/analysis/interpolation/TricubicInterpolatingFunction.java +++ b/src/main/java/org/apache/commons/math3/analysis/interpolation/TricubicInterpolatingFunction.java @@ -27,11 +27,11 @@ import org.apache.commons.math3.util.MathArrays; * Function that implements the * <a href="http://en.wikipedia.org/wiki/Tricubic_interpolation";> * tricubic spline interpolation</a>, as proposed in - * <quote> - * Tricubic interpolation in three dimensions<br/> - * F. Lekien and J. Marsden<br/> - * <em>Int. J. Numer. Meth. Eng</em> 2005; <b>63</b>:455-471 - * </quote> + * <blockquote> + * Tricubic interpolation in three dimensions<br> + * F. Lekien and J. Marsden<br> + * <em>Int. J. Numer. Meth. Eng</em> 2005; <b>63</b>:455-471<br> + * </blockquote> * * @since 3.4. */ http://git-wip-us.apache.org/repos/asf/commons-math/blob/a25b7b58/src/main/java/org/apache/commons/math3/analysis/solvers/BrentSolver.java ---------------------------------------------------------------------- diff --git a/src/main/java/org/apache/commons/math3/analysis/solvers/BrentSolver.java b/src/main/java/org/apache/commons/math3/analysis/solvers/BrentSolver.java index f9da26e..0cc8750 100644 --- a/src/main/java/org/apache/commons/math3/analysis/solvers/BrentSolver.java +++ b/src/main/java/org/apache/commons/math3/analysis/solvers/BrentSolver.java @@ -34,11 +34,11 @@ import org.apache.commons.math3.util.Precision; * The given interval must bracket the root. * <p> * The reference implementation is given in chapter 4 of - * <quote> + * <blockquote> * <b>Algorithms for Minimization Without Derivatives</b><br> * <em>Richard P. Brent</em><br> * Dover, 2002<br> - * </quote> + * </blockquote> * </p> * * @see BaseAbstractUnivariateSolver @@ -137,11 +137,11 @@ public class BrentSolver extends AbstractUnivariateSolver { * Search for a zero inside the provided interval. * This implementation is based on the algorithm described at page 58 of * the book - * <quote> + * <blockquote> * <b>Algorithms for Minimization Without Derivatives</b> * <it>Richard P. Brent</it> * Dover 0-486-41998-3 - * </quote> + * </blockquote> * * @param lo Lower bound of the search interval. * @param hi Higher bound of the search interval. http://git-wip-us.apache.org/repos/asf/commons-math/blob/a25b7b58/src/main/java/org/apache/commons/math3/analysis/solvers/LaguerreSolver.java ---------------------------------------------------------------------- diff --git a/src/main/java/org/apache/commons/math3/analysis/solvers/LaguerreSolver.java b/src/main/java/org/apache/commons/math3/analysis/solvers/LaguerreSolver.java index 1045fc0..c127b42 100644 --- a/src/main/java/org/apache/commons/math3/analysis/solvers/LaguerreSolver.java +++ b/src/main/java/org/apache/commons/math3/analysis/solvers/LaguerreSolver.java @@ -31,10 +31,10 @@ import org.apache.commons.math3.util.FastMath; * Implements the <a href="http://mathworld.wolfram.com/LaguerresMethod.html";> * Laguerre's Method</a> for root finding of real coefficient polynomials. * For reference, see - * <quote> - * <b>A First Course in Numerical Analysis</b> - * ISBN 048641454X, chapter 8. - * </quote> + * <blockquote> + * <b>A First Course in Numerical Analysis</b><br> + * ISBN 048641454X, chapter 8.<br> + * </blockquote> * Laguerre's method is global in the sense that it can start with any initial * approximation and be able to solve all roots from that point. * The algorithm requires a bracketing condition. http://git-wip-us.apache.org/repos/asf/commons-math/blob/a25b7b58/src/main/java/org/apache/commons/math3/distribution/PoissonDistribution.java ---------------------------------------------------------------------- diff --git a/src/main/java/org/apache/commons/math3/distribution/PoissonDistribution.java b/src/main/java/org/apache/commons/math3/distribution/PoissonDistribution.java index f748081..0d885e9 100644 --- a/src/main/java/org/apache/commons/math3/distribution/PoissonDistribution.java +++ b/src/main/java/org/apache/commons/math3/distribution/PoissonDistribution.java @@ -287,10 +287,10 @@ public class PoissonDistribution extends AbstractIntegerDistribution { * The Poisson process (and hence value returned) is bounded by 1000 * mean. * </li> * <li>For large means, uses the rejection algorithm described in - * <quote> - * Devroye, Luc. (1981).<i>The Computer Generation of Poisson Random Variables</i> - * <strong>Computing</strong> vol. 26 pp. 197-207. - * </quote> + * <blockquote> + * Devroye, Luc. (1981).<i>The Computer Generation of Poisson Random Variables</i><br> + * <strong>Computing</strong> vol. 26 pp. 197-207.<br> + * </blockquote> * </li> * </ul> * </p>
