Package org.apache.commons.math

Examples of org.apache.commons.math.ConvergenceException

204
205
206
207
208
209
210
211
212
213
214
            Math.abs(epsilon * f[1][0] * f[1][1]))
        {
            ret = f[0][0] / f[1][0];
        } else {
            if (n >= maxIterations) {
                throw new ConvergenceException(
                    "Continued fraction convergents failed to converge.");
            }
            // compute next
            ret = evaluate(n + 1, x, f /* new a */
            , an /* reuse an */
 
View Full Code Here
64
65
66
67
68
69
70
71
72
public class ConvergenceExceptionTest extends TestCase {
    /**
     *
     */
    public void testConstructor(){
        ConvergenceException ex = new ConvergenceException();
        assertNull(ex.getCause());
        assertNull(ex.getMessage());
    }
View Full Code Here
74
75
76
77
78
79
80
81
82
    /**
     *
     */
    public void testConstructorMessage(){
        String msg = "message";
        ConvergenceException ex = new ConvergenceException(msg);
        assertNull(ex.getCause());
        assertEquals(msg, ex.getMessage());
    }
View Full Code Here
86
87
88
89
90
91
92
93
94
     */
    public void testConstructorMessageCause(){
        String outMsg = "outer message";
        String inMsg = "inner message";
        Exception cause = new Exception(inMsg);
        ConvergenceException ex = new ConvergenceException(outMsg, cause);
        assertEquals(outMsg, ex.getMessage());
        assertEquals(cause, ex.getCause());
    }
View Full Code Here
97
98
99
100
101
102
103
104
     *
     */
    public void testConstructorCause(){
        String inMsg = "inner message";
        Exception cause = new Exception(inMsg);
        ConvergenceException ex = new ConvergenceException(cause);
        assertEquals(cause, ex.getCause());
    }
View Full Code Here
200
201
202
203
204
205
206
                return result;
            }
        }

        // should never happen
        throw new ConvergenceException();
    }
View Full Code Here
199
200
201
202
203
204
205
206
207
208
209
            numIterations++ ;
        } while ((fa * fb > 0.0) && (numIterations < maximumIterations) &&
                ((a > lowerBound) || (b < upperBound)));

        if (fa * fb > 0.0 ) {
            throw new ConvergenceException(
                      "number of iterations={0}, maximum iterations={1}, " +
                      "initial={2}, lower bound={3}, upper bound={4}, final a value={5}, " +
                      "final b value={6}, f(a)={7}, f(b)={8}",
                      numIterations, maximumIterations, initial,
                      lowerBound, upperBound, a, b, fa, fb);
View Full Code Here
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
                double scaleFactor = 1d;
                double lastScaleFactor = 1d;
                final int maxPower = 5;
                final double scale = Math.max(a,b);
                if (scale <= 0) {  // Can't scale
                    throw new ConvergenceException(
                            "Continued fraction convergents diverged to +/- infinity for value {0}",
                             x);
                }
                infinite = true;
                for (int i = 0; i < maxPower; i++) {
                    lastScaleFactor = scaleFactor;
                    scaleFactor *= scale;
                    if (a != 0.0 && a > b) {
                        p2 = p1 / lastScaleFactor + (b / scaleFactor * p0);
                        q2 = q1 / lastScaleFactor + (b / scaleFactor * q0);
                    } else if (b != 0) {
                        p2 = (a / scaleFactor * p1) + p0 / lastScaleFactor;
                        q2 = (a / scaleFactor * q1) + q0 / lastScaleFactor;
                    }
                    infinite = Double.isInfinite(p2) || Double.isInfinite(q2);
                    if (!infinite) {
                        break;
                    }
                }
            }

            if (infinite) {
               // Scaling failed
               throw new ConvergenceException(
                 "Continued fraction convergents diverged to +/- infinity for value {0}",
                  x);
            }

            double r = p2 / q2;

            if (Double.isNaN(r)) {
                throw new ConvergenceException(
                  "Continued fraction diverged to NaN for value {0}",
                  x);
            }
            relativeError = Math.abs(r / c - 1.0);

View Full Code Here
145
146
147
148
149
150
151
                return result;
            }
        }

        // should never happen
        throw new ConvergenceException();
    }
View Full Code Here
504
505
506
507
508
509
510
511
512
513
514
        // null elements
        Arrays.sort(minima, pointCostPairComparator);

        // return the found point given the lowest cost
        if (minima[0] == null) {
            throw new ConvergenceException("none of the {0} start points" +
                                           " lead to convergence",
                                           new Object[] {
                                             Integer.toString(starts)
                                           });
        }
View Full Code Here
TOP

Related Classes of org.apache.commons.math.ConvergenceException

  • org.apache.commons.math.analysis.BisectionSolver
  • org.apache.commons.math.analysis.BrentSolver
  • org.apache.commons.math.analysis.ConvergenceExceptionTest
  • org.apache.commons.math.analysis.LaguerreSolver
  • org.apache.commons.math.analysis.NewtonSolver
  • org.apache.commons.math.analysis.SecantSolver
  • org.apache.commons.math.analysis.solvers.LaguerreSolver
  • org.apache.commons.math.analysis.solvers.UnivariateRealSolverUtils
  • org.apache.commons.math.analysis.UnivariateRealSolverUtils
  • org.apache.commons.math.exception.util.DummyLocalizable
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.