When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Zero of a function - Wikipedia

    en.wikipedia.org/wiki/Zero_of_a_function

    In mathematics, a zero (also sometimes called a root) of a real -, complex -, or generally vector-valued function , is a member of the domain of such that vanishes at ; that is, the function attains the value of 0 at , or equivalently, is a solution to the equation . [1] A "zero" of a function is thus an input value that produces an output of 0.

  3. Root-finding algorithm - Wikipedia

    en.wikipedia.org/wiki/Root-finding_algorithm

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

  4. Newton's method - Wikipedia

    en.wikipedia.org/wiki/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. The most basic version starts with a real-valued function f, its derivative f ...

  5. Cubic function - Wikipedia

    en.wikipedia.org/wiki/Cubic_function

    Cubic function. Graph of a cubic function with 3 real roots (where the curve crosses the horizontal axis—where y = 0). The case shown has two critical points. Here the function is f(x) = (x3 + 3x2 − 6x − 8)/4. In mathematics, a cubic function is a function of the form that is, a polynomial function of degree three.

  6. Cubic equation - Wikipedia

    en.wikipedia.org/wiki/Cubic_equation

    Here the function is and therefore the three real roots are 2, −1 and −4. In algebra, a cubic equation in one variable is an equation of the form in which a is not zero. The solutions of this equation are called roots of the cubic function defined by the left-hand side of the equation. If all of the coefficients a, b, c, and d of the cubic ...

  7. Secant method - Wikipedia

    en.wikipedia.org/wiki/Secant_method

    In numerical analysis, the secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f. The secant method can be thought of as a finite-difference approximation of Newton's method, so it is considered a quasi-Newton method. Historically, it is as an evolution of the ...

  8. Quadratic function - Wikipedia

    en.wikipedia.org/wiki/Quadratic_function

    A quadratic polynomial with two real roots (crossings of the x axis). The graph of a real single-variable quadratic function is a parabola. 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

  9. Quadratic equation - Wikipedia

    en.wikipedia.org/wiki/Quadratic_equation

    The solutions of the quadratic equation ax 2 + bx + c = 0 correspond to the roots of the function f(x) = ax 2 + bx + c, since they are the values of x for which f(x) = 0. If a, b, and c are real numbers and the domain of f is the set of real numbers, then the roots of f are exactly the x-coordinates of the points where the graph touches the x-axis.