Repository: commons-math Updated Branches: refs/heads/master a56d4998c -> f1b2fcd7f
[MATH-1204] Added changelog entry, fix javadoc typos. Project: http://git-wip-us.apache.org/repos/asf/commons-math/repo Commit: http://git-wip-us.apache.org/repos/asf/commons-math/commit/f1b2fcd7 Tree: http://git-wip-us.apache.org/repos/asf/commons-math/tree/f1b2fcd7 Diff: http://git-wip-us.apache.org/repos/asf/commons-math/diff/f1b2fcd7 Branch: refs/heads/master Commit: f1b2fcd7f51995130d71f1703e5c292ec648e94c Parents: a56d499 Author: Thomas Neidhart <thomas.neidh...@gmail.com> Authored: Thu Feb 19 22:20:04 2015 +0100 Committer: Thomas Neidhart <thomas.neidh...@gmail.com> Committed: Thu Feb 19 22:20:04 2015 +0100 ---------------------------------------------------------------------- src/changes/changes.xml | 4 ++++ .../commons/math4/analysis/solvers/UnivariateSolverUtils.java | 4 ++-- 2 files changed, 6 insertions(+), 2 deletions(-) ---------------------------------------------------------------------- http://git-wip-us.apache.org/repos/asf/commons-math/blob/f1b2fcd7/src/changes/changes.xml ---------------------------------------------------------------------- diff --git a/src/changes/changes.xml b/src/changes/changes.xml index 6f54583..a6fd01a 100644 --- a/src/changes/changes.xml +++ b/src/changes/changes.xml @@ -54,6 +54,10 @@ If the output is not quite correct, check for invisible trailing spaces! </release> <release version="4.0" date="XXXX-XX-XX" description=""> + <action dev="evanward" type="fix" issue="MATH-1204"> + "UnivariateSolverUtils#bracket(...)" sometimes failed to bracket + if a reached the lower bound. + </action> <action dev="tn" type="remove" issue="MATH-1050"> Removed "ArithmeticUtils#pow(int, long)" and "ArithmeticUtils#pow(long, long)". </action> http://git-wip-us.apache.org/repos/asf/commons-math/blob/f1b2fcd7/src/main/java/org/apache/commons/math4/analysis/solvers/UnivariateSolverUtils.java ---------------------------------------------------------------------- diff --git a/src/main/java/org/apache/commons/math4/analysis/solvers/UnivariateSolverUtils.java b/src/main/java/org/apache/commons/math4/analysis/solvers/UnivariateSolverUtils.java index 49742d8..bfdf07c 100644 --- a/src/main/java/org/apache/commons/math4/analysis/solvers/UnivariateSolverUtils.java +++ b/src/main/java/org/apache/commons/math4/analysis/solvers/UnivariateSolverUtils.java @@ -243,7 +243,7 @@ public class UnivariateSolverUtils { * \( \delta_{k+1} = r \delta_k + q, \delta_0 = 0\) and starting search with \( k=1 \). * The algorithm stops when one of the following happens: <ul> * <li> at least one positive and one negative value have been found -- success!</li> - * <li> both endpoints have reached their respective limites -- NoBracketingException </li> + * <li> both endpoints have reached their respective limits -- NoBracketingException </li> * <li> {@code maximumIterations} iterations elapse -- NoBracketingException </li></ul></p> * <p> * If different signs are found at first iteration ({@code k=1}), then the returned @@ -257,7 +257,7 @@ public class UnivariateSolverUtils { * Interval expansion rate is tuned by changing the recurrence parameters {@code r} and * {@code q}. When the multiplicative factor {@code r} is set to 1, the sequence is a * simple arithmetic sequence with linear increase. When the multiplicative factor {@code r} - * is larger than 1, the sequence has an asymtotically exponential rate. Note than the + * is larger than 1, the sequence has an asymptotically exponential rate. Note than the * additive parameter {@code q} should never be set to zero, otherwise the interval would * degenerate to the single initial point for all values of {@code k}. * </p>
