When.com Web Search

  1. Ad

    related to: how to find actual zeros of quadratic equation formula

Search results

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

    en.wikipedia.org/wiki/Quadratic_formula

    Given a general quadratic equation of the form ⁠ + + = ⁠, with ⁠ ⁠ representing an unknown, and coefficients ⁠ ⁠, ⁠ ⁠, and ⁠ ⁠ representing known real or complex numbers with ⁠ ⁠, the values of ⁠ ⁠ satisfying the equation, called the roots or zeros, can be found using the quadratic formula,

  3. Quadratic equation - Wikipedia

    en.wikipedia.org/wiki/Quadratic_equation

    Figure 1. Plots of quadratic function y = ax 2 + bx + c, varying each coefficient separately while the other coefficients are fixed (at values a = 1, b = 0, c = 0). A quadratic equation whose coefficients are real numbers can have either zero, one, or two distinct real-valued solutions, also called roots.

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

  5. Zero of a function - Wikipedia

    en.wikipedia.org/wiki/Zero_of_a_function

    It follows that the solutions of such an equation are exactly the zeros of the function . In other words, a "zero of a function" is precisely a "solution of the equation obtained by equating the function to 0", and the study of zeros of functions is exactly the same as the study of solutions of equations.

  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

    An illustration of Newton's method. In numerical analysis, the Newton–Raphson method, also known simply as Newton's method, named after Isaac Newton and Joseph Raphson, is a root-finding algorithm which produces successively better approximations to the roots (or zeroes) of a real-valued function.

  8. Quartic equation - Wikipedia

    en.wikipedia.org/wiki/Quartic_equation

    There exists a general formula for finding the roots to quartic equations, provided the coefficient of the leading term is non-zero. However, since the general method is quite complex and susceptible to errors in execution, it is better to apply one of the special cases listed below if possible.

  9. Quintic function - Wikipedia

    en.wikipedia.org/wiki/Quintic_function

    Finding the roots (zeros) of a given polynomial has been a prominent mathematical problem.. Solving linear, quadratic, cubic and quartic equations in terms of radicals and elementary arithmetic operations on the coefficients can always be done, no matter whether the roots are rational or irrational, real or complex; there are formulas that yield the required solutions.