Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Polynomial Root Finding

Description

This lecture covers the process of finding roots of polynomials using methods like Horner's method and Ruffini-Horner method, by evaluating potential roots based on the divisors of the constant term. The instructor demonstrates the application of these methods through examples and explains how to identify factors of the polynomial based on the roots found.

Official source

Ontological neighbourhood

Mathematics

Algebra: Polynomials

Related concepts (19)

Horner's method

In mathematics and computer science, Horner's method (or Horner's scheme) is an algorithm for polynomial evaluation. Although named after William George Horner, this method is much older, as it has been attributed to Joseph-Louis Lagrange by Horner himself, and can be traced back many hundreds of years to Chinese and Persian mathematicians. After the introduction of computers, this algorithm became fundamental for computing efficiently with polynomials.

Polynomial

In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example of a polynomial of a single indeterminate x is x2 − 4x + 7. An example with three indeterminates is x3 + 2xyz2 − yz + 1. Polynomials appear in many areas of mathematics and science.

Factorization of polynomials

In mathematics and computer algebra, factorization of polynomials or polynomial factorization expresses a polynomial with coefficients in a given field or in the integers as the product of irreducible factors with coefficients in the same domain. Polynomial factorization is one of the fundamental components of computer algebra systems. The first polynomial factorization algorithm was published by Theodor von Schubert in 1793. Leopold Kronecker rediscovered Schubert's algorithm in 1882 and extended it to multivariate polynomials and coefficients in an algebraic extension.

Polynomial long division

In algebra, polynomial long division is an algorithm for dividing a polynomial by another polynomial of the same or lower degree, a generalized version of the familiar arithmetic technique called long division. It can be done easily by hand, because it separates an otherwise complex division problem into smaller ones. Sometimes using a shorthand version called synthetic division is faster, with less writing and fewer calculations. Another abbreviated method is polynomial short division (Blomqvist's method).

Irreducible polynomial

In mathematics, an irreducible polynomial is, roughly speaking, a polynomial that cannot be factored into the product of two non-constant polynomials. The property of irreducibility depends on the nature of the coefficients that are accepted for the possible factors, that is, the field to which the coefficients of the polynomial and its possible factors are supposed to belong. For example, the polynomial x2 − 2 is a polynomial with integer coefficients, but, as every integer is also a real number, it is also a polynomial with real coefficients.

Related lectures (32)

Polynomial Factorization and Decomposition

Covers polynomial factorization, irreducible polynomials, ideal decomposition, and the theorem of Bézout.

Division Polynomials: Theorems and Applications

Explores division polynomials, theorems, spectral values, and minimal polynomials in endomorphisms and vector spaces.

Polynomial Methods: GCD Calculation Summary

Covers the calculation of the greatest common divisor using polynomial methods and the Euclidean algorithm.

Minimal Polynomials: Uniqueness and Division

Explores the uniqueness of minimal polynomials and the division algorithm for polynomials.

Polynomial Factorization over Finite Fields