Package dk.jonaslindstrom.ruffini.polynomials.algorithms

Class Inversion<E>

java.lang.Object

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

All Implemented Interfaces:

java.util.function.BiFunction<Polynomial<E>,Integer,Polynomial<E>>

public class Inversion<E>
extends Object
implements java.util.function.BiFunction<Polynomial<E>,Integer,Polynomial<E>>

Assuming f(0) = 1, this computes g such that fg = 1 (mod x^l). This is based on Algorithm 9.3 in Modern Computer Algebra.

Constructor Summary

Constructors

Constructor	Description
Inversion(Ring<E> ring)

Method Summary

Modifier and Type	Method	Description
Polynomial<E>	apply(Polynomial<E> f, Integer l)

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.BiFunction

andThen

Constructor Details

Inversion

public Inversion(Ring<E> ring)

Method Details

apply

public Polynomial<E> apply(Polynomial<E> f,
 Integer l)

Specified by:

apply in interface java.util.function.BiFunction<Polynomial<E>,Integer,Polynomial<E>>