When.com Web Search

  1. Ads

    related to: homogeneous equations with complex roots solutions practice worksheet

Search results

  1. Results From The WOW.Com Content Network
  2. 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.

  3. Characteristic equation (calculus) - Wikipedia

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

    If a second-order differential equation has a characteristic equation with complex conjugate roots of the form r 1 = a + bi and r 2 = a − bi, then the general solution is accordingly y(x) = c 1 e (a + bi )x + c 2 e (a − bi )x.

  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. Homogeneous differential equation - Wikipedia

    en.wikipedia.org/wiki/Homogeneous_differential...

    A linear differential equation is homogeneous if it is a homogeneous linear equation in the unknown function and its derivatives. It follows that, if φ(x) is a solution, so is cφ(x), for any (non-zero) constant c. In order for this condition to hold, each nonzero term of the linear differential equation must depend on the unknown function or ...

  6. Factorization of polynomials - Wikipedia

    en.wikipedia.org/wiki/Factorization_of_polynomials

    A simplified version of the LLL factorization algorithm is as follows: calculate a complex (or p-adic) root α of the polynomial () to high precision, then use the Lenstra–Lenstra–Lovász lattice basis reduction algorithm to find an approximate linear relation between 1, α, α 2, α 3, . . . with integer coefficients, which might be an ...

  7. Geometrical properties of polynomial roots - Wikipedia

    en.wikipedia.org/wiki/Geometrical_properties_of...

    For simple roots, this results immediately from the implicit function theorem. This is true also for multiple roots, but some care is needed for the proof. A small change of coefficients may induce a dramatic change of the roots, including the change of a real root into a complex root with a rather large imaginary part (see Wilkinson's polynomial).