Computer algebra

mathematical function built from basic functions and elementary operations

algorithm for polynomial evaluation

dividing polynomials similar to long division for regular numbers

branch of mathematics and computer science that deals with the symbolic manipulation of algebraic expressions

In mathematics, the resultant of two polynomials is a polynomial expression of their coefficients that is equal to zero if and only if the polynomials have a common root (possibly in a field extension), or, equivalently, a common factor (over their field of coefficients). In some older texts, the resultant is also called the eliminant.

particular generating subset of an ideal in a polynomial ring

computational method

algorithm used to compute integrals of functions, especially used in computer algebra systems

set of computer programming techniques to speedily compute derivatives

Count of the roots of a polynomial in an interval, without computing them

in mathematics, computation of antiderivatives

polynomial factorisation algorithm

algorithm for Euclidean division of polynomials

part of algebraic geometry devoted to the elimination of variables between polynomials

Polynomial with no repeated root

greatest common divisor of polynomials

Algorithm for calculating determinants

algorithm for factoring polynomials over finite fields

root-finding algorithms for common roots of several multivariate polynomials

type of regression analysis

algorithm

algorithm for computing the discrete logarithm