enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Logarithmic decrement - Wikipedia

    en.wikipedia.org/wiki/Logarithmic_decrement

    The logarithmic decrement can be obtained e.g. as ln(x 1 /x 3).Logarithmic decrement, , is used to find the damping ratio of an underdamped system in the time domain.. The method of logarithmic decrement becomes less and less precise as the damping ratio increases past about 0.5; it does not apply at all for a damping ratio greater than 1.0 because the system is overdamped.

  3. Iterated logarithm - Wikipedia

    en.wikipedia.org/wiki/Iterated_logarithm

    In computer science, lg * is often used to indicate the binary iterated logarithm, which iterates the binary logarithm (with base ) instead of the natural logarithm (with base e). Mathematically, the iterated logarithm is well defined for any base greater than e 1 / e ≈ 1.444667 {\displaystyle e^{1/e}\approx 1.444667} , not only for base 2 ...

  4. Pollard's rho algorithm for logarithms - Wikipedia

    en.wikipedia.org/wiki/Pollard's_rho_algorithm_for...

    Download QR code; Print/export Download as PDF; ... Pollard's rho algorithm for logarithms is an algorithm introduced by John Pollard in 1978 to solve the ...

  5. Change of base - Wikipedia

    en.wikipedia.org/wiki/Change_of_base

    In mathematics, change of base can mean any of several things: . Changing numeral bases, such as converting from base 2 to base 10 ().This is known as base conversion.; The logarithmic change-of-base formula, one of the logarithmic identities used frequently in algebra and calculus.

  6. LogSumExp - Wikipedia

    en.wikipedia.org/wiki/LogSumExp

    The LSE function is often encountered when the usual arithmetic computations are performed on a logarithmic scale, as in log probability. [5]Similar to multiplication operations in linear-scale becoming simple additions in log-scale, an addition operation in linear-scale becomes the LSE in log-scale:

  7. Logarithmic number system - Wikipedia

    en.wikipedia.org/wiki/Logarithmic_number_system

    One part of this machine called an "endless spindle" allowed the mechanical expression of the relation = ⁡ (+), [14] with the aim of extracting the logarithm of a sum as a sum of logarithms. A LNS has been used in the Gravity Pipe special-purpose supercomputer [15] that won the Gordon Bell Prize in 1999.

  8. Baby-step giant-step - Wikipedia

    en.wikipedia.org/wiki/Baby-step_giant-step

    Alternatively one can use Pollard's rho algorithm for logarithms, which has about the same running time as the baby-step giant-step algorithm, but only a small memory requirement. While this algorithm is credited to Daniel Shanks, who published the 1971 paper in which it first appears, a 1994 paper by Nechaev [ 3 ] states that it was known to ...

  9. Logarithmic mean - Wikipedia

    en.wikipedia.org/wiki/Logarithmic_mean

    From the mean value theorem, there exists a value ξ in the interval between x and y where the derivative f ′ equals the slope of the secant line: (,): ′ = ()The logarithmic mean is obtained as the value of ξ by substituting ln for f and similarly for its corresponding derivative: