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.
    Histogram utilities.
    The Levenberg–Marquardt algorithm.
    Extra basic numeric functions.
    This is a high quality random number generator as a replacement of the standard Random class of Java system.
    Affine transformation y = (x - offset) / scale.