You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@commons.apache.org by db...@apache.org on 2015/12/29 20:31:50 UTC

[math] simplify: remove dead params

Repository: commons-math
Updated Branches:
  refs/heads/master a71c820ba -> a4eff51be


simplify: remove dead params


Project: http://git-wip-us.apache.org/repos/asf/commons-math/repo
Commit: http://git-wip-us.apache.org/repos/asf/commons-math/commit/a4eff51b
Tree: http://git-wip-us.apache.org/repos/asf/commons-math/tree/a4eff51b
Diff: http://git-wip-us.apache.org/repos/asf/commons-math/diff/a4eff51b

Branch: refs/heads/master
Commit: a4eff51bedd73a0ea56afc23b1021187dd03561b
Parents: a71c820
Author: Dave Brosius <db...@mebigfatguy.com>
Authored: Tue Dec 29 14:31:35 2015 -0500
Committer: Dave Brosius <db...@mebigfatguy.com>
Committed: Tue Dec 29 14:31:35 2015 -0500

----------------------------------------------------------------------
 .../commons/math4/analysis/solvers/LaguerreSolver.java      | 9 +++------
 1 file changed, 3 insertions(+), 6 deletions(-)
----------------------------------------------------------------------


http://git-wip-us.apache.org/repos/asf/commons-math/blob/a4eff51b/src/main/java/org/apache/commons/math4/analysis/solvers/LaguerreSolver.java
----------------------------------------------------------------------
diff --git a/src/main/java/org/apache/commons/math4/analysis/solvers/LaguerreSolver.java b/src/main/java/org/apache/commons/math4/analysis/solvers/LaguerreSolver.java
index f233d42..b038abb 100644
--- a/src/main/java/org/apache/commons/math4/analysis/solvers/LaguerreSolver.java
+++ b/src/main/java/org/apache/commons/math4/analysis/solvers/LaguerreSolver.java
@@ -113,7 +113,7 @@ public class LaguerreSolver extends AbstractPolynomialSolver {
 
         // Reduce interval if min and initial bracket the root.
         if (yInitial * yMin < 0) {
-            return laguerre(min, initial, yMin, yInitial);
+            return laguerre(min, initial);
         }
 
         // Return the second endpoint if it is good enough.
@@ -124,7 +124,7 @@ public class LaguerreSolver extends AbstractPolynomialSolver {
 
         // Reduce interval if initial and max bracket the root.
         if (yInitial * yMax < 0) {
-            return laguerre(initial, max, yInitial, yMax);
+            return laguerre(initial, max);
         }
 
         throw new NoBracketingException(min, max, yMin, yMax);
@@ -144,12 +144,9 @@ public class LaguerreSolver extends AbstractPolynomialSolver {
      *
      * @param lo Lower bound of the search interval.
      * @param hi Higher bound of the search interval.
-     * @param fLo Function value at the lower bound of the search interval.
-     * @param fHi Function value at the higher bound of the search interval.
      * @return the point at which the function value is zero.
      */
-    private double laguerre(double lo, double hi,
-                            double fLo, double fHi) {
+    private double laguerre(double lo, double hi) {
         final Complex c[] = ComplexUtils.convertToComplex(getCoefficients());
 
         final Complex initial = new Complex(0.5 * (lo + hi), 0);