When.com Web Search

  1. Ad

    related to: how to find zeros in math calculator with solution given two numbers x

Search results

  1. Results From The WOW.Com Content Network
  2. 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.

  3. Newton's method - Wikipedia

    en.wikipedia.org/wiki/Newton's_method

    Since cos(x) ≤ 1 for all x and x 3 > 1 for x > 1, we know that our solution lies between 0 and 1. A starting value of 0 will lead to an undefined result which illustrates the importance of using a starting point close to the solution. For example, with an initial guess x 0 = 0.5, the sequence given by Newton's method is:

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

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

  6. Secant method - Wikipedia

    en.wikipedia.org/wiki/Secant_method

    The secant method is an iterative numerical method for finding a zero of a function f.Given two initial values x 0 and x 1, the method proceeds according to the recurrence relation

  7. Rational root theorem - Wikipedia

    en.wikipedia.org/wiki/Rational_root_theorem

    Solutions of the equation are also called roots or zeros of the polynomial on the left side. The theorem states that each rational solution x = p ⁄ q, written in lowest terms so that p and q are relatively prime, satisfies: p is an integer factor of the constant term a 0, and; q is an integer factor of the leading coefficient a n.

  8. Quadratic equation - Wikipedia

    en.wikipedia.org/wiki/Quadratic_equation

    A quadratic equation has at most two solutions. If there is only one solution, one says that it is a double root. If all the coefficients are real numbers, there are either two real solutions, or a single real double root, or two complex solutions that are complex conjugates of each other. A quadratic equation always has two roots, if complex ...

  9. Polynomial root-finding - Wikipedia

    en.wikipedia.org/wiki/Polynomial_root-finding

    Finding roots in a specific region of the complex plane, typically the real roots or the real roots in a given interval (for example, when roots represents a physical quantity, only the real positive ones are interesting). For finding one root, Newton's method and other general iterative methods work generally well.