Apache/commons-math
1
0
Fork 0
mirror of https://github.com/apache/commons-math.git synced 2025-02-11 20:46:03 +00:00
Code Issues Packages Projects Releases Wiki Activity

[MATH-1204] Added changelog entry, fix javadoc typos.

Browse Source
This commit is contained in:
Thomas Neidhart 2015-02-19 22:20:04 +01:00
parent a56d4998cf
commit f1b2fcd7f5
2 changed files with 6 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/changes/changes.xml
View File

@ -54,6 +54,10 @@ If the output is not quite correct, check for invisible trailing spaces!
</release> </release>
<release version="4.0" date="XXXX-XX-XX" description=""> <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"> <action dev="tn" type="remove" issue="MATH-1050">
Removed "ArithmeticUtils#pow(int, long)" and "ArithmeticUtils#pow(long, long)". Removed "ArithmeticUtils#pow(int, long)" and "ArithmeticUtils#pow(long, long)".
</action> </action>

4
src/main/java/org/apache/commons/math4/analysis/solvers/UnivariateSolverUtils.java
View File

@ -243,7 +243,7 @@ public class UnivariateSolverUtils {
* \( \delta_{k+1} = r \delta_k + q, \delta_0 = 0\) and starting search with \( k=1 \). * \( \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> * 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> 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> * <li> {@code maximumIterations} iterations elapse -- NoBracketingException </li></ul></p>
* <p> * <p>
* If different signs are found at first iteration ({@code k=1}), then the returned * 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 * 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 * {@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} * 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 * 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}. * degenerate to the single initial point for all values of {@code k}.
* </p> * </p>