When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Frobenius method - Wikipedia

    en.wikipedia.org/wiki/Frobenius_method

    Example: consider the following differential equation (Kummer's equation with a = 1 and b = 2): ″ + ′ = The roots of the indicial equation are −1 and 0. Two independent solutions are 1 / z {\displaystyle 1/z} and e z / z , {\displaystyle e^{z}/z,} so we see that the logarithm does not appear in any solution.

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

  4. Method of lines - Wikipedia

    en.wikipedia.org/wiki/Method_of_lines

    Method of lines - the example, which shows the origin of the name of method. The method of lines (MOL, NMOL, NUMOL [1] [2] [3]) is a technique for solving partial differential equations (PDEs) in which all but one dimension is discretized.

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

  6. Numerical methods for ordinary differential equations

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

    Solving Ordinary Differential Equations. I. Nonstiff Problems. Springer Series in Computational Mathematics. Vol. 8 (2nd ed.). Springer-Verlag, Berlin. ISBN 3-540-56670-8. MR 1227985. Ernst Hairer and Gerhard Wanner, Solving ordinary differential equations II: Stiff and differential-algebraic problems, second edition, Springer Verlag, Berlin, 1996.

  7. Explicit and implicit methods - Wikipedia

    en.wikipedia.org/wiki/Explicit_and_implicit_methods

    In the vast majority of cases, the equation to be solved when using an implicit scheme is much more complicated than a quadratic equation, and no analytical solution exists. Then one uses root-finding algorithms, such as Newton's method, to find the numerical solution. Crank-Nicolson method. With the Crank-Nicolson method

  8. Spectral method - Wikipedia

    en.wikipedia.org/wiki/Spectral_method

    Spectral methods can be used to solve differential equations (PDEs, ODEs, eigenvalue, etc) and optimization problems. When applying spectral methods to time-dependent PDEs, the solution is typically written as a sum of basis functions with time-dependent coefficients; substituting this in the PDE yields a system of ODEs in the coefficients ...

  9. Linear multistep method - Wikipedia

    en.wikipedia.org/wiki/Linear_multistep_method

    Linear multistep methods are used for the numerical solution of ordinary differential equations. Conceptually, a numerical method starts from an initial point and then takes a short step forward in time to find the next solution point. The process continues with subsequent steps to map out the solution.