HORIZON HASKELLDocslts/ghc-10.0.x8fef28d2026-11-02Search packagesCtrl K
Theme: |

GHC 10.0.0.20260917 · lts/ghc-10.0.x · 8fef28d · 2026-11-02

Modulenumeric-prelude-0.4.4Haskell98

MathObj.PowerSeries

Power series, either finite or unbounded. (zipWith does exactly the right thing to make it work almost transparently.)

Synopsis
Example7 expressions
import qualified MathObj.PowerSeries.Core as PSimport qualified MathObj.PowerSeries as PSTimport qualified Test.QuickCheck as QCimport Test.NumericPrelude.Utility (equalTrunc, (/\))import NumericPrelude.Numeric as NPimport NumericPrelude.Base as Pimport Prelude ()
newtypenewtype T a
#

Constructors

Instances14Functor, Eq, Ord, Show, C, …
  • Functor TDefined in numeric-prelude-0.4.4 · MathObj.PowerSeries
  • C TDefined in numeric-prelude-0.4.4 · MathObj.PowerSeries
  • (C a, C a b) => C a (T b)Defined in numeric-prelude-0.4.4 · MathObj.PowerSeries
  • C a b => C a (T b)Defined in numeric-prelude-0.4.4 · MathObj.PowerSeries
  • (Eq a, C a) => Eq (T a)Defined in numeric-prelude-0.4.4 · MathObj.PowerSeries
  • (C a, Ord a) => Ord (T a)Defined in numeric-prelude-0.4.4 · MathObj.PowerSeries
  • Show a => Show (T a)Defined in numeric-prelude-0.4.4 · MathObj.PowerSeries
  • C a => C (T a)Defined in numeric-prelude-0.4.4 · MathObj.PowerSeries
    Property
    QC.choose (1,10) /\ \expon (QC.Positive x) xs -> let xt = x:xs in  equalTrunc 15 (PS.pow (const x) (1 % expon) (PST.coeffs (PST.fromCoeffs xt ^ expon)) ++ repeat zero) (xt ++ repeat zero)
  • C a => C (T a)Defined in numeric-prelude-0.4.4 · MathObj.PowerSeries
  • C a => C (T a)Defined in numeric-prelude-0.4.4 · MathObj.PowerSeries
  • C a => C (T a)Defined in numeric-prelude-0.4.4 · MathObj.PowerSeries
  • C a => C (T a)Defined in numeric-prelude-0.4.4 · MathObj.PowerSeries
  • (C a, C a) => C (T a)Defined in numeric-prelude-0.4.4 · MathObj.PowerSeries
  • C a => C (T a)Defined in numeric-prelude-0.4.4 · MathObj.PowerSeries
valuelift1 :: ([a] -> [a]) -> T a -> T a
#
valuelift2 :: ([a] -> [a] -> [a]) -> T a -> T a -> T a
#
valueapproximate :: C a => T a -> a -> [a]

Evaluate approximations that is evaluate all truncations of the series.

valuecompose :: (C a, C a) => T a -> T a -> T a

It fulfills evaluate x . evaluate y == evaluate (compose x y)