Get the relative accuracy of the solver. The contract for relative accuracy is the same as {@link #getAbsoluteAccuracy()}, but using relative, rather

@param x Number. @return ulp(x). @see Math#ulp(double)

Retrieves the neurons in the neighbourhood of any neuron in the {@code neurons} list. @param neurons Neurons for which to retrieve the neighbours. @re

Get the {@link Field} to which the instance belongs. @return {@link Field} to which the instance belongs

{@inheritDoc} The returned {@code String} is equal to {@code Double.toString(this.doubleValue())} @see Double#toString(double)

Get the entries at the given column index as an array. Column indices start at 0. @param column Column to be fetched. @return the array of entries in

Compute the value of the function. @param x Point at which the function value should be computed. @return the value of the function. @throws IllegalA

Adds an element to the end of this expandable array. @param value to be added to end of array

End visiting a vector. This method is called once, after all entries of the vector have been visited. @return the value returned by {@link RealVector

Generic dense iterator. Iteration is in increasing order of the vector index. <p>Note: derived classes are required to return an {@link Iterator} tha

Visit one entry of the vector. @param index the index of the entry being visited @param value the value of the entry being visited @return the new va

{@inheritDoc}

Get the derivation orders for a specific index in the array. <p> This method is the inverse of {@link #getPartialDerivativeIndex(int...)}. </p> @param

Power operation. @param p power to apply @return this^p

Parses a string to produce a {@link Complex} object. @param source the string to parse. @return the parsed {@link Complex} object. @throws MathParseE

Compute the value of the function for the given argument. <p> The value returned is </p><p> {@code coefficients[n] x^n + ... + coefficients[1] x +

Add a value to the data. @param value the value to add

Creates a (deep) copy of the simplex points. @return the points.

Returns the (immutable) inner representation of the chromosome. @return the representation of the chromosome

Get main state at time. @return main state at time

{@inheritDoc}

@param x Operand. @param y Operand. @return the result of applying this operator.

Returns the number of values equal to v. @param v the value to lookup. @return the frequency of v.

Returns matrix entries as a two-dimensional array. @return 2-dimensional array of entries

@param dim Dimension. @return the function for the given dimension.

Create a fraction. @param field field to which the elements belong @param p numerator @param q denominator @return p/q computed in the instance field

{@inheritDoc}

Compares with result obtained from "Commons Math". @param a "o.a.c.m.field.linalg" result. @param b "o.a.c.m.linear" result. @param tol Tolerance.

Get the entries at the given column index as a vector. Column indices start at 0. @param column Column to be fetched. @return a column vector. @throw

Compute this - a. @param a element to subtract @return a new element representing this - a @throws NullArgumentException if {@code a} is {@code null}.

Creates a sampler. @param rng Generator of uniformly distributed numbers. @return a sampler that produces random numbers according this distribution.

Access the first chromosome. @return the first chromosome.

Multiply this by x. @param x multiplicand @return product of this and x

Set the time of the interpolated point. <p>Setting the time outside of the current step is now allowed, but should be used with care since the accurac

Get the number of times the algorithm iterated in order to produce this optimum. In general least squares it is common to have one {@link #getEvaluati

Visit (and possibly change) all matrix entries using the fastest possible order. <p>The fastest walking order depends on the exact matrix class. It ma

Get the current grid point time. @return current grid point time

Retrieves the neuron at location {@code (i, j)} in the map. The neuron at position {@code (0, 0)} is located at the upper-left corner of the map. @pa

Access the second chromosome. @return the second chromosome.

Find the maximum of two field elements. @param <T> the type of the field elements @param e1 first element @param e2 second element @return max(a1, e2)

Returns the result of multiplying this by the vector {@code v}. @param v the vector to operate on @return {@code this v} @throws DimensionMismatchExc

Getcurrent step start. @return current step start

Builds from a given set of coordinates. @param simplex Simplex coordinates. @return a new instance. @throws NotStrictlyPositiveException if the refer

Add an event handler to the integrator. Uses a default {@link UnivariateSolver} with an absolute accuracy equal to the given convergence threshold, as

Returns a (deep) copy of this. @return matrix copy

Get the mapper for the set of equations. @return mapper for the set of equations

Updates the internal state of the statistic to reflect the addition of the new value. @param d the new value.

{@inheritDoc}

Get the maximal value error encountered during integration. @return maximal value error

Set all elements to a single value. @param value single value to set for all elements

Gets a submatrix. Rows and columns are indicated counting from 0 to n-1. @param startRow Initial row index @param endRow Final row index (inclusive)

Get the constant 0. @return a Dfp with value zero

Returns the derivative as a {@link PolynomialFunction}. @return the derivative polynomial.

Adds the observation (x,y) to the regression data set. <p> Uses updating formulas for means and sums of squares defined in "Algorithms for Computing t

Raises a trap. This does not set the corresponding flag however. @param type the trap type @param what - name of routine trap occurred in @param o

Sets some bits in the IEEE 854 status flags, without changing the already set bits. <p> Calling this method is equivalent to call {@code setIEEEFlags(

This method is used to verify that the input parameters designate a subarray of positive length. <ul> <li>returns <code>true</code> iff the parameters

Verifies that the two arguments are exactly the same, either both NaN or infinities of same sign, or identical floating point values.

Compute the derivatives related to the secondary state parameters. @param t current value of the independent <I>time</I> variable @param primary array

Check if instance is equal to x. @param other object to check instance against @return true if instance is equal to x and neither are NaN, false other

Gets the coefficients of the constraint (left hand side). @return the coefficients of the constraint (left hand side).

Check if a row index is valid. @param m Matrix. @param row Row index to check. @throws OutOfRangeException if {@code row} is not a valid index.

Get the key of current entry. @return key of current entry @exception ConcurrentModificationException if the map is modified during iteration @excepti

{@inheritDoc}

Exponential. @return exponential of the instance

Check if instance is infinite. @return true if instance is infinite

{@inheritDoc} @since 3.2

Clear the double array.

Gets the neuron's identifier. @return the identifier.

Get the index of the entry. @return the index of the entry.

Get the <a href="https://en.wikipedia.org/wiki/Moore%E2%80%93Penrose_pseudoinverse">pseudo-inverse</a> of the decomposed matrix. <p> <em>This is equal

Get the maximal time error encountered during integration. @return maximal time error

Compute a linear combination. @param a Factors. @param b Factors. @return <code>&Sigma;_i a_i b_i</code>. @throws Dimens

Multiply a double number by a power of 2. @param d number to multiply @param n power of 2 @return d &times; 2ⁿ

Check if a column index is valid. @param m Matrix. @param column Column index to check. @throws OutOfRangeException if {@code column} is not a valid

Get the points contained in the cluster. @return points contained in the cluster

Get the current step size. @return current step size

{@inheritDoc}

Get the next machine representable number after a number, moving in the direction of another number. <p> The ordering is as follows (increasing): <ul>

Returns the result of multiplying each entry of {@code this} by {@code d}. @param d value to multiply all entries by @return {@code d this}

Visits (but does not alter) all entries of this vector in default order (increasing index). @param visitor the visitor to be used to process the entr

Get the derivation order. @return derivation order

Get the previous grid point time. @return previous grid point time

Assert the atan2(y, x) value is a fraction of pi. @param y ordinate @param x abscissa @param numerator numerator of the fraction of pi (including the

{@inheritDoc}

@param func Function to optimize. @param startPoint Starting point. @param inSigma Individual input sigma. @param boundaries Upper / lower point limit

Get the state at current grid point time. @return state at current grid point time

{@inheritDoc}

Add x to this. @param x number to add @return sum of this and x