When.com Web Search

  1. Ad

    related to: second order linear ode calculator with steps and two points given one

Search results

  1. Results From The WOW.Com Content Network
  2. Reduction of order - Wikipedia

    en.wikipedia.org/wiki/Reduction_of_order

    Reduction of order (or d’Alembert reduction) is a technique in mathematics for solving second-order linear ordinary differential equations. It is employed when one solution y 1 ( x ) {\displaystyle y_{1}(x)} is known and a second linearly independent solution y 2 ( x ) {\displaystyle y_{2}(x)} is desired.

  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. Frobenius method - Wikipedia

    en.wikipedia.org/wiki/Frobenius_method

    Some solutions of a differential equation having a regular singular point with indicial roots = and .. In mathematics, the method of Frobenius, named after Ferdinand Georg Frobenius, is a way to find an infinite series solution for a linear second-order ordinary differential equation of the form ″ + ′ + = with ′ and ″.

  5. Linear recurrence with constant coefficients - Wikipedia

    en.wikipedia.org/wiki/Linear_recurrence_with...

    In mathematics (including combinatorics, linear algebra, and dynamical systems), a linear recurrence with constant coefficients [1]: ch. 17 [2]: ch. 10 (also known as a linear recurrence relation or linear difference equation) sets equal to 0 a polynomial that is linear in the various iterates of a variable—that is, in the values of the elements of a sequence.

  6. Linear multistep method - Wikipedia

    en.wikipedia.org/wiki/Linear_multistep_method

    Single-step methods (such as Euler's method) refer to only one previous point and its derivative to determine the current value. Methods such as Runge–Kutta take some intermediate steps (for example, a half-step) to obtain a higher order method, but then discard all previous information before taking a second step. Multistep methods attempt ...

  7. Power series solution of differential equations - Wikipedia

    en.wikipedia.org/wiki/Power_series_solution_of...

    A further restriction is that the series coefficients will be specified by a nonlinear recurrence (the nonlinearities are inherited from the differential equation). In order for the solution method to work, as in linear equations, it is necessary to express every term in the nonlinear equation as a power series so that all of the terms may be ...

  8. Chebyshev equation - Wikipedia

    en.wikipedia.org/wiki/Chebyshev_equation

    The recurrence may be started with arbitrary values of a 0 and a 1, leading to the two-dimensional space of solutions that arises from second order differential equations. The standard choices are: a 0 = 1 ; a 1 = 0, leading to the solution

  9. Laguerre polynomials - Wikipedia

    en.wikipedia.org/wiki/Laguerre_polynomials

    Complex color plot of the Laguerre polynomial L n(x) with n as -1 divided by 9 and x as z to the power of 4 from -2-2i to 2+2i. In mathematics, the Laguerre polynomials, named after Edmond Laguerre (1834–1886), are nontrivial solutions of Laguerre's differential equation: ″ + ′ + =, = which is a second-order linear differential equation.