enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Tanh-sinh quadrature - Wikipedia

    en.wikipedia.org/wiki/Tanh-sinh_quadrature

    Tanh-sinh quadrature is a method for numerical integration introduced by Hidetoshi Takahashi and Masatake Mori in 1974. [1] It is especially applied where singularities or infinite derivatives exist at one or both endpoints. The method uses hyperbolic functions in the change of variables

  3. SciPy - Wikipedia

    en.wikipedia.org/wiki/SciPy

    SciPy (pronounced / ˈ s aɪ p aɪ / "sigh pie" [2]) is a free and open-source Python library used for scientific computing and technical computing. [3]SciPy contains modules for optimization, linear algebra, integration, interpolation, special functions, FFT, signal and image processing, ODE solvers and other tasks common in science and engineering.

  4. Gaussian function - Wikipedia

    en.wikipedia.org/wiki/Gaussian_function

    Mathematically, the derivatives of the Gaussian function can be represented using Hermite functions. For unit variance, the n-th derivative of the Gaussian is the Gaussian function itself multiplied by the n-th Hermite polynomial, up to scale. Consequently, Gaussian functions are also associated with the vacuum state in quantum field theory.

  5. Romberg's method - Wikipedia

    en.wikipedia.org/wiki/Romberg's_method

    Here is an example of a computer implementation of the Romberg method (in the C programming ... Rc is current row double h = b-a; //step ... method (in the Python ...

  6. Bayesian optimization - Wikipedia

    en.wikipedia.org/wiki/Bayesian_optimization

    Bayesian optimization of a function (black) with Gaussian processes (purple). Three acquisition functions (blue) are shown at the bottom. [8]Bayesian optimization is typically used on problems of the form (), where is a set of points, , which rely upon less (or equal to) than 20 dimensions (,), and whose membership can easily be evaluated.

  7. Gaussian quadrature - Wikipedia

    en.wikipedia.org/wiki/Gaussian_quadrature

    The Gaussian quadrature chooses more suitable points instead, so even a linear function approximates the function better (the black dashed line). As the integrand is the polynomial of degree 3 ( y ( x ) = 7 x 3 – 8 x 2 – 3 x + 3 ), the 2-point Gaussian quadrature rule even returns an exact result.

  8. Lanczos algorithm - Wikipedia

    en.wikipedia.org/wiki/Lanczos_algorithm

    Similarly, in Python, the SciPy package has scipy.sparse.linalg.eigsh which is also a wrapper for the SSEUPD and DSEUPD functions functions from ARPACK which use the Implicitly Restarted Lanczos Method. A Matlab implementation of the Lanczos algorithm (note precision issues) is available as a part of the Gaussian Belief Propagation Matlab Package.

  9. Generalized hypergeometric function - Wikipedia

    en.wikipedia.org/wiki/Generalized_hypergeometric...

    Generalized hypergeometric functions include the (Gaussian) hypergeometric function and the confluent hypergeometric function as special cases, which in turn have many particular special functions as special cases, such as elementary functions, Bessel functions, and the classical orthogonal polynomials.