Absolute value function. @since 3.0

Base class for all convergence checker implementations. @param <PAIR> Type of (point, value) pair. @since 3.0

Base class that contains common code for fitting parametric univariate real functions <code>y = f(p_i;x)</code>, where {@code x} is the inde

An implementation of {@link Evaluation} that is designed for extension. All of the methods implemented here use the methods that are left unimplemente

Base class managing common boilerplate for all integrators. @param <T> the type of the field elements @since 3.6

Basic implementation of {@link FieldMatrix} methods regardless of the underlying storage. <p>All the methods implemented here use {@link #getEntry(int

This abstract class represents an interpolator over the last step during an ODE integration. <p>The various ODE integrators provide objects extending

Base class for integer-valued discrete distributions. Default implementations are provided for some of the methods that do not vary from distribution

Test cases for AbstractIntegerDistribution default implementations.

Base class managing common boilerplate for all integrators. @since 2.0

Some of the unit tests are re-implementations of the MINPACK <a href="https://www.netlib.org/minpack/ex/file17">file17</a> and <a href="https://www.ne

Chromosome represented by an immutable list of a fixed length. @param <T> type of the representation list @since 2.0

Abstract base class for implementations of MultipleLinearRegression. @since 2.0

Base class for multivariate probability distributions. @since 3.1

Base class for implementing optimization problems. It contains the boiler-plate code for counting the number of evaluations of the objective function

This abstract class provides boilerplate parameters list. @since 3.0

Base class for solvers. @since 3.0

Base class for probability distributions on the reals. Default implementations are provided for some of the methods that do not vary from distribution

Basic implementation of RealMatrix methods regardless of the underlying storage. <p>All the methods implemented here use {@link #getEntry(int, int)} t

This abstract class represents an interpolator over the last step during an ODE integration. <p>The various ODE integrators provide objects extending

Abstract base class for implementations of the {@link StorelessUnivariateStatistic} interface. <p> Provides default {@code evaluate(double[],...)} and

Provide a default implementation for several functions useful to generic solvers. @since 3.1

Base class for solvers. @since 3.0

Abstract base class for implementations of the {@link UnivariateStatistic} interface. <p> Provides a default implementation of <code>evaluate(double[]

Test cases for {@link AbstractUnivariateStatistic}.

Portable alternative to {@link Math} and {@link StrictMath}. <p> Caveat: At the time of implementation, the {@code AccurateMath} functions were often

Class used to compute the classical functions tables. @since 3.0

Utility class for loading tabulated data used by {@link AccurateMath}.

Test to compare AccurateMath results against StrictMath results for boundary values. <p> Running all tests independently: <br> {@code mvn test -Dtest=

Arc-cosine function. @since 3.0

Hyperbolic arc-cosine function. @since 3.0

Enumerate for actions to be performed when an event occurs.

Enumerates for actions to be performed when an event occurs during ODE integration. @since 3.6

This class implements explicit Adams-Bashforth integrators for Ordinary Differential Equations. <p>Adams-Bashforth methods (in fact due to Adams alon

This class implements explicit Adams-Bashforth integrators for Ordinary Differential Equations. <p>Adams-Bashforth methods (in fact due to Adams alon

Base class for {@link AdamsBashforthFieldIntegrator Adams-Bashforth} and {@link AdamsMoultonFieldIntegrator Adams-Moulton} integrators. @param <T> the

This class implements an interpolator for Adams integrators using Nordsieck representation. <p>This interpolator computes dense output around the cur

Base class for {@link AdamsBashforthIntegrator Adams-Bashforth} and {@link AdamsMoultonIntegrator Adams-Moulton} integrators. @since 2.0

This class implements implicit Adams-Moulton integrators for Ordinary Differential Equations. <p>Adams-Moulton methods (in fact due to Adams alone) a

This class implements implicit Adams-Moulton integrators for Ordinary Differential Equations. <p>Adams-Moulton methods (in fact due to Adams alone) a

Transformer to Nordsieck vectors for Adams integrators. <p>This class is used by {@link AdamsBashforthIntegrator Adams-Bashforth} and {@link AdamsMoul

Transformer to Nordsieck vectors for Adams integrators. <p>This class is used by {@link AdamsBashforthIntegrator Adams-Bashforth} and {@link AdamsMoul

This abstract class holds the common part of all adaptive stepsize integrators for Ordinary Differential Equations. <p>These algorithms perform integ

This abstract class holds the common part of all adaptive stepsize integrators for Ordinary Differential Equations. <p>These algorithms perform integ

Add the two operands. @since 3.0

<p> An aggregator for {@code SummaryStatistics} from several data sets or data set partitions. In its simplest usage mode, the client creates an inst

Test cases for {@link AggregateSummaryStatistics}

A SummaryStatistics that also forwards all values added to it to a second {@code SummaryStatistics} for aggregation. @since 2.0

Computes a cubic spline interpolation for the data set using the Akima algorithm, as originally formulated by Hiroshi Akima in his 1970 paper "A New M

Enumerates the kinds of solutions that a {@link BracketedUnivariateSolver (bracketed univariate real) root-finding algorithm} may accept as solutions.

Interface defining very basic matrix operations. @since 2.0

Utility class for transforming the list of arguments passed to constructors of exceptions.

Test for {@link ArgUtils}.

Implementation of {@code FieldMatrix<T>} using a {@link FieldElement}[][] array to store entries. <p> As specified in the {@link FieldMatrix} interfac

Implementation of {@link RealMatrix} using a {@code double[][]} array to store entries.

Test cases for the {@link Array2DRowRealMatrix} class.

This class implements the {@link FieldVector} interface with a {@link FieldElement} array. @param <T> the type of the field elements @since 2.0

Test cases for the {@link ArrayFieldVector} class.

This class implements the {@link RealVector} interface with a double array. @since 2.0

Test cases for the {@link ArrayRealVector} class.

Arc-sine function. @since 3.0

Hyperbolic arc-sine function. @since 3.0

Arc-tangent function. @since 3.0

Arc-tangent function. @since 3.0

Hyperbolic arc-tangent function. @since 3.0

Powell's BOBYQA algorithm. This implementation is translated and adapted from the Fortran version available <a href="https://plato.asu.edu/ftp/other_s

Test for {@link BOBYQAOptimizer}.

"Bad" test percentile implementation - no setQuantile method.

Provide a default implementation for several generic functions. @since 1.2

Provide a default implementation for several functions useful to generic solvers. The default values for relative and function tolerances are 1e-14 an

Base class multi-start optimizer for a multivariate function. <br> This class wraps an optimizer in order to use it several times in turn with differe

Base class for implementing optimizers for multivariate functions. It contains the boiler-plate code for initial guess and bounds specifications. <em>

Base class for implementing optimizers. It contains the boiler-plate code for counting the number of evaluations of the objective function and the num

Tests for {@link BaseOptimizer}.

Base class for rules that determines the integration nodes and their weights. Subclasses must implement the {@link #computeRule(int) computeRule} meth

Test for {@link BaseRuleFactory}.

Base class for all bracketing <em>Secant</em>-based methods for root-finding (approximating a zero of a univariate real function). <p>Implementation

Base class for root-finding algorithms tests derived from {@link BaseSecantSolver}.

Interface for (univariate real) rootfinding algorithms. Implementations will search for only one zero in the given interval. This class is not intend

This class provides computation methods related to Bessel functions of the first kind. Detailed descriptions of these functions are available in <a hr

Encapsulates the results returned by {@link BesselJ#rjBesl(double, double, int)}. <p> {@link #getVals()} returns the computed function values. {@link

Class transforming any matrix to bi-diagonal shape. <p>Any m &times; n matrix A can be written as the product of three matrices: A = U &times; B &time