enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Equation solving - Wikipedia

    en.wikipedia.org/wiki/Equation_solving

    An example of using Newton–Raphson method to solve numerically the equation f(x) = 0. In mathematics, to solve an equation is to find its solutions, which are the values (numbers, functions, sets, etc.) that fulfill the condition stated by the equation, consisting generally of two expressions related by an equals sign.

  3. Method of matched asymptotic expansions - Wikipedia

    en.wikipedia.org/wiki/Method_of_matched...

    In mathematics, the method of matched asymptotic expansions [1] is a common approach to finding an accurate approximation to the solution to an equation, or system of equations. It is particularly used when solving singularly perturbed differential equations. It involves finding several different approximate solutions, each of which is valid (i ...

  4. Cramer's rule - Wikipedia

    en.wikipedia.org/wiki/Cramer's_rule

    In linear algebra, Cramer's rule is an explicit formula for the solution of a system of linear equations with as many equations as unknowns, valid whenever the system has a unique solution. It expresses the solution in terms of the determinants of the (square) coefficient matrix and of matrices obtained from it by replacing one column by the ...

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

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

  7. Quadratically constrained quadratic program - Wikipedia

    en.wikipedia.org/wiki/Quadratically_constrained...

    A commercial optimization solver for linear programming, non-linear programming, mixed integer linear programming, convex quadratic programming, convex quadratically constrained quadratic programming, second-order cone programming and their mixed integer counterparts. AMPL: CPLEX: Popular solver with an API for several programming languages.

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

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