When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Quadratic formula - Wikipedia

    en.wikipedia.org/wiki/Quadratic_formula

    The roots of the quadratic function y = ⁠ 1 / 2 ⁠ x 2 − 3x + ⁠ 5 / 2 ⁠ are the places where the graph intersects the x-axis, the values x = 1 and x = 5. They can be found via the quadratic formula. In elementary algebra, the quadratic formula is a closed-form expression describing the solutions of a quadratic equation.

  3. Quadratic equation - Wikipedia

    en.wikipedia.org/wiki/Quadratic_equation

    A quadratic equation always has two roots, if complex roots are included and a double root is counted for two. A quadratic equation can be factored into an equivalent equation [ 3 ] a x 2 + b x + c = a ( x − r ) ( x − s ) = 0 {\displaystyle ax^{2}+bx+c=a(x-r)(x-s)=0} where r and s are the solutions for x .

  4. Polynomial root-finding - Wikipedia

    en.wikipedia.org/wiki/Polynomial_root-finding

    Finding the root of a linear polynomial (degree one) is easy and needs only one division: the general equation + = has solution = /. For quadratic polynomials (degree two), the quadratic formula produces a solution, but its numerical evaluation may require some care for ensuring numerical stability.

  5. Quadratic function - Wikipedia

    en.wikipedia.org/wiki/Quadratic_function

    If a quadratic function is equated with zero, then the result is a quadratic equation. The solutions of a quadratic equation are the zeros (or roots) of the corresponding quadratic function, of which there can be two, one, or zero. The solutions are described by the quadratic formula. A quadratic polynomial or quadratic function can involve ...

  6. Root-finding algorithm - Wikipedia

    en.wikipedia.org/wiki/Root-finding_algorithm

    In numerical analysis, a root-finding algorithm is an algorithm for finding zeros, also called "roots", of continuous functions. A zero of a function f is a number x such that f ( x ) = 0 . As, generally, the zeros of a function cannot be computed exactly nor expressed in closed form , root-finding algorithms provide approximations to zeros.

  7. Newton's method - Wikipedia

    en.wikipedia.org/wiki/Newton's_method

    Newton's method is a powerful technique—in general the convergence is quadratic: as the method converges on the root, the difference between the root and the approximation is squared (the number of accurate digits roughly doubles) at each step. However, there are some difficulties with the method.

  8. Vieta's formulas - Wikipedia

    en.wikipedia.org/wiki/Vieta's_formulas

    The roots , of the quadratic polynomial () = + + satisfy + =, =. The first of these equations can be used to find the minimum (or maximum) of P ; see Quadratic equation § Vieta's formulas .

  9. Completing the square - Wikipedia

    en.wikipedia.org/wiki/Completing_the_square

    It is also used for graphing quadratic functions, deriving the quadratic formula, and more generally in computations involving quadratic polynomials, for example in calculus evaluating Gaussian integrals with a linear term in the exponent, [2] and finding Laplace transforms. [3] [4]