Return-Path: X-Original-To: apmail-commons-notifications-archive@minotaur.apache.org Delivered-To: apmail-commons-notifications-archive@minotaur.apache.org Received: from mail.apache.org (hermes.apache.org [140.211.11.3]) by minotaur.apache.org (Postfix) with SMTP id 2200917ADC for ; Fri, 17 Apr 2015 19:17:23 +0000 (UTC) Received: (qmail 12914 invoked by uid 500); 17 Apr 2015 19:17:23 -0000 Delivered-To: apmail-commons-notifications-archive@commons.apache.org Received: (qmail 12847 invoked by uid 500); 17 Apr 2015 19:17:23 -0000 Mailing-List: contact notifications-help@commons.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: dev@commons.apache.org Delivered-To: mailing list notifications@commons.apache.org Received: (qmail 12777 invoked by uid 99); 17 Apr 2015 19:17:22 -0000 Received: from eris.apache.org (HELO hades.apache.org) (140.211.11.105) by apache.org (qpsmtpd/0.29) with ESMTP; Fri, 17 Apr 2015 19:17:22 +0000 Received: from hades.apache.org (localhost [127.0.0.1]) by hades.apache.org (ASF Mail Server at hades.apache.org) with ESMTP id C6F67AC0AC0 for ; Fri, 17 Apr 2015 19:17:22 +0000 (UTC) Content-Type: text/plain; charset="utf-8" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Subject: svn commit: r948061 [4/22] - in /websites/production/commons/content/proper/commons-math: ./ xref/ xref/org/apache/commons/math3/ xref/org/apache/commons/math3/analysis/ xref/org/apache/commons/math3/analysis/differentiation/ xref/org/apache/commons/ma... Date: Fri, 17 Apr 2015 19:17:18 -0000 To: notifications@commons.apache.org From: luc@apache.org X-Mailer: svnmailer-1.0.9 Message-Id: <20150417191722.C6F67AC0AC0@hades.apache.org> Modified: websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/analysis/solvers/LaguerreSolver.html ============================================================================== --- websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/analysis/solvers/LaguerreSolver.html (original) +++ websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/analysis/solvers/LaguerreSolver.html Fri Apr 17 19:17:13 2015 @@ -39,10 +39,10 @@ 31 * Implements the <a href="http://mathworld.wolfram.com/LaguerresMethod.html"> 32 * Laguerre's Method</a> for root finding of real coefficient polynomials. 33 * For reference, see -34 * <quote> -35 * <b>A First Course in Numerical Analysis</b> -36 * ISBN 048641454X, chapter 8. -37 * </quote> +34 * <blockquote> +35 * <b>A First Course in Numerical Analysis</b><br> +36 * ISBN 048641454X, chapter 8.<br> +37 * </blockquote> 38 * Laguerre's method is global in the sense that it can start with any initial 39 * approximation and be able to solve all roots from that point. 40 * The algorithm requires a bracketing condition. @@ -189,9 +189,9 @@ 181 * 182 * @param coefficients Polynomial coefficients. 183 * @param initial Start value. -184 * @return the point at which the function value is zero. +184 * @return the full set of complex roots of the polynomial 185 * @throws org.apache.commons.math3.exception.TooManyEvaluationsException -186 * if the maximum number of evaluations is exceeded. +186 * if the maximum number of evaluations is exceeded when solving for one of the roots 187 * @throws NullArgumentException if the {@code coefficients} is 188 * {@code null}. 189 * @throws NoDataException if the {@code coefficients} array is empty. @@ -202,200 +202,250 @@ 194 throws NullArgumentException, 195 NoDataException, 196 TooManyEvaluationsException { -197 setup(Integer.MAX_VALUE, -198 new PolynomialFunction(coefficients), -199 Double.NEGATIVE_INFINITY, -200 Double.POSITIVE_INFINITY, -201 initial); -202 return complexSolver.solveAll(ComplexUtils.convertToComplex(coefficients), -203 new Complex(initial, 0d)); -204 } -205 -206 /** -207 * Find a complex root for the polynomial with the given coefficients, -208 * starting from the given initial value. -209 * <br/> -210 * Note: This method is not part of the API of {@link BaseUnivariateSolver}. -211 * -212 * @param coefficients Polynomial coefficients. -213 * @param initial Start value. -214 * @return the point at which the function value is zero. -215 * @throws org.apache.commons.math3.exception.TooManyEvaluationsException -216 * if the maximum number of evaluations is exceeded. -217 * @throws NullArgumentException if the {@code coefficients} is -218 * {@code null}. -219 * @throws NoDataException if the {@code coefficients} array is empty. -220 * @since 3.1 -221 */ -222 public Complex solveComplex(double[] coefficients, -223 double initial) -224 throws NullArgumentException, -225 NoDataException, -226 TooManyEvaluationsException { -227 setup(Integer.MAX_VALUE, -228 new PolynomialFunction(coefficients), -229 Double.NEGATIVE_INFINITY, -230 Double.POSITIVE_INFINITY, -231 initial); -232 return complexSolver.solve(ComplexUtils.convertToComplex(coefficients), -233 new Complex(initial, 0d)); -234 } -235 -236 /** -237 * Class for searching all (complex) roots. -238 */ -239 private class ComplexSolver { -240 /** -241 * Check whether the given complex root is actually a real zero -242 * in the given interval, within the solver tolerance level. -243 * -244 * @param min Lower bound for the interval. -245 * @param max Upper bound for the interval. -246 * @param z Complex root. -247 * @return {@code true} if z is a real zero. -248 */ -249 public boolean isRoot(double min, double max, Complex z) { -250 if (isSequence(min, z.getReal(), max)) { -251 double tolerance = FastMath.max(getRelativeAccuracy() * z.abs(), getAbsoluteAccuracy()); -252 return (FastMath.abs(z.getImaginary()) <= tolerance) || -253 (z.abs() <= getFunctionValueAccuracy()); -254 } -255 return false; -256 } -257 -258 /** -259 * Find all complex roots for the polynomial with the given -260 * coefficients, starting from the given initial value. -261 * -262 * @param coefficients Polynomial coefficients. -263 * @param initial Start value. -264 * @return the point at which the function value is zero. -265 * @throws org.apache.commons.math3.exception.TooManyEvaluationsException -266 * if the maximum number of evaluations is exceeded. -267 * @throws NullArgumentException if the {@code coefficients} is -268 * {@code null}. -269 * @throws NoDataException if the {@code coefficients} array is empty. -270 */ -271 public Complex[] solveAll(Complex coefficients[], Complex initial) -272 throws NullArgumentException, -273 NoDataException, -274 TooManyEvaluationsException { -275 if (coefficients == null) { -276 throw new NullArgumentException(); -277 } -278 final int n = coefficients.length - 1; -279 if (n == 0) { -280 throw new NoDataException(LocalizedFormats.POLYNOMIAL); -281 } -282 // Coefficients for deflated polynomial. -283 final Complex c[] = new Complex[n + 1]; -284 for (int i = 0; i <= n; i++) { -285 c[i] = coefficients[i]; -286 } -287 -288 // Solve individual roots successively. -289 final Complex root[] = new Complex[n]; -290 for (int i = 0; i < n; i++) { -291 final Complex subarray[] = new Complex[n - i + 1]; -292 System.arraycopy(c, 0, subarray, 0, subarray.length); -293 root[i] = solve(subarray, initial); -294 // Polynomial deflation using synthetic division. -295 Complex newc = c[n - i]; -296 Complex oldc = null; -297 for (int j = n - i - 1; j >= 0; j--) { -298 oldc = c[j]; -299 c[j] = newc; -300 newc = oldc.add(newc.multiply(root[i])); -301 } -302 } -303 -304 return root; -305 } -306 -307 /** -308 * Find a complex root for the polynomial with the given coefficients, -309 * starting from the given initial value. -310 * -311 * @param coefficients Polynomial coefficients. -312 * @param initial Start value. -313 * @return the point at which the function value is zero. -314 * @throws org.apache.commons.math3.exception.TooManyEvaluationsException -315 * if the maximum number of evaluations is exceeded. -316 * @throws NullArgumentException if the {@code coefficients} is -317 * {@code null}. -318 * @throws NoDataException if the {@code coefficients} array is empty. -319 */ -320 public Complex solve(Complex coefficients[], Complex initial) -321 throws NullArgumentException, -322 NoDataException, -323 TooManyEvaluationsException { -324 if (coefficients == null) { -325 throw new NullArgumentException(); -326 } -327 +197 return solveAllComplex(coefficients, initial, Integer.MAX_VALUE); +198 } +199 +200 /** +201 * Find all complex roots for the polynomial with the given +202 * coefficients, starting from the given initial value. +203 * <br/> +204 * Note: This method is not part of the API of {@link BaseUnivariateSolver}. +205 * +206 * @param coefficients polynomial coefficients +207 * @param initial start value +208 * @param maxEval maximum number of evaluations +209 * @return the full set of complex roots of the polynomial +210 * @throws org.apache.commons.math3.exception.TooManyEvaluationsException +211 * if the maximum number of evaluations is exceeded when solving for one of the roots +212 * @throws NullArgumentException if the {@code coefficients} is +213 * {@code null} +214 * @throws NoDataException if the {@code coefficients} array is empty +215 * @since 3.5 +216 */ +217 public Complex[] solveAllComplex(double[] coefficients, +218 double initial, int maxEval) +219 throws NullArgumentException, +220 NoDataException, +221 TooManyEvaluationsException { +222 setup(maxEval, +223 new PolynomialFunction(coefficients), +224 Double.NEGATIVE_INFINITY, +225 Double.POSITIVE_INFINITY, +226 initial); +227 return complexSolver.solveAll(ComplexUtils.convertToComplex(coefficients), +228 new Complex(initial, 0d)); +229 } +230 +231 /** +232 * Find a complex root for the polynomial with the given coefficients, +233 * starting from the given initial value. +234 * <br/> +235 * Note: This method is not part of the API of {@link BaseUnivariateSolver}. +236 * +237 * @param coefficients Polynomial coefficients. +238 * @param initial Start value. +239 * @return a complex root of the polynomial +240 * @throws org.apache.commons.math3.exception.TooManyEvaluationsException +241 * if the maximum number of evaluations is exceeded. +242 * @throws NullArgumentException if the {@code coefficients} is +243 * {@code null}. +244 * @throws NoDataException if the {@code coefficients} array is empty. +245 * @since 3.1 +246 */ +247 public Complex solveComplex(double[] coefficients, +248 double initial) +249 throws NullArgumentException, +250 NoDataException, +251 TooManyEvaluationsException { +252 return solveComplex(coefficients, initial, Integer.MAX_VALUE); +253 } +254 +255 /** +256 * Find a complex root for the polynomial with the given coefficients, +257 * starting from the given initial value. +258 * <br/> +259 * Note: This method is not part of the API of {@link BaseUnivariateSolver}. +260 * +261 * @param coefficients polynomial coefficients +262 * @param initial start value +263 * @param maxEval maximum number of evaluations +264 * @return a complex root of the polynomial +265 * @throws org.apache.commons.math3.exception.TooManyEvaluationsException +266 * if the maximum number of evaluations is exceeded +267 * @throws NullArgumentException if the {@code coefficients} is +268 * {@code null} +269 * @throws NoDataException if the {@code coefficients} array is empty +270 * @since 3.1 +271 */ +272 public Complex solveComplex(double[] coefficients, +273 double initial, int maxEval) +274 throws NullArgumentException, +275 NoDataException, +276 TooManyEvaluationsException { +277 setup(maxEval, +278 new PolynomialFunction(coefficients), +279 Double.NEGATIVE_INFINITY, +280 Double.POSITIVE_INFINITY, +281 initial); +282 return complexSolver.solve(ComplexUtils.convertToComplex(coefficients), +283 new Complex(initial, 0d)); +284 } +285 +286 /** +287 * Class for searching all (complex) roots. +288 */ +289 private class ComplexSolver { +290 /** +291 * Check whether the given complex root is actually a real zero +292 * in the given interval, within the solver tolerance level. +293 * +294 * @param min Lower bound for the interval. +295 * @param max Upper bound for the interval. +296 * @param z Complex root. +297 * @return {@code true} if z is a real zero. +298 */ +299 public boolean isRoot(double min, double max, Complex z) { +300 if (isSequence(min, z.getReal(), max)) { +301 double tolerance = FastMath.max(getRelativeAccuracy() * z.abs(), getAbsoluteAccuracy()); +302 return (FastMath.abs(z.getImaginary()) <= tolerance) || +303 (z.abs() <= getFunctionValueAccuracy()); +304 } +305 return false; +306 } +307 +308 /** +309 * Find all complex roots for the polynomial with the given +310 * coefficients, starting from the given initial value. +311 * +312 * @param coefficients Polynomial coefficients. +313 * @param initial Start value. +314 * @return the point at which the function value is zero. +315 * @throws org.apache.commons.math3.exception.TooManyEvaluationsException +316 * if the maximum number of evaluations is exceeded. +317 * @throws NullArgumentException if the {@code coefficients} is +318 * {@code null}. +319 * @throws NoDataException if the {@code coefficients} array is empty. +320 */ +321 public Complex[] solveAll(Complex coefficients[], Complex initial) +322 throws NullArgumentException, +323 NoDataException, +324 TooManyEvaluationsException { +325 if (coefficients == null) { +326 throw new NullArgumentException(); +327 } 328 final int n = coefficients.length - 1; 329 if (n == 0) { 330 throw new NoDataException(LocalizedFormats.POLYNOMIAL); 331 } -332 -333 final double absoluteAccuracy = getAbsoluteAccuracy(); -334 final double relativeAccuracy = getRelativeAccuracy(); -335 final double functionValueAccuracy = getFunctionValueAccuracy(); -336 -337 final Complex nC = new Complex(n, 0); -338 final Complex n1C = new Complex(n - 1, 0); -339 -340 Complex z = initial; -341 Complex oldz = new Complex(Double.POSITIVE_INFINITY, -342 Double.POSITIVE_INFINITY); -343 while (true) { -344 // Compute pv (polynomial value), dv (derivative value), and -345 // d2v (second derivative value) simultaneously. -346 Complex pv = coefficients[n]; -347 Complex dv = Complex.ZERO; -348 Complex d2v = Complex.ZERO; -349 for (int j = n-1; j >= 0; j--) { -350 d2v = dv.add(z.multiply(d2v)); -351 dv = pv.add(z.multiply(dv)); -352 pv = coefficients[j].add(z.multiply(pv)); -353 } -354 d2v = d2v.multiply(new Complex(2.0, 0.0)); -355 -356 // Check for convergence. -357 final double tolerance = FastMath.max(relativeAccuracy * z.abs(), -358 absoluteAccuracy); -359 if ((z.subtract(oldz)).abs() <= tolerance) { -360 return z; -361 } -362 if (pv.abs() <= functionValueAccuracy) { -363 return z; -364 } -365 -366 // Now pv != 0, calculate the new approximation. -367 final Complex G = dv.divide(pv); -368 final Complex G2 = G.multiply(G); -369 final Complex H = G2.subtract(d2v.divide(pv)); -370 final Complex delta = n1C.multiply((nC.multiply(H)).subtract(G2)); -371 // Choose a denominator larger in magnitude. -372 final Complex deltaSqrt = delta.sqrt(); -373 final Complex dplus = G.add(deltaSqrt); -374 final Complex dminus = G.subtract(deltaSqrt); -375 final Complex denominator = dplus.abs() > dminus.abs() ? dplus : dminus; -376 // Perturb z if denominator is zero, for instance, -377 // p(x) = x^3 + 1, z = 0. -378 if (denominator.equals(new Complex(0.0, 0.0))) { -379 z = z.add(new Complex(absoluteAccuracy, absoluteAccuracy)); -380 oldz = new Complex(Double.POSITIVE_INFINITY, -381 Double.POSITIVE_INFINITY); -382 } else { -383 oldz = z; -384 z = z.subtract(nC.divide(denominator)); -385 } -386 incrementEvaluationCount(); -387 } -388 } -389 } -390 } +332 // Coefficients for deflated polynomial. +333 final Complex c[] = new Complex[n + 1]; +334 for (int i = 0; i <= n; i++) { +335 c[i] = coefficients[i]; +336 } +337 +338 // Solve individual roots successively. +339 final Complex root[] = new Complex[n]; +340 for (int i = 0; i < n; i++) { +341 final Complex subarray[] = new Complex[n - i + 1]; +342 System.arraycopy(c, 0, subarray, 0, subarray.length); +343 root[i] = solve(subarray, initial); +344 // Polynomial deflation using synthetic division. +345 Complex newc = c[n - i]; +346 Complex oldc = null; +347 for (int j = n - i - 1; j >= 0; j--) { +348 oldc = c[j]; +349 c[j] = newc; +350 newc = oldc.add(newc.multiply(root[i])); +351 } +352 } +353 +354 return root; +355 } +356 +357 /** +358 * Find a complex root for the polynomial with the given coefficients, +359 * starting from the given initial value. +360 * +361 * @param coefficients Polynomial coefficients. +362 * @param initial Start value. +363 * @return the point at which the function value is zero. +364 * @throws org.apache.commons.math3.exception.TooManyEvaluationsException +365 * if the maximum number of evaluations is exceeded. +366 * @throws NullArgumentException if the {@code coefficients} is +367 * {@code null}. +368 * @throws NoDataException if the {@code coefficients} array is empty. +369 */ +370 public Complex solve(Complex coefficients[], Complex initial) +371 throws NullArgumentException, +372 NoDataException, +373 TooManyEvaluationsException { +374 if (coefficients == null) { +375 throw new NullArgumentException(); +376 } +377 +378 final int n = coefficients.length - 1; +379 if (n == 0) { +380 throw new NoDataException(LocalizedFormats.POLYNOMIAL); +381 } +382 +383 final double absoluteAccuracy = getAbsoluteAccuracy(); +384 final double relativeAccuracy = getRelativeAccuracy(); +385 final double functionValueAccuracy = getFunctionValueAccuracy(); +386 +387 final Complex nC = new Complex(n, 0); +388 final Complex n1C = new Complex(n - 1, 0); +389 +390 Complex z = initial; +391 Complex oldz = new Complex(Double.POSITIVE_INFINITY, +392 Double.POSITIVE_INFINITY); +393 while (true) { +394 // Compute pv (polynomial value), dv (derivative value), and +395 // d2v (second derivative value) simultaneously. +396 Complex pv = coefficients[n]; +397 Complex dv = Complex.ZERO; +398 Complex d2v = Complex.ZERO; +399 for (int j = n-1; j >= 0; j--) { +400 d2v = dv.add(z.multiply(d2v)); +401 dv = pv.add(z.multiply(dv)); +402 pv = coefficients[j].add(z.multiply(pv)); +403 } +404 d2v = d2v.multiply(new Complex(2.0, 0.0)); +405 +406 // Check for convergence. +407 final double tolerance = FastMath.max(relativeAccuracy * z.abs(), +408 absoluteAccuracy); +409 if ((z.subtract(oldz)).abs() <= tolerance) { +410 return z; +411 } +412 if (pv.abs() <= functionValueAccuracy) { +413 return z; +414 } +415 +416 // Now pv != 0, calculate the new approximation. +417 final Complex G = dv.divide(pv); +418 final Complex G2 = G.multiply(G); +419 final Complex H = G2.subtract(d2v.divide(pv)); +420 final Complex delta = n1C.multiply((nC.multiply(H)).subtract(G2)); +421 // Choose a denominator larger in magnitude. +422 final Complex deltaSqrt = delta.sqrt(); +423 final Complex dplus = G.add(deltaSqrt); +424 final Complex dminus = G.subtract(deltaSqrt); +425 final Complex denominator = dplus.abs() > dminus.abs() ? dplus : dminus; +426 // Perturb z if denominator is zero, for instance, +427 // p(x) = x^3 + 1, z = 0. +428 if (denominator.equals(new Complex(0.0, 0.0))) { +429 z = z.add(new Complex(absoluteAccuracy, absoluteAccuracy)); +430 oldz = new Complex(Double.POSITIVE_INFINITY, +431 Double.POSITIVE_INFINITY); +432 } else { +433 oldz = z; +434 z = z.subtract(nC.divide(denominator)); +435 } +436 incrementEvaluationCount(); +437 } +438 } +439 } +440 }
Modified: websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/analysis/solvers/UnivariateSolverUtils.html ============================================================================== --- websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/analysis/solvers/UnivariateSolverUtils.html (original) +++ websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/analysis/solvers/UnivariateSolverUtils.html Fri Apr 17 19:17:13 2015 @@ -251,7 +251,7 @@ 243 * \( \delta_{k+1} = r \delta_k + q, \delta_0 = 0\) and starting search with \( k=1 \). 244 * The algorithm stops when one of the following happens: <ul> 245 * <li> at least one positive and one negative value have been found -- success!</li> -246 * <li> both endpoints have reached their respective limites -- NoBracketingException </li> +246 * <li> both endpoints have reached their respective limits -- NoBracketingException </li> 247 * <li> {@code maximumIterations} iterations elapse -- NoBracketingException </li></ul></p> 248 * <p> 249 * If different signs are found at first iteration ({@code k=1}), then the returned @@ -265,7 +265,7 @@ 257 * Interval expansion rate is tuned by changing the recurrence parameters {@code r} and 258 * {@code q}. When the multiplicative factor {@code r} is set to 1, the sequence is a 259 * simple arithmetic sequence with linear increase. When the multiplicative factor {@code r} -260 * is larger than 1, the sequence has an asymtotically exponential rate. Note than the +260 * is larger than 1, the sequence has an asymptotically exponential rate. Note than the 261 * additive parameter {@code q} should never be set to zero, otherwise the interval would 262 * degenerate to the single initial point for all values of {@code k}. 263 * </p> @@ -322,7 +322,7 @@ 314 double delta = 0; 315 316 for (int numIterations = 0; -317 (numIterations < maximumIterations) && (a > lowerBound || b > upperBound); +317 (numIterations < maximumIterations) && (a > lowerBound || b < upperBound); 318 ++numIterations) { 319 320 final double previousA = a; Modified: websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/analysis/solvers/package-frame.html ============================================================================== --- websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/analysis/solvers/package-frame.html (original) +++ websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/analysis/solvers/package-frame.html Fri Apr 17 19:17:13 2015 @@ -3,7 +3,7 @@ - Apache Commons Math 3.4.1 Reference Package org.apache.commons.math3.analysis.solvers + Apache Commons Math 3.5 Reference Package org.apache.commons.math3.analysis.solvers Modified: websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/analysis/solvers/package-summary.html ============================================================================== --- websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/analysis/solvers/package-summary.html (original) +++ websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/analysis/solvers/package-summary.html Fri Apr 17 19:17:13 2015 @@ -3,7 +3,7 @@ - Apache Commons Math 3.4.1 Reference Package org.apache.commons.math3.analysis.solvers + Apache Commons Math 3.5 Reference Package org.apache.commons.math3.analysis.solvers Modified: websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/complex/package-frame.html ============================================================================== --- websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/complex/package-frame.html (original) +++ websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/complex/package-frame.html Fri Apr 17 19:17:13 2015 @@ -3,7 +3,7 @@ - Apache Commons Math 3.4.1 Reference Package org.apache.commons.math3.complex + Apache Commons Math 3.5 Reference Package org.apache.commons.math3.complex Modified: websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/complex/package-summary.html ============================================================================== --- websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/complex/package-summary.html (original) +++ websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/complex/package-summary.html Fri Apr 17 19:17:13 2015 @@ -3,7 +3,7 @@ - Apache Commons Math 3.4.1 Reference Package org.apache.commons.math3.complex + Apache Commons Math 3.5 Reference Package org.apache.commons.math3.complex Modified: websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/dfp/package-frame.html ============================================================================== --- websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/dfp/package-frame.html (original) +++ websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/dfp/package-frame.html Fri Apr 17 19:17:13 2015 @@ -3,7 +3,7 @@ - Apache Commons Math 3.4.1 Reference Package org.apache.commons.math3.dfp + Apache Commons Math 3.5 Reference Package org.apache.commons.math3.dfp Modified: websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/dfp/package-summary.html ============================================================================== --- websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/dfp/package-summary.html (original) +++ websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/dfp/package-summary.html Fri Apr 17 19:17:13 2015 @@ -3,7 +3,7 @@ - Apache Commons Math 3.4.1 Reference Package org.apache.commons.math3.dfp + Apache Commons Math 3.5 Reference Package org.apache.commons.math3.dfp Modified: websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/distribution/PoissonDistribution.html ============================================================================== --- websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/distribution/PoissonDistribution.html (original) +++ websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/distribution/PoissonDistribution.html Fri Apr 17 19:17:13 2015 @@ -291,14 +291,14 @@ 283 * <ul> 284 * <li>For small means, uses simulation of a Poisson process 285 * using Uniform deviates, as described -286 * <a href="http://irmi.epfl.ch/cmos/Pmmi/interactive/rng7.htm"> here</a>. +286 * <a href="http://mathaa.epfl.ch/cours/PMMI2001/interactive/rng7.htm"> here</a>. 287 * The Poisson process (and hence value returned) is bounded by 1000 * mean. 288 * </li> 289 * <li>For large means, uses the rejection algorithm described in -290 * <quote> -291 * Devroye, Luc. (1981).<i>The Computer Generation of Poisson Random Variables</i> -292 * <strong>Computing</strong> vol. 26 pp. 197-207. -293 * </quote> +290 * <blockquote> +291 * Devroye, Luc. (1981).<i>The Computer Generation of Poisson Random Variables</i><br> +292 * <strong>Computing</strong> vol. 26 pp. 197-207.<br> +293 * </blockquote> 294 * </li> 295 * </ul> 296 * </p> Modified: websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/distribution/fitting/package-frame.html ============================================================================== --- websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/distribution/fitting/package-frame.html (original) +++ websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/distribution/fitting/package-frame.html Fri Apr 17 19:17:13 2015 @@ -3,7 +3,7 @@ - Apache Commons Math 3.4.1 Reference Package org.apache.commons.math3.distribution.fitting + Apache Commons Math 3.5 Reference Package org.apache.commons.math3.distribution.fitting Modified: websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/distribution/fitting/package-summary.html ============================================================================== --- websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/distribution/fitting/package-summary.html (original) +++ websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/distribution/fitting/package-summary.html Fri Apr 17 19:17:13 2015 @@ -3,7 +3,7 @@ - Apache Commons Math 3.4.1 Reference Package org.apache.commons.math3.distribution.fitting + Apache Commons Math 3.5 Reference Package org.apache.commons.math3.distribution.fitting Modified: websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/distribution/package-frame.html ============================================================================== --- websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/distribution/package-frame.html (original) +++ websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/distribution/package-frame.html Fri Apr 17 19:17:13 2015 @@ -3,7 +3,7 @@ - Apache Commons Math 3.4.1 Reference Package org.apache.commons.math3.distribution + Apache Commons Math 3.5 Reference Package org.apache.commons.math3.distribution Modified: websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/distribution/package-summary.html ============================================================================== --- websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/distribution/package-summary.html (original) +++ websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/distribution/package-summary.html Fri Apr 17 19:17:13 2015 @@ -3,7 +3,7 @@ - Apache Commons Math 3.4.1 Reference Package org.apache.commons.math3.distribution + Apache Commons Math 3.5 Reference Package org.apache.commons.math3.distribution Modified: websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/exception/package-frame.html ============================================================================== --- websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/exception/package-frame.html (original) +++ websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/exception/package-frame.html Fri Apr 17 19:17:13 2015 @@ -3,7 +3,7 @@ - Apache Commons Math 3.4.1 Reference Package org.apache.commons.math3.exception + Apache Commons Math 3.5 Reference Package org.apache.commons.math3.exception Modified: websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/exception/package-summary.html ============================================================================== --- websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/exception/package-summary.html (original) +++ websites/production/commons/content/proper/commons-math/xref/org/apache/commons/math3/exception/package-summary.html Fri Apr 17 19:17:13 2015 @@ -3,7 +3,7 @@ - Apache Commons Math 3.4.1 Reference Package org.apache.commons.math3.exception + Apache Commons Math 3.5 Reference Package org.apache.commons.math3.exception