Root of Polynomial Equation Calculator
Finding the roots of a polynomial equation is a fundamental problem in algebra. A root of a polynomial is a solution to the equation P(x) = 0. This calculator helps you find the roots of any polynomial equation by implementing numerical methods to approximate the solutions.
What is a Root of a Polynomial Equation?
A root of a polynomial equation is a value of x that makes the polynomial equal to zero. For example, in the equation x² - 5x + 6 = 0, the roots are x = 2 and x = 3 because substituting these values into the equation makes it true.
Polynomial equations can have real or complex roots. The number of roots (counting multiplicities) is equal to the degree of the polynomial. For example, a quadratic equation (degree 2) has two roots, a cubic equation (degree 3) has three roots, and so on.
How to Find Polynomial Roots
Finding the roots of a polynomial equation can be done using various methods, both analytical and numerical. Analytical methods include factoring, completing the square, and using the quadratic formula. Numerical methods are used when analytical methods are not feasible, such as for higher-degree polynomials or when exact solutions are difficult to find.
This calculator uses numerical methods to approximate the roots of polynomial equations. The methods used include the Newton-Raphson method, the bisection method, and the secant method, which are suitable for finding real roots of polynomials.
Methods for Finding Roots
Newton-Raphson Method
The Newton-Raphson method is an iterative numerical technique for finding successively better approximations to the roots of a real-valued function. The method starts with an initial guess for the root and iteratively improves the guess using the formula:
where f(x) is the polynomial, f'(x) is its derivative, and xn is the current approximation.
Bisection Method
The bisection method is a root-finding method that repeatedly bisects an interval and selects a subinterval in which a root must lie. The method is based on the Intermediate Value Theorem, which guarantees a root in any interval where the function changes sign.
Secant Method
The secant method is a root-finding algorithm that uses a series of roots of secant lines to better approximate a root of a function. The method is similar to the Newton-Raphson method but does not require the derivative of the function.
Worked Examples
Example 1: Quadratic Equation
Find the roots of the equation x² - 5x + 6 = 0.
Using the quadratic formula:
The roots are x = 2 and x = 3.
Example 2: Cubic Equation
Find the roots of the equation x³ - 6x² + 11x - 6 = 0.
Using the Rational Root Theorem, we can test possible rational roots. Testing x = 1 gives 1 - 6 + 11 - 6 = 0, so x = 1 is a root. Factoring out (x - 1), we get (x - 1)(x² - 5x + 6) = 0. The quadratic equation has roots x = 2 and x = 3.
The roots are x = 1, x = 2, and x = 3.