When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Truncation error (numerical integration) - Wikipedia

    en.wikipedia.org/wiki/Truncation_error...

    The relation between local and global truncation errors is slightly different from in the simpler setting of one-step methods. For linear multistep methods, an additional concept called zero-stability is needed to explain the relation between local and global truncation errors.

  3. Finite difference method - Wikipedia

    en.wikipedia.org/wiki/Finite_difference_method

    For example, consider the ordinary differential equation ′ = + The Euler method for solving this equation uses the finite difference quotient (+) ′ to approximate the differential equation by first substituting it for u'(x) then applying a little algebra (multiplying both sides by h, and then adding u(x) to both sides) to get (+) + (() +).

  4. Truncation error - Wikipedia

    en.wikipedia.org/wiki/Truncation_error

    Example A: Find the truncation in calculating the first derivative of () = at = using a step size of = Solution: The first derivative of () = is ′ =, and at = ...

  5. Global field - Wikipedia

    en.wikipedia.org/wiki/Global_field

    called the local Artin symbol, the local reciprocity map or the norm residue symbol. [4] [5] Let L⁄K be a Galois extension of global fields and C L stand for the idèle class group of L. The maps θ v for different places v of K can be assembled into a single global symbol map by multiplying the local

  6. Round-off error - Wikipedia

    en.wikipedia.org/wiki/Round-off_error

    For example, = = =. The result 1 × 10 − 3 {\displaystyle 1\times 10^{-3}} is clearly representable, but there is not much faith in it. This is closely related to the phenomenon of catastrophic cancellation , in which the two numbers are known to be approximations.

  7. Kahan summation algorithm - Wikipedia

    en.wikipedia.org/wiki/Kahan_summation_algorithm

    For example, if the summands are uncorrelated random numbers with zero mean, the sum is a random walk, and the condition number will grow proportional to . On the other hand, for random inputs with nonzero mean the condition number asymptotes to a finite constant as n → ∞ {\displaystyle n\to \infty } .

  8. Global truncation error - Wikipedia

    en.wikipedia.org/?title=Global_truncation_error&...

    This page was last edited on 28 February 2012, at 15:06 (UTC).; Text is available under the Creative Commons Attribution-ShareAlike 4.0 License; additional terms may apply.

  9. Verlet integration - Wikipedia

    en.wikipedia.org/wiki/Verlet_integration

    Verlet integration (French pronunciation:) is a numerical method used to integrate Newton's equations of motion. [1] It is frequently used to calculate trajectories of particles in molecular dynamics simulations and computer graphics.