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.
    PageRank is a link analysis algorithm, and it assigns a numerical weighting to each element of a hyperlinked set of documents, such as the World Wide Web, with the purpose of "measuring" its relative importance within the set.
    A high-quality random number generator that combines two complementary generators: A UniversalGenerator (Marsaglia–Zaman–Tsang) for uniform floating-point values.
    Affine transformation y = (x - offset) / scale.