| ||||||||||||||
| ||||||||||||||
Description | ||||||||||||||
The Elimination module defines elimination orders and the functions needed to perform elimination of variables. | ||||||||||||||
Synopsis | ||||||||||||||
| ||||||||||||||
Documentation | ||||||||||||||
newtype EliminationMonoid a b | ||||||||||||||
| ||||||||||||||
elim_fst :: EliminationMonoid a b -> a | ||||||||||||||
elim_snd :: EliminationMonoid a b -> b | ||||||||||||||
elim_map :: (a -> a -> a) -> (b -> b -> b) -> EliminationMonoid a b -> EliminationMonoid a b -> EliminationMonoid a b | ||||||||||||||
A helper function | ||||||||||||||
separate_pols :: (Num r, VarList v) => [v] -> Polynom r v -> MonoidRing r (EliminationMonoid (Monom v) (Monom v)) | ||||||||||||||
Convert to monomial order according to a list of variables | ||||||||||||||
eliminate :: (Fractional r, VarList v) => [v] -> Ideal (Polynom r v) -> GroebnerIdeal r (Monom v) | ||||||||||||||
Given a list of variables and an ideal, eliminate these variables. | ||||||||||||||
step_eliminate :: (Fractional r, VarList v) => [v] -> Ideal (Polynom r v) -> GroebnerIdeal r (Monom v) | ||||||||||||||
Eliminate variables one at a time | ||||||||||||||
Produced by Haddock version 2.3.0 |