When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Characteristic equation (calculus) - Wikipedia

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

    where c 1 and c 2 are constants that can be non-real and which depend on the initial conditions. [6] (Indeed, since y(x) is real, c 1 − c 2 must be imaginary or zero and c 1 + c 2 must be real, in order for both terms after the last equals sign to be real.) For example, if c 1 = c 2 = ⁠ 1 / 2 ⁠, then the particular solution y 1 (x) = e ax ...

  3. Collocation method - Wikipedia

    en.wikipedia.org/wiki/Collocation_method

    In mathematics, a collocation method is a method for the numerical solution of ordinary differential equations, partial differential equations and integral equations.The idea is to choose a finite-dimensional space of candidate solutions (usually polynomials up to a certain degree) and a number of points in the domain (called collocation points), and to select that solution which satisfies the ...

  4. Method of undetermined coefficients - Wikipedia

    en.wikipedia.org/wiki/Method_of_undetermined...

    g(x) is a constant, a polynomial function, exponential function , sine or cosine functions ⁡ or ⁡, or finite sums and products of these functions (, constants). The method consists of finding the general homogeneous solution y c {\displaystyle y_{c}} for the complementary linear homogeneous differential equation

  5. Conjugate gradient method - Wikipedia

    en.wikipedia.org/wiki/Conjugate_gradient_method

    Conjugate gradient, assuming exact arithmetic, converges in at most n steps, where n is the size of the matrix of the system (here n = 2). In mathematics , the conjugate gradient method is an algorithm for the numerical solution of particular systems of linear equations , namely those whose matrix is positive-semidefinite .

  6. System of polynomial equations - Wikipedia

    en.wikipedia.org/wiki/System_of_polynomial_equations

    Thus solving a polynomial system over a number field is reduced to solving another system over the rational numbers. For example, if a system contains 2 {\displaystyle {\sqrt {2}}} , a system over the rational numbers is obtained by adding the equation r 2 22 = 0 and replacing 2 {\displaystyle {\sqrt {2}}} by r 2 in the other equations.

  7. Confluent hypergeometric function - Wikipedia

    en.wikipedia.org/wiki/Confluent_hypergeometric...

    The powers of z are taken using −3π/2 < arg z ≤ π/2. [3] The first term is not needed when Γ( b − a ) is finite, that is when b − a is not a non-positive integer and the real part of z goes to negative infinity, whereas the second term is not needed when Γ( a ) is finite, that is, when a is a not a non-positive integer and the real ...

  8. Numerical methods for ordinary differential equations

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

    Because of this, different methods need to be used to solve BVPs. For example, the shooting method (and its variants) or global methods like finite differences, [3] Galerkin methods, [4] or collocation methods are appropriate for that class of problems. The Picard–Lindelöf theorem states that there is a unique solution, provided f is ...

  9. Differential-algebraic system of equations - Wikipedia

    en.wikipedia.org/wiki/Differential-algebraic...

    In mathematics, a differential-algebraic system of equations (DAE) is a system of equations that either contains differential equations and algebraic equations, or is equivalent to such a system. The set of the solutions of such a system is a differential algebraic variety , and corresponds to an ideal in a differential algebra of differential ...