Copyright	(c) Henning Thielemann 2009 Mikael Johansson 2006
Maintainer	numericprelude@henning-thielemann.de
Stability	provisional
Portability	requires multi-parameter type classes
Safe Haskell	None
Language	Haskell98

MathObj.Matrix

Description

Routines and abstractions for Matrices and basic linear algebra over fields or rings.

We stick to simple Int indices. Although advanced indices would be nice e.g. for matrices with sub-matrices, this is not easily implemented since arrays do only support a lower and an upper bound but no additional parameters.

ToDo: - Matrix inverse, determinant (see htam:Matrix)

Synopsis

Documentation

data T a Source #

A matrix is a twodimensional array, indexed by integers.

Instances

Functor T Source #
Methods fmap :: (a -> b) -> T a -> T b # (<$) :: a -> T b -> T a #
C T Source #
Methods zero :: C a => T a Source # (<+>) :: C a => T a -> T a -> T a Source # (*>) :: C a => a -> T a -> T a Source #
C a b => C a (T b) Source #
Methods (*>) :: a -> T b -> T b Source #
Eq a => Eq (T a) Source #
Methods (==) :: T a -> T a -> Bool # (/=) :: T a -> T a -> Bool #
Ord a => Ord (T a) Source #
Methods compare :: T a -> T a -> Ordering # (<) :: T a -> T a -> Bool # (<=) :: T a -> T a -> Bool # (>) :: T a -> T a -> Bool # (>=) :: T a -> T a -> Bool # max :: T a -> T a -> T a # min :: T a -> T a -> T a #
Read a => Read (T a) Source #
Methods readsPrec :: Int -> ReadS (T a) # readList :: ReadS [T a] # readPrec :: ReadPrec (T a) # readListPrec :: ReadPrec [T a] #
Show a => Show (T a) Source #
Methods showsPrec :: Int -> T a -> ShowS # show :: T a -> String # showList :: [T a] -> ShowS #
C a => C (T a) Source #
Methods zero :: T a Source # (+) :: T a -> T a -> T a Source # (-) :: T a -> T a -> T a Source # negate :: T a -> T a Source #
C a => C (T a) Source #
Methods (*) :: T a -> T a -> T a Source # one :: T a Source # fromInteger :: Integer -> T a Source # (^) :: T a -> Integer -> T a Source #