[commons-math] 06/11: Better initial guess for the circle centre

[aherbert]

This is an automated email from the ASF dual-hosted git repository.

aherbert pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/commons-math.git

commit 4e2457cb367e17b374c1ad7e26ab2729ee021fd0
Author: aherbert <aherb...@apache.org>
AuthorDate: Thu Oct 13 15:41:33 2022 +0100

    Better initial guess for the circle centre
---
 .../legacy/fitting/leastsquares/LevenbergMarquardtOptimizerTest.java  | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git 
a/commons-math-legacy/src/test/java/org/apache/commons/math4/legacy/fitting/leastsquares/LevenbergMarquardtOptimizerTest.java
 
b/commons-math-legacy/src/test/java/org/apache/commons/math4/legacy/fitting/leastsquares/LevenbergMarquardtOptimizerTest.java
index a3b2bc152..4a76eb3f2 100644
--- 
a/commons-math-legacy/src/test/java/org/apache/commons/math4/legacy/fitting/leastsquares/LevenbergMarquardtOptimizerTest.java
+++ 
b/commons-math-legacy/src/test/java/org/apache/commons/math4/legacy/fitting/leastsquares/LevenbergMarquardtOptimizerTest.java
@@ -257,7 +257,7 @@ public class LevenbergMarquardtOptimizerTest
         factory.samples(numPoints).forEach(circle::addPoint);
 
         // First guess for the center's coordinates and radius.
-        final double[] init = { 90, 659, 115 };
+        final double[] init = { 118, 659, 115 };
 
         final Optimum optimum = optimizer.optimize(
                 builder(circle).maxIterations(50).start(init).build());
@@ -290,7 +290,7 @@ public class LevenbergMarquardtOptimizerTest
         factory.samples(numPoints).forEach(circle::addPoint);
 
         // First guess for the center's coordinates and radius.
-        final double[] init = { 90, 659, 115 };
+        final double[] init = { 118, 659, 115 };
         final Optimum optimum
             = 
optimizer.optimize(builder(circle).maxIterations(50).start(init).build());
         final int numEval = optimum.getEvaluations();