coincident-root-loci-0.2: Equivariant CSM classes of coincident root loci

Safe HaskellNone
LanguageHaskell2010

Math.RootLoci.Algebra.Polynomial

Contents

Description

Univariate polynomials

Synopsis

Polynomials

newtype Poly coeff Source #

Standard univariate polynomials

Constructors

Poly 

Fields

Instances

Eq coeff => Eq (Poly coeff) Source # 

Methods

(==) :: Poly coeff -> Poly coeff -> Bool #

(/=) :: Poly coeff -> Poly coeff -> Bool #

(Num coeff, Eq coeff) => Num (Poly coeff) Source # 

Methods

(+) :: Poly coeff -> Poly coeff -> Poly coeff #

(-) :: Poly coeff -> Poly coeff -> Poly coeff #

(*) :: Poly coeff -> Poly coeff -> Poly coeff #

negate :: Poly coeff -> Poly coeff #

abs :: Poly coeff -> Poly coeff #

signum :: Poly coeff -> Poly coeff #

fromInteger :: Integer -> Poly coeff #

Show coeff => Show (Poly coeff) Source # 

Methods

showsPrec :: Int -> Poly coeff -> ShowS #

show :: Poly coeff -> String #

showList :: [Poly coeff] -> ShowS #

(Num c, Show c, Eq c, IsSigned c) => Pretty (Poly c) Source # 

Methods

pretty :: Poly c -> String Source #

newtype RisingPoly coeff Source #

Univariate polynomials using rising factorials as a basis function

Constructors

RisingPoly 

Fields

Instances

Eq coeff => Eq (RisingPoly coeff) Source # 

Methods

(==) :: RisingPoly coeff -> RisingPoly coeff -> Bool #

(/=) :: RisingPoly coeff -> RisingPoly coeff -> Bool #

Show coeff => Show (RisingPoly coeff) Source # 

Methods

showsPrec :: Int -> RisingPoly coeff -> ShowS #

show :: RisingPoly coeff -> String #

showList :: [RisingPoly coeff] -> ShowS #

(Num c, Show c, Eq c, IsSigned c) => Pretty (RisingPoly c) Source # 

newtype FallingPoly coeff Source #

Univariate polynomials using falling factorials as a basis function

Constructors

FallingPoly 

Instances

Eq coeff => Eq (FallingPoly coeff) Source # 

Methods

(==) :: FallingPoly coeff -> FallingPoly coeff -> Bool #

(/=) :: FallingPoly coeff -> FallingPoly coeff -> Bool #

Show coeff => Show (FallingPoly coeff) Source # 

Methods

showsPrec :: Int -> FallingPoly coeff -> ShowS #

show :: FallingPoly coeff -> String #

showList :: [FallingPoly coeff] -> ShowS #

(Num c, Show c, Eq c, IsSigned c) => Pretty (FallingPoly c) Source # 

Monomials

newtype X Source #

A power of x (that is, a monomial of the form x^i)

Constructors

X Int 

Instances

Eq X Source # 

Methods

(==) :: X -> X -> Bool #

(/=) :: X -> X -> Bool #

Ord X Source # 

Methods

compare :: X -> X -> Ordering #

(<) :: X -> X -> Bool #

(<=) :: X -> X -> Bool #

(>) :: X -> X -> Bool #

(>=) :: X -> X -> Bool #

max :: X -> X -> X #

min :: X -> X -> X #

Show X Source # 

Methods

showsPrec :: Int -> X -> ShowS #

show :: X -> String #

showList :: [X] -> ShowS #

Monoid X Source # 

Methods

mempty :: X #

mappend :: X -> X -> X #

mconcat :: [X] -> X #

Pretty X Source # 

Methods

pretty :: X -> String Source #

Rising and falling factorials

newtype RisingF Source #

Rising factorial x^(k) = x(x+1)(x+2)...(x+k-1)

Constructors

RF Int 

newtype FallingF Source #

Falling factorial x_(k) = x(x-1)(x-2)...(x-k+1)

Constructors

FF Int 

Lagrange interpolation