When.com Web Search

Search results

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

    en.wikipedia.org/wiki/Homotopy_analysis_method

    The homotopy analysis method (HAM) is a semi-analytical technique to solve nonlinear ordinary / partial differential equations. The homotopy analysis method employs the concept of the homotopy from topology to generate a convergent series solution for nonlinear systems. This is enabled by utilizing a homotopy- Maclaurin series to deal with the ...

  3. Gauss–Seidel method - Wikipedia

    en.wikipedia.org/wiki/Gauss–Seidel_method

    Gauss–Seidel method. In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a system of linear equations. It is named after the German mathematicians Carl Friedrich Gauss and Philipp Ludwig von Seidel.

  4. Crank–Nicolson method - Wikipedia

    en.wikipedia.org/wiki/Crank–Nicolson_method

    The Crank–Nicolson stencil for a 1D problem. The Crank–Nicolson method is based on the trapezoidal rule, giving second-order convergence in time.For linear equations, the trapezoidal rule is equivalent to the implicit midpoint method [citation needed] —the simplest example of a Gauss–Legendre implicit Runge–Kutta method—which also has the property of being a geometric integrator.

  5. List of finite element software packages - Wikipedia

    en.wikipedia.org/wiki/List_of_finite_element...

    List of finite element software packages. This is a list of notable software packages that implement the finite element method for solving partial differential equations. FEA, Multi-physics, Implict & Explict. It is an Open Source FEA project. The solver uses a partially compatible ABAQUS file format.

  6. Gaussian elimination - Wikipedia

    en.wikipedia.org/wiki/Gaussian_elimination

    In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of row-wise operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square matrix, and the inverse of ...

  7. Explicit and implicit methods - Wikipedia

    en.wikipedia.org/wiki/Explicit_and_implicit_methods

    Explicit and implicit methods are approaches used in numerical analysis for obtaining numerical approximations to the solutions of time-dependent ordinary and partial differential equations, as is required in computer simulations of physical processes. Explicit methods calculate the state of a system at a later time from the state of the system ...

  8. Numerical solution of the convection–diffusion equation

    en.wikipedia.org/wiki/Numerical_solution_of_the...

    Unlike the conduction equation (a finite element solution is used), a numerical solution for the convection–diffusion equation has to deal with the convection part of the governing equation in addition to diffusion. When the Péclet number (Pe) exceeds a critical value, the spurious oscillations result in space and this problem is not unique ...

  9. Solutions of the Einstein field equations - Wikipedia

    en.wikipedia.org/wiki/Solutions_of_the_Einstein...

    This equation will often depend on temperature, so a heat transfer equation is required or the postulate that heat transfer can be neglected. Next, notice that only 10 of the original 14 equations are independent, because the continuity equation T a b ; b = 0 {\displaystyle T^{ab}{}_{;b}=0} is a consequence of Einstein's equations.