When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Midpoint method - Wikipedia

    en.wikipedia.org/wiki/Midpoint_method

    The midpoint method computes + so that the red chord is approximately parallel to the tangent line at the midpoint (the green line). In numerical analysis , a branch of applied mathematics , the midpoint method is a one-step method for numerically solving the differential equation ,

  3. Numerical methods for ordinary differential equations - Wikipedia

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

    For example, the second-order equation y′′ = −y can be rewritten as two first-order equations: y′ = z and z′ = −y. In this section, we describe numerical methods for IVPs, and remark that boundary value problems (BVPs) require a different set of tools. In a BVP, one defines values, or components of the solution y at more than one ...

  4. Midpoint - Wikipedia

    en.wikipedia.org/wiki/Midpoint

    Given two points of interest, finding the midpoint of the line segment they determine can be accomplished by a compass and straightedge construction.The midpoint of a line segment, embedded in a plane, can be located by first constructing a lens using circular arcs of equal (and large enough) radii centered at the two endpoints, then connecting the cusps of the lens (the two points where the ...

  5. Gauss–Legendre method - Wikipedia

    en.wikipedia.org/wiki/Gauss–Legendre_method

    In numerical analysis and scientific computing, the Gauss–Legendre methods are a family of numerical methods for ordinary differential equations. Gauss–Legendre methods are implicit Runge–Kutta methods. More specifically, they are collocation methods based on the points of Gauss–Legendre quadrature.

  6. Sagitta (geometry) - Wikipedia

    en.wikipedia.org/wiki/Sagitta_(geometry)

    In geometry, the sagitta (sometimes abbreviated as sag [1]) of a circular arc is the distance from the midpoint of the arc to the midpoint of its chord. [2] It is used extensively in architecture when calculating the arc necessary to span a certain height and distance and also in optics where it is used to find the depth of a spherical mirror ...

  7. Projective harmonic conjugate - Wikipedia

    en.wikipedia.org/wiki/Projective_harmonic_conjugate

    Midpoint and infinity are harmonic conjugates. When x is the midpoint of the segment from a to b, then = = By the cross-ratio criterion, the harmonic conjugate of x will be y when t(y) = 1. But there is no finite solution for y on the line through a and b.

  8. Arc elasticity - Wikipedia

    en.wikipedia.org/wiki/Arc_elasticity

    The y arc elasticity of x is defined as: , = % % where the percentage change in going from point 1 to point 2 is usually calculated relative to the midpoint: % = (+) /; % = (+) /. The use of the midpoint arc elasticity formula (with the midpoint used for the base of the change, rather than the initial point (x 1, y 1) which is used in almost all other contexts for calculating percentages) was ...

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