/* * Licensed to the Apache Software Foundation (ASF) under one or more * contributor license agreements. See the NOTICE file distributed with * this work for additional information regarding copyright ownership. * The ASF licenses this file to You under the Apache License, Version 2.0 * (the "License"); you may not use this file except in compliance with * the License. You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ package org.apache.commons.math.analysis.solvers; import org.apache.commons.math.analysis.UnivariateRealFunction; /** * Interface for (univariate real) rootfinding algorithms. * Implementations will search for only one zero in the given interval. * * @param <FUNC> Type of function to solve. * * @version $Id$ * @since 3.0 */ public interface BaseUnivariateRealSolver<FUNC extends UnivariateRealFunction> { /** * Get the maximal number of function evaluations. * * @return the maximal number of function evaluations. */ int getMaxEvaluations(); /** * Get the number of evaluations of the objective function. * The number of evaluations corresponds to the last call to the * {@code optimize} method. It is 0 if the method has not been * called yet. * * @return the number of evaluations of the objective function. */ int getEvaluations(); /** * @return the absolute accuracy. */ double getAbsoluteAccuracy(); /** * @return the relative accuracy. */ double getRelativeAccuracy(); /** * @return the function value accuracy. */ double getFunctionValueAccuracy(); /** * Solve for a zero root in the given interval. * A solver may require that the interval brackets a single zero root. * Solvers that do require bracketing should be able to handle the case * where one of the endpoints is itself a root. * * @param f Function to solve. * @param min Lower bound for the interval. * @param max Upper bound for the interval. * @param maxEval Maximum number of evaluations. * @return a value where the function is zero. * @throws org.apache.commons.math.exception.MathIllegalArgumentException * if the arguments do not satisfy the requirements specified by the solver. * @throws org.apache.commons.math.exception.TooManyEvaluationsException if * the allowed number of evaluations is exceeded. */ double solve(int maxEval, FUNC f, double min, double max); /** * Solve for a zero in the given interval, start at {@code startValue}. * A solver may require that the interval brackets a single zero root. * Solvers that do require bracketing should be able to handle the case * where one of the endpoints is itself a root. * * @param f Function to solve. * @param min Lower bound for the interval. * @param max Upper bound for the interval. * @param startValue Start value to use. * @param maxEval Maximum number of evaluations. * @return a value where the function is zero. * @throws org.apache.commons.math.exception.MathIllegalArgumentException * if the arguments do not satisfy the requirements specified by the solver. * @throws org.apache.commons.math.exception.TooManyEvaluationsException if * the allowed number of evaluations is exceeded. */ double solve(int maxEval, FUNC f, double min, double max, double startValue); /** * Solve for a zero in the vicinity of {@code startValue}. * * @param f Function to solve. * @param startValue Start value to use. * @return a value where the function is zero. * @param maxEval Maximum number of evaluations. * @throws org.apache.commons.math.exception.MathIllegalArgumentException * if the arguments do not satisfy the requirements specified by the solver. * @throws org.apache.commons.math.exception.TooManyEvaluationsException if * the allowed number of evaluations is exceeded. */ double solve(int maxEval, FUNC f, double startValue); }