gcd: GCD and LCM for Polynomials

In eestileib/ComplexPoly: A Collection of Functions to Implement a Class for Univariate Polynomial Manipulations

Description

Compute the greatest common divisor (GCD) and least common multiple (LCM) of a collection of polynomials and polylists.

Usage

## S3 method for class 'polylist'
GCD(...)
## S3 method for class 'polynomial'
GCD(...)
## S3 method for class 'polylist'
LCM(...)
## S3 method for class 'polynomial'
LCM(...)

Arguments

...	a list of objects of class polynomial or polylist.

Examples

pl <- polylist(poly.from.roots(-1),
               poly.from.roots(c(-1, -1)),
               poly.from.roots(1))
GCD(pl)
GCD(pl[-3])
LCM(pl)
LCM(pl, pl, pl[[2]])

eestileib/ComplexPoly documentation built on May 16, 2019, 12:13 a.m.