enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Numerical methods for ordinary differential equations - Wikipedia

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

  3. Tridiagonal matrix algorithm - Wikipedia

    en.wikipedia.org/wiki/Tridiagonal_matrix_algorithm

    In numerical linear algebra, the tridiagonal matrix algorithm, also known as the Thomas algorithm (named after Llewellyn Thomas), is a simplified form of Gaussian elimination that can be used to solve tridiagonal systems of equations.

  4. Cubic equation - Wikipedia

    en.wikipedia.org/wiki/Cubic_equation

    This formula can be straightforwardly transformed into a formula for the roots of a general cubic equation, using the back-substitution described in § Depressed cubic. The formula can be proved as follows: Starting from the equation t 3 + pt + q = 0, let us set t = u cos θ.

  5. Riccati equation - Wikipedia

    en.wikipedia.org/wiki/Riccati_equation

    The substitution that is needed to solve this Bernoulli equation is = Substituting = + directly into the Riccati equation yields the linear equation ′ + (+) = A set of solutions to the Riccati equation is then given by = + where z is the general solution to the aforementioned linear equation.

  6. Gaussian elimination - Wikipedia

    en.wikipedia.org/wiki/Gaussian_elimination

    From a computational point of view, it is faster to solve the variables in reverse order, a process known as back-substitution. One sees the solution is z = −1, y = 3, and x = 2. So there is a unique solution to the original system of equations.

  7. Euler method - Wikipedia

    en.wikipedia.org/wiki/Euler_method

    (Figure 2) Illustration of numerical integration for the equation ′ =, = Blue is the Euler method; green, the midpoint method; red, the exact solution, =. The step size is =

  8. Cauchy–Euler equation - Wikipedia

    en.wikipedia.org/wiki/Cauchy–Euler_equation

    Let y (n) (x) be the nth derivative of the unknown function y(x).Then a Cauchy–Euler equation of order n has the form () + () + + =. The substitution = (that is, = ⁡ (); for <, in which one might replace all instances of by | |, extending the solution's domain to {}) can be used to reduce this equation to a linear differential equation with constant coefficients.

  9. Annihilator method - Wikipedia

    en.wikipedia.org/wiki/Annihilator_method

    In mathematics, the annihilator method is a procedure used to find a particular solution to certain types of non-homogeneous ordinary differential equations (ODEs). [1] It is similar to the method of undetermined coefficients, but instead of guessing the particular solution in the method of undetermined coefficients, the particular solution is determined systematically in this technique.