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. 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 = ...

  4. Thread-local storage - Wikipedia

    en.wikipedia.org/wiki/Thread-local_storage

    In computer programming, thread-local storage (TLS) is a memory management method that uses static or global memory local to a thread. The concept allows storage of data that appears to be global in a system with separate threads. Many systems impose restrictions on the size of the thread-local memory block, in fact often rather tight limits.

  5. Numerical methods for ordinary differential equations - Wikipedia

    en.wikipedia.org/wiki/Numerical_methods_for...

    For example, the shooting method (and its variants) or global methods like finite differences, [3] Galerkin methods, [4] or collocation methods are appropriate for that class of problems. The Picard–Lindelöf theorem states that there is a unique solution, provided f is Lipschitz-continuous .

  6. Galerkin method - Wikipedia

    en.wikipedia.org/wiki/Galerkin_method

    Examples of Galerkin methods are: the Galerkin method of weighted residuals, the most common method of calculating the global stiffness matrix in the finite element method, [3] [4] the boundary element method for solving integral equations, Krylov subspace methods. [5]

  7. Numerical stability - Wikipedia

    en.wikipedia.org/wiki/Numerical_stability

    Numerical stability is affected by the number of the significant digits the machine keeps. If a machine is used that keeps only the four most significant decimal digits, a good example on loss of significance can be given by the two equivalent functions

  8. List of numerical analysis topics - Wikipedia

    en.wikipedia.org/wiki/List_of_numerical_analysis...

    Hilbert matrix — example of a matrix which is extremely ill-conditioned (and thus difficult to handle) Wilkinson matrix — example of a symmetric tridiagonal matrix with pairs of nearly, but not exactly, equal eigenvalues; Convergent matrix — square matrix whose successive powers approach the zero matrix; Algorithms for matrix multiplication:

  9. Midpoint method - Wikipedia

    en.wikipedia.org/wiki/Midpoint_method

    Illustration of numerical integration for the equation ′ =, = Blue: the Euler method, green: the midpoint method, red: the exact solution, =. The step size is = The same illustration for =