enow.com Web Search

Search results

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

    en.wikipedia.org/wiki/Equation_solving

    Equation solving. The quadratic formula, the symbolic solution of the quadratic equation ax2 + bx + c = 0. 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 ...

  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. Three-body problem - Wikipedia

    en.wikipedia.org/wiki/Three-body_problem

    In physics, specifically classical mechanics, the three-body problem involves taking the initial positions and velocities (or momenta) of three point masses that orbit each other in space and calculating their subsequent trajectories using Newton's laws of motion and Newton's law of universal gravitation. [1]

  5. How to Solve It - Wikipedia

    en.wikipedia.org/wiki/How_to_Solve_It

    Genre. Mathematics, problem solving. Publication date. 1945. ISBN. 9780691164076. How to Solve It (1945) is a small volume by mathematician George Pólya, describing methods of problem solving. [1] This book has remained in print continually since 1945.

  6. Mathematical optimization - Wikipedia

    en.wikipedia.org/wiki/Mathematical_optimization

    Mathematical optimization (alternatively spelled optimisation) or mathematical programming is the selection of a best element, with regard to some criteria, from some set of available alternatives. [1][2] It is generally divided into two subfields: discrete optimization and continuous optimization.

  7. Separation of variables - Wikipedia

    en.wikipedia.org/wiki/Separation_of_variables

    t. e. In mathematics, separation of variables (also known as the Fourier method) is any of several methods for solving ordinary and partial differential equations, in which algebra allows one to rewrite an equation so that each of two variables occurs on a different side of the equation.

  8. Euler method - Wikipedia

    en.wikipedia.org/wiki/Euler_method

    It is the most basic explicit method for numerical integration of ordinary differential equations and is the simplest Runge–Kutta method. The Euler method is named after Leonhard Euler, who first proposed it in his book Institutionum calculi integralis (published 1768–1770). [1]

  9. Initial value problem - Wikipedia

    en.wikipedia.org/wiki/Initial_value_problem

    Initial value problem. In multivariable calculus, an initial value problem[a] (IVP) is an ordinary differential equation together with an initial condition which specifies the value of the unknown function at a given point in the domain. Modeling a system in physics or other sciences frequently amounts to solving an initial value problem.