Concept

Synthetic division

In algebra, synthetic division is a method for manually performing Euclidean division of polynomials, with less writing and fewer calculations than long division. It is mostly taught for division by linear monic polynomials (known as Ruffini's rule), but the method can be generalized to division by any polynomial. The advantages of synthetic division are that it allows one to calculate without writing variables, it uses few calculations, and it takes significantly less space on paper than long division. Also, the subtractions in long division are converted to additions by switching the signs at the very beginning, helping to prevent sign errors. The first example is synthetic division with only a monic linear denominator . The numerator can be written as . The zero of the denominator is . The coefficients of are arranged as follows, with the zero of on the left: The after the bar is "dropped" to the last row. The is multiplied by the before the bar, and placed in the . An is performed in the next column. The previous two steps are repeated and the following is obtained: Here, the last term (-123) is the remainder while the rest correspond to the coefficients of the quotient. The terms are written with increasing degree from right to left beginning with degree zero for the remainder and the result. Hence the quotient and remainder are: The above form of synthetic division is useful in the context of the polynomial remainder theorem for evaluating univariate polynomials. To summarize, the value of at is equal to the remainder of the division of by The advantage of calculating the value this way is that it requires just over half as many multiplication steps as naive evaluation. An alternative evaluation strategy is Horner's method. This method generalizes to division by any monic polynomial with only a slight modification with changes in bold. Using the same steps as before, perform the following division: We concern ourselves only with the coefficients. Write the coefficients of the polynomial to be divided at the top.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related courses (2)
MATH-115(b): Advanced linear algebra II
L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire et de démontrer rigoureusement les résultats principaux du sujet.
MATH-310: Algebra
This is an introduction to modern algebra: groups, rings and fields.
Related lectures (19)
Eigenvalues and Minimal Polynomial
Explores eigenvalues and minimal polynomial, emphasizing their importance in linear algebra.
Rudiments of Number Theory
Introduces modulo arithmetic, Euclid's algorithm, and congruence in number theory.
Algebra: Integer Numbers and Principles
Introduces integer numbers, well-ordering, induction principles, GCD, LCM, and Bezout's theorem.
Show more
Related publications (1)

On A Perturbation Bound For Invariant Subspaces Of Matrices

Daniel Kressner

Given a nonsymmetric matrix A, we investigate the effect of perturbations on an invariant subspace of A. The result derived in this paper differs from Stewart's classical result and sometimes yields tighter bounds. Moreover, we provide norm estimates for t ...
Siam Publications2014
Related concepts (6)
Ruffini's rule
In mathematics, Ruffini's rule is a method for computation of the Euclidean division of a polynomial by a binomial of the form x – r. It was described by Paolo Ruffini in 1804. The rule is a special case of synthetic division in which the divisor is a linear factor. The rule establishes a method for dividing the polynomial: by the binomial: to obtain the quotient polynomial: The algorithm is in fact the long division of P(x) by Q(x). To divide P(x) by Q(x): Take the coefficients of P(x) and write them down in order.
Polynomial remainder theorem
In algebra, the polynomial remainder theorem or little Bézout's theorem (named after Étienne Bézout) is an application of Euclidean division of polynomials. It states that, for every number any polynomial is the sum of and the product by of a polynomial in of degree less than the degree of In particular, is the remainder of the Euclidean division of by and is a divisor of if and only if a property known as the factor theorem. Let . Polynomial division of by gives the quotient and the remainder . Therefore, .
Polynomial greatest common divisor
In algebra, the greatest common divisor (frequently abbreviated as GCD) of two polynomials is a polynomial, of the highest possible degree, that is a factor of both the two original polynomials. This concept is analogous to the greatest common divisor of two integers. In the important case of univariate polynomials over a field the polynomial GCD may be computed, like for the integer GCD, by the Euclidean algorithm using long division. The polynomial GCD is defined only up to the multiplication by an invertible constant.
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.