Uses of Interface
org.apache.commons.math.ConvergingAlgorithm
Packages that use ConvergingAlgorithm
Package
Description
Common classes used throughout the commons-math library.
Numerical integration (quadrature) algorithms for univariate real functions.
Root finding algorithms, for univariate real functions.
This package provides common interfaces for the optimization algorithms
provided in sub-packages.
Univariate real functions minimum finding algorithms.
-
Uses of ConvergingAlgorithm in org.apache.commons.math
Classes in org.apache.commons.math that implement ConvergingAlgorithmModifier and TypeClassDescriptionclass
Deprecated.in 2.2 (to be removed in 3.0). -
Uses of ConvergingAlgorithm in org.apache.commons.math.analysis.integration
Subinterfaces of ConvergingAlgorithm in org.apache.commons.math.analysis.integrationModifier and TypeInterfaceDescriptioninterface
Interface for univariate real integration algorithms.Classes in org.apache.commons.math.analysis.integration that implement ConvergingAlgorithmModifier and TypeClassDescriptionclass
Implements the Legendre-Gauss quadrature formula.class
Implements the Romberg Algorithm for integration of real univariate functions.class
Implements the Simpson's Rule for integration of real univariate functions.class
Implements the Trapezoidal Rule for integration of real univariate functions.class
Provide a default implementation for several generic functions. -
Uses of ConvergingAlgorithm in org.apache.commons.math.analysis.solvers
Subinterfaces of ConvergingAlgorithm in org.apache.commons.math.analysis.solversModifier and TypeInterfaceDescriptioninterface
Interface for (univariate real) rootfinding algorithms.Classes in org.apache.commons.math.analysis.solvers that implement ConvergingAlgorithmModifier and TypeClassDescriptionclass
Implements the bisection algorithm for finding zeros of univariate real functions.class
Implements the Brent algorithm for finding zeros of real univariate functions.class
Implements the Laguerre's Method for root finding of real coefficient polynomials.class
Implements the Muller's Method for root finding of real univariate functions.class
Implements Newton's Method for finding zeros of real univariate functions.class
Implements the Ridders' Method for root finding of real univariate functions.class
Implements a modified version of the secant method for approximating a zero of a real univariate function.class
Deprecated.in 2.2 (to be removed in 3.0). -
Uses of ConvergingAlgorithm in org.apache.commons.math.optimization
Subinterfaces of ConvergingAlgorithm in org.apache.commons.math.optimizationModifier and TypeInterfaceDescriptioninterface
Interface for (univariate real) optimization algorithms.Classes in org.apache.commons.math.optimization that implement ConvergingAlgorithmModifier and TypeClassDescriptionclass
Special implementation of theUnivariateRealOptimizer
interface adding multi-start features to an existing optimizer. -
Uses of ConvergingAlgorithm in org.apache.commons.math.optimization.univariate
Classes in org.apache.commons.math.optimization.univariate that implement ConvergingAlgorithmModifier and TypeClassDescriptionclass
Provide a default implementation for several functions useful to generic optimizers.class
Implements Richard Brent's algorithm (from his book "Algorithms for Minimization without Derivatives", p.