Package smile.math


package smile.math
Basic mathematical functions, complex, differentiable function interfaces, random number generators, unconstrained optimization, and raw data type (int and double) array lists, etc.
  • Class
    Description
    The Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm is an iterative method for solving unconstrained nonlinear optimization problems.
    Complex number.
    Packed array of complex numbers for better memory efficiency.
    A differentiable function is a function whose derivative exists at each point in its domain.
    A differentiable function is a function whose derivative exists at each point in its domain.
    An interface representing a univariate real function.
    Histogram utilities.
    An interface representing a univariate int function.
    The Levenberg–Marquardt algorithm.
    Extra basic numeric functions.
    An interface representing a multivariate real function.
    This is a high quality random number generator as a replacement of the standard Random class of Java system.
    Root finding algorithms.
    Affine transformation y = (x - offset) / scale.
    A time-dependent function.