enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Riemann–Siegel formula - Wikipedia

    en.wikipedia.org/wiki/RiemannSiegel_formula

    Siegel derived it from the Riemann–Siegel integral formula, an expression for the zeta function involving contour integrals. It is often used to compute values of the Riemann–Siegel formula, sometimes in combination with the Odlyzko–Schönhage algorithm which speeds it up considerably.

  3. Z function - Wikipedia

    en.wikipedia.org/wiki/Z_function

    In mathematics, the Z function is a function used for studying the Riemann zeta function along the critical line where the argument is one-half. It is also called the Riemann–Siegel Z function, the Riemann–Siegel zeta function, the Hardy function, the Hardy Z function and the Hardy zeta function.

  4. List of formulas in Riemannian geometry - Wikipedia

    en.wikipedia.org/wiki/List_of_formulas_in...

    The Weyl tensor has the same basic symmetries as the Riemann tensor, but its 'analogue' of the Ricci tensor is zero: = = = = The Ricci tensor, the Einstein tensor, and the traceless Ricci tensor are symmetric 2-tensors:

  5. Riemann–Siegel theta function - Wikipedia

    en.wikipedia.org/wiki/RiemannSiegel_theta...

    In mathematics, the Riemann–Siegel theta function is defined in terms of the gamma function as = ⁡ ((+)) ⁡for real values of t.Here the argument is chosen in such a way that a continuous function is obtained and () = holds, i.e., in the same way that the principal branch of the log-gamma function is defined.

  6. On the Number of Primes Less Than a Given Magnitude

    en.wikipedia.org/wiki/On_the_Number_of_Primes...

    The analytic continuation of this zeta function ζ to all complex s ≠ 1; The entire function ξ(s), related to the zeta function through the gamma function (or the Π function, in Riemann's usage) The discrete function J(x) defined for x ≥ 0, which is defined by J(0) = 0 and J(x) jumps by 1/n at each prime power p n. (Riemann calls this ...

  7. Odlyzko–Schönhage algorithm - Wikipedia

    en.wikipedia.org/wiki/Odlyzko–Schönhage_algorithm

    In mathematics, the Odlyzko–Schönhage algorithm is a fast algorithm for evaluating the Riemann zeta function at many points, introduced by (Odlyzko & Schönhage 1988). The main point is the use of the fast Fourier transform to speed up the evaluation of a finite Dirichlet series of length N at O( N ) equally spaced values from O( N 2 ) to O ...

  8. Method of steepest descent - Wikipedia

    en.wikipedia.org/wiki/Method_of_steepest_descent

    In mathematics, the method of steepest descent or saddle-point method is an extension of Laplace's method for approximating an integral, where one deforms a contour integral in the complex plane to pass near a stationary point (saddle point), in roughly the direction of steepest descent or stationary phase.

  9. Bernhard Riemann - Wikipedia

    en.wikipedia.org/wiki/Bernhard_Riemann

    Georg Friedrich Bernhard Riemann (/ ˈ r iː m ɑː n /; [1] German: [ˈɡeːɔʁk ˈfʁiːdʁɪç ˈbɛʁnhaʁt ˈʁiːman] ⓘ; [2] [3] 17 September 1826 – 20 July 1866) was a German mathematician who made profound contributions to analysis, number theory, and differential geometry.