Package dk.jonaslindstrom.ruffini.polynomials.algorithms

Class BatchPolynomialEvaluation<E>

java.lang.Object

dk.jonaslindstrom.ruffini.polynomials.algorithms.BatchPolynomialEvaluation<E>

All Implemented Interfaces:

java.util.function.Function<Polynomial<E>,List<E>>

public class BatchPolynomialEvaluation<E>
extends Object
implements java.util.function.Function<Polynomial<E>,List<E>>

Batch polynomial evaluation using the Moenck–Borodin algorithm. The algorithm was originally presented in "Evaluating polynomials at many points" by A. Borodin and I. Munro (1971),

The complexity is O(M(d) + M(n) log(n)) where d is the degree of the polynomial, n is the number of inputs and M(x) is the complexity of multiplying two polynomials of degree x.

Constructor Summary

Constructors

Constructor	Description
BatchPolynomialEvaluation(PolynomialRingOverRing<E> polynomialRing, List<E> inputs)

Method Summary

Modifier and Type	Method	Description
List<E>	apply(Polynomial<E> polynomial)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.util.function.Function

andThen, compose

Constructor Details

BatchPolynomialEvaluation

public BatchPolynomialEvaluation(PolynomialRingOverRing<E> polynomialRing,
 List<E> inputs)

Method Details

apply

public List<E> apply(Polynomial<E> polynomial)

Specified by:

apply in interface java.util.function.Function<Polynomial<E>,List<E>>