Author: erans
Date: Sun May 11 22:53:54 2014
New Revision: 1593867
URL: http://svn.apache.org/r1593867
Log:
Typo.
Modified:
commons/proper/math/trunk/src/main/java/org/apache/commons/math3/analysis/solvers/UnivariateSolverUtils.java
Modified:
commons/proper/math/trunk/src/main/java/org/apache/commons/math3/analysis/solvers/UnivariateSolverUtils.java
URL:
http://svn.apache.org/viewvc/commons/proper/math/trunk/src/main/java/org/apache/commons/math3/analysis/solvers/UnivariateSolverUtils.java?rev=1593867&r1=1593866&r2=1593867&view=diff
==============================================================================
---
commons/proper/math/trunk/src/main/java/org/apache/commons/math3/analysis/solvers/UnivariateSolverUtils.java
(original)
+++
commons/proper/math/trunk/src/main/java/org/apache/commons/math3/analysis/solvers/UnivariateSolverUtils.java
Sun May 11 22:53:54 2014
@@ -250,7 +250,7 @@ public class UnivariateSolverUtils {
* If different signs are found at first iteration ({@code k=1}), then the
returned
* interval will be \( [a, b] = [l_1, u_1] \). If different signs are
found at a later
* iteration ({code k>1}, then the returned interval will be either
- * \( [a, b] = [l_{k+1}, l_{k}] \) or ( [a, b] = [u_{k}, u_{k+1}] \). A
root solver called
+ * \( [a, b] = [l_{k+1}, l_{k}] \) or \( [a, b] = [u_{k}, u_{k+1}] \). A
root solver called
* with these parameters will therefore start with the smallest bracketing
interval known
* at this step.
* </p>
