When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Linear recurrence with constant coefficients - Wikipedia

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

    which is the characteristic equation of the recurrence relation. Solve for to obtain the two roots , : these roots are known as the characteristic roots or eigenvalues of the characteristic equation. Different solutions are obtained depending on the nature of the roots: If these roots are distinct, we have the general solution

  3. Characteristic equation (calculus) - Wikipedia

    en.wikipedia.org/wiki/Characteristic_equation...

    If the characteristic equation has a root r 1 that is repeated k times, then it is clear that y p (x) = c 1 e r 1 x is at least one solution. [1] However, this solution lacks linearly independent solutions from the other k − 1 roots. Since r 1 has multiplicity k, the differential equation can be factored into [1]

  4. Muller's method - Wikipedia

    en.wikipedia.org/wiki/Muller's_method

    Muller's method is a root-finding algorithm, a numerical method for solving equations of the form f(x) = 0.It was first presented by David E. Muller in 1956.. Muller's method proceeds according to a third-order recurrence relation similar to the second-order recurrence relation of the secant method.

  5. Method of characteristics - Wikipedia

    en.wikipedia.org/wiki/Method_of_characteristics

    In mathematics, the method of characteristics is a technique for solving partial differential equations. Typically, it applies to first-order equations , though in general characteristic curves can also be found for hyperbolic and parabolic partial differential equation .

  6. Frobenius method - Wikipedia

    en.wikipedia.org/wiki/Frobenius_method

    The previous example involved an indicial polynomial with a repeated root, which gives only one solution to the given differential equation. In general, the Frobenius method gives two independent solutions provided that the indicial equation's roots are not separated by an integer (including zero).

  7. Wu's method of characteristic set - Wikipedia

    en.wikipedia.org/wiki/Wu's_method_of...

    The Ritt–Wu process, first devised by Ritt, subsequently modified by Wu, computes not a Ritt characteristic but an extended one, called Wu characteristic set or ascending chain. A non-empty subset T of the ideal F generated by F is a Wu characteristic set of F if one of the following condition holds T = {a} with a being a nonzero constant,

  8. Semi-implicit Euler method - Wikipedia

    en.wikipedia.org/wiki/Semi-implicit_Euler_method

    The semi-implicit method models the simulated system correctly if the complex roots of the characteristic equation are within the circle shown below. For real roots the stability region extends outside the circle for which the criterion is s > − 2 / Δ t {\displaystyle s>-2/\Delta t}

  9. Characteristic polynomial - Wikipedia

    en.wikipedia.org/wiki/Characteristic_polynomial

    The characteristic equation, also known as the determinantal equation, [1] [2] [3] is the equation obtained by equating the characteristic polynomial to zero. In spectral graph theory , the characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix .