enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Ehrenfest equations - Wikipedia

    en.wikipedia.org/wiki/Ehrenfest_equations

    Ehrenfest equations (named after Paul Ehrenfest) are equations which describe changes in specific heat capacity and derivatives of specific volume in second-order phase transitions. The Clausius–Clapeyron relation does not make sense for second-order phase transitions, [ 1 ] as both specific entropy and specific volume do not change in second ...

  3. Beam and Warming scheme - Wikipedia

    en.wikipedia.org/wiki/Beam_and_Warming_scheme

    In numerical mathematics, Beam and Warming scheme or Beam–Warming implicit scheme introduced in 1978 by Richard M. Beam and R. F. Warming, [1] [2] is a second order accurate implicit scheme, mainly used for solving non-linear hyperbolic equations. It is not used much nowadays.

  4. MUSCL scheme - Wikipedia

    en.wikipedia.org/wiki/MUSCL_scheme

    Thus, the accuracy of a TVD discretization degrades to first order at local extrema, but tends to second order over smooth parts of the domain. The algorithm is straight forward to implement. Once a suitable scheme for F i + 1 / 2 ∗ {\displaystyle F_{i+1/2}^{*}} has been chosen, such as the Kurganov and Tadmor scheme (see below), the solution ...

  5. Crank–Nicolson method - Wikipedia

    en.wikipedia.org/wiki/Crank–Nicolson_method

    The Crank–Nicolson stencil for a 1D problem. The Crank–Nicolson method is based on the trapezoidal rule, giving second-order convergence in time.For linear equations, the trapezoidal rule is equivalent to the implicit midpoint method [citation needed] —the simplest example of a Gauss–Legendre implicit Runge–Kutta method—which also has the property of being a geometric integrator.

  6. Lax–Wendroff method - Wikipedia

    en.wikipedia.org/wiki/Lax–Wendroff_method

    What follows is the Richtmyer two-step Lax–Wendroff method. The first step in the Richtmyer two-step Lax–Wendroff method calculates values for f(u(x, t)) at half time steps, t n + 1/2 and half grid points, x i + 1/2.

  7. List of finite element software packages - Wikipedia

    en.wikipedia.org/wiki/List_of_finite_element...

    mesh high-order mapping: Any? Second-order is the default for most cases. arbitrary-order meshes and NURBS meshes any order Yes, for Lagrange elements (Any - work in progress) mesh generation: Built-in meshing miniapps and target-matrix mesh optimization experimental in any dimension + predefined shapes + Extrusion.

  8. QUICK scheme - Wikipedia

    en.wikipedia.org/wiki/Quick_scheme

    In order to find the cell face value a quadratic function passing through two bracketing or surrounding nodes and one node on the upstream side must be used. In central differencing scheme and second order upwind scheme the first order derivative is included and the second order derivative is ignored.

  9. Symplectic integrator - Wikipedia

    en.wikipedia.org/wiki/Symplectic_integrator

    The Verlet method is the second-order integrator with = and coefficients =, =, = =. Since c 1 = 0 {\displaystyle c_{1}=0} , the algorithm above is symmetric in time. There are 3 steps to the algorithm, and step 1 and 3 are exactly the same, so the positive time version can be used for negative time.