IllinoisSolver.java

  1. /*
  2.  * Licensed to the Apache Software Foundation (ASF) under one or more
  3.  * contributor license agreements.  See the NOTICE file distributed with
  4.  * this work for additional information regarding copyright ownership.
  5.  * The ASF licenses this file to You under the Apache License, Version 2.0
  6.  * (the "License"); you may not use this file except in compliance with
  7.  * the License.  You may obtain a copy of the License at
  8.  *
  9.  *      https://www.apache.org/licenses/LICENSE-2.0
  10.  *
  11.  * Unless required by applicable law or agreed to in writing, software
  12.  * distributed under the License is distributed on an "AS IS" BASIS,
  13.  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  14.  * See the License for the specific language governing permissions and
  15.  * limitations under the License.
  16.  */

  17. /*
  18.  * This is not the original file distributed by the Apache Software Foundation
  19.  * It has been modified by the Hipparchus project
  20.  */

  21. package org.hipparchus.analysis.solvers;


  22. /**
  23.  * Implements the <em>Illinois</em> method for root-finding (approximating
  24.  * a zero of a univariate real function). It is a modified
  25.  * {@link RegulaFalsiSolver <em>Regula Falsi</em>} method.
  26.  *
  27.  * <p>Like the <em>Regula Falsi</em> method, convergence is guaranteed by
  28.  * maintaining a bracketed solution. The <em>Illinois</em> method however,
  29.  * should converge much faster than the original <em>Regula Falsi</em>
  30.  * method. Furthermore, this implementation of the <em>Illinois</em> method
  31.  * should not suffer from the same implementation issues as the <em>Regula
  32.  * Falsi</em> method, which may fail to convergence in certain cases.</p>
  33.  *
  34.  * <p>The <em>Illinois</em> method assumes that the function is continuous,
  35.  * but not necessarily smooth.</p>
  36.  *
  37.  * <p>Implementation based on the following article: M. Dowell and P. Jarratt,
  38.  * <em>A modified regula falsi method for computing the root of an
  39.  * equation</em>, BIT Numerical Mathematics, volume 11, number 2,
  40.  * pages 168-174, Springer, 1971.</p>
  41.  *
  42.  */
  43. public class IllinoisSolver extends BaseSecantSolver {

  44.     /** Construct a solver with default accuracy (1e-6). */
  45.     public IllinoisSolver() {
  46.         super(DEFAULT_ABSOLUTE_ACCURACY, Method.ILLINOIS);
  47.     }

  48.     /**
  49.      * Construct a solver.
  50.      *
  51.      * @param absoluteAccuracy Absolute accuracy.
  52.      */
  53.     public IllinoisSolver(final double absoluteAccuracy) {
  54.         super(absoluteAccuracy, Method.ILLINOIS);
  55.     }

  56.     /**
  57.      * Construct a solver.
  58.      *
  59.      * @param relativeAccuracy Relative accuracy.
  60.      * @param absoluteAccuracy Absolute accuracy.
  61.      */
  62.     public IllinoisSolver(final double relativeAccuracy,
  63.                           final double absoluteAccuracy) {
  64.         super(relativeAccuracy, absoluteAccuracy, Method.ILLINOIS);
  65.     }

  66.     /**
  67.      * Construct a solver.
  68.      *
  69.      * @param relativeAccuracy Relative accuracy.
  70.      * @param absoluteAccuracy Absolute accuracy.
  71.      * @param functionValueAccuracy Maximum function value error.
  72.      */
  73.     public IllinoisSolver(final double relativeAccuracy,
  74.                           final double absoluteAccuracy,
  75.                           final double functionValueAccuracy) {
  76.         super(relativeAccuracy, absoluteAccuracy, functionValueAccuracy, Method.ILLINOIS);
  77.     }
  78. }