When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Bogacki–Shampine method - Wikipedia

    en.wikipedia.org/wiki/Bogacki–Shampine_method

    Low-order methods are more suitable than higher-order methods like the Dormand–Prince method of order five, if only a crude approximation to the solution is required. Bogacki and Shampine argue that their method outperforms other third-order methods with an embedded method of order two.

  3. Newmark-beta method - Wikipedia

    en.wikipedia.org/wiki/Newmark-beta_method

    The Newmark-beta method is a method of numerical integration used to solve certain differential equations.It is widely used in numerical evaluation of the dynamic response of structures and solids such as in finite element analysis to model dynamic systems.

  4. Collocation method - Wikipedia

    en.wikipedia.org/wiki/Collocation_method

    In mathematics, a collocation method is a method for the numerical solution of ordinary differential equations, partial differential equations and integral equations.The idea is to choose a finite-dimensional space of candidate solutions (usually polynomials up to a certain degree) and a number of points in the domain (called collocation points), and to select that solution which satisfies the ...

  5. Mathematical table - Wikipedia

    en.wikipedia.org/wiki/Mathematical_table

    The first tables of trigonometric functions known to be made were by Hipparchus (c.190 – c.120 BCE) and Menelaus (c.70–140 CE), but both have been lost. Along with the surviving table of Ptolemy (c. 90 – c.168 CE), they were all tables of chords and not of half-chords, that is, the sine function. [1]

  6. 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 (+) + (() +).

  7. Godunov's scheme - Wikipedia

    en.wikipedia.org/wiki/Godunov's_scheme

    In numerical analysis and computational fluid dynamics, Godunov's scheme is a conservative numerical scheme, suggested by Sergei Godunov in 1959, [1] for solving partial differential equations. One can think of this method as a conservative finite volume method which solves exact, or approximate Riemann problems at each inter-cell boundary. In ...

  8. Relaxation (iterative method) - Wikipedia

    en.wikipedia.org/wiki/Relaxation_(iterative_method)

    These equations describe boundary-value problems, in which the solution-function's values are specified on boundary of a domain; the problem is to compute a solution also on its interior. Relaxation methods are used to solve the linear equations resulting from a discretization of the differential equation, for example by finite differences.

  9. Numerical solution of the convection–diffusion equation

    en.wikipedia.org/wiki/Numerical_solution_of_the...

    This article describes how to use a computer to calculate an approximate numerical solution of the discretized equation, in a time-dependent situation. In order to be concrete, this article focuses on heat flow, an important example where the convection–diffusion equation applies. However, the same mathematical analysis works equally well to ...