Polynomial computations are at the heart of computer algebra, and having a quick and reliable polynomials manipulation module is essential for developing a powerful symbolic manipulation system.
Polynomials
Polynomial expressions in the generators are expressions formed from a set of symbols or other appropriate objects, such as integers, by repeated addition, subtraction, and multiplication.
Multiplications can be done before adds and subtractions, with the help of the distributive law. Monomials are the products of generators produced in this way. They are generally written in the following format:
x1v1 x2v2 x3v3… xnvn
Nonnegative integers are used as exponents. It is frequently simpler to express this as xy,
where x = (x1 , x2 , . . . , xn) represents the generator family and
v= ( v1 , v2 , v3 , . . . , vn ) is the exponent’s family.
When all monomials with the same exponents are added together, the polynomial expression becomes a sum of products cvxv, known as the polynomial terms, with integer coefficients cv. If part of the numbers xi is evident, they are included in the coefficients and are not considered generators. Coefficients of this type are usually rational, real, or complex numbers. Pi, for example, may be used as both a coefficient and a generator.
The family of coefficients determines the uniqueness of a polynomial expression which is a sum of terms with various monomials. A polynomial is a common word for such an expression, albeit it actually refers to the coefficient family after the generators are known.
Symbolic numbers are generators unless specifically omitted, in which case they are adjoined to the coefficient ring.
Division
The fourth rational operation, division, or inverted multiplication, is not feasible in most rings. If a and b are two ring elements of a ring A, then there might be a third element q in A such that a = bq. In fact, there might be dozens of them. If there is a = bq’ for any q’ in A, then b(q-q’). As a result, either b or q-q’ is zero, or they are both zero divisors, or their product is zero.
Integral Domain
Integral domains are commutative rings with no zero divisors. Integral domains are integral domains, which include the ring of integers, fields, and polynomial rings over integral domains. Assume now that A is an integral domain and P that the set of its nonzero members is closed when multiplied. If a and b are in P and there is an element q in P such that a = bq , then q is unique and is referred to as the quotient, a / b , of a by b. Furthermore, it is said that
a is divisible by b
b is a factor of a
a is a multiplication of b
b is a proportional factor of a
Each element of P may be divided into units and associates. If an element has no other divisors and is not a unit, it is irreducible. The prime numbers p and their opposites that is ( -p ) are irreducible elements in the ring of integers. There are no irreducible elements in a field since every nonzero element is invertible.
Euclidean Domains
In Euclidean domains, an effective procedure for determining the greatest common divisor may be constructed. They are integral domains with the feature of being supplied with a function w that assigns a non-negative number to each nonzero element of the domain.
There exist q and r that meet the division identity if a and b are nonzero.
A = qb + r
As a result, either r = 0 or w(r) < w(b)
Euclidean domains are the ring of integers and all univariate polynomial rings over fields w(a) = |a|, respectively w(a) = deg(a).
Conclusion
Polynomials and the many operations that may be done on them can be represented using linked lists. Linked lists can be used to execute polynomial manipulations such as addition, subtraction, and differentiation. To combine two polynomials, we must first scan them. If the two polynomials include terms with the same exponent, we add the coefficients; otherwise, we copy the term with the greater exponent into the total and continue. When one of the polynomials reaches its finish, the remaining part of the other is duplicated into the total.