Numeric.LAPACK.Matrix.Hermitian

Documentation

type Hermitian sh = Array (Hermitian sh)

data Transposition

Constructors

NonTransposed

Transposed

Instances

Bounded Transposition

Defined in Numeric.LAPACK.Matrix.Private

Methods

minBound :: Transposition

maxBound :: Transposition

Enum Transposition

Defined in Numeric.LAPACK.Matrix.Private

Methods

succ :: Transposition -> Transposition

pred :: Transposition -> Transposition

toEnum :: Int -> Transposition

fromEnum :: Transposition -> Int

enumFrom :: Transposition -> [Transposition]

enumFromThen :: Transposition -> Transposition -> [Transposition]

enumFromTo :: Transposition -> Transposition -> [Transposition]

enumFromThenTo :: Transposition -> Transposition -> Transposition -> [Transposition]

Eq Transposition

Defined in Numeric.LAPACK.Matrix.Private

Methods

(==) :: Transposition -> Transposition -> Bool

(/=) :: Transposition -> Transposition -> Bool

Show Transposition

Defined in Numeric.LAPACK.Matrix.Private

Methods

showsPrec :: Int -> Transposition -> ShowS

show :: Transposition -> String

showList :: [Transposition] -> ShowS

fromList :: (C sh, Storable a) => Order -> sh -> [a] -> Hermitian sh a

autoFromList :: Storable a => Order -> [a] -> Hermitian ZeroInt a

identity :: (C sh, Floating a) => Order -> sh -> Hermitian sh a

diagonal :: (C sh, Floating a) => Order -> Vector sh (RealOf a) -> Hermitian sh a

takeDiagonal :: (C sh, Floating a) => Hermitian sh a -> Vector sh (RealOf a)

forceOrder :: (C sh, Floating a) => Order -> Hermitian sh a -> Hermitian sh a

stack :: (C sh0, Eq sh0, C sh1, Eq sh1, Floating a) => Hermitian sh0 a -> General sh0 sh1 a -> Hermitian sh1 a -> Hermitian (sh0 :+: sh1) a

toSquare (stack a b c)

=

toSquare a ||| b
===
adjoint b ||| toSquare c

It holds order (stack a b c) = order b. The function is most efficient when the order of all blocks match.

multiplyVector :: (C sh, Eq sh, Floating a) => Transposition -> Hermitian sh a -> Vector sh a -> Vector sh a

square :: (C sh, Eq sh, Floating a) => Hermitian sh a -> Hermitian sh a

multiplyFull :: (C vert, C horiz, C height, Eq height, C width, Floating a) => Transposition -> Hermitian height a -> Full vert horiz height width a -> Full vert horiz height width a

outer :: (C sh, Floating a) => Order -> Vector sh a -> Hermitian sh a

sumRank1 :: (C sh, Eq sh, Floating a) => Order -> sh -> [(RealOf a, Vector sh a)] -> Hermitian sh a

sumRank1NonEmpty :: (C sh, Eq sh, Floating a) => Order -> T [] (RealOf a, Vector sh a) -> Hermitian sh a

sumRank2 :: (C sh, Eq sh, Floating a) => Order -> sh -> [(a, (Vector sh a, Vector sh a))] -> Hermitian sh a

sumRank2NonEmpty :: (C sh, Eq sh, Floating a) => Order -> T [] (a, (Vector sh a, Vector sh a)) -> Hermitian sh a

toSquare :: (C sh, Floating a) => Hermitian sh a -> Square sh a

covariance :: (C height, C width, Eq width, Floating a) => General height width a -> Hermitian width a

A^H * A

addAdjoint :: (C sh, Floating a) => Square sh a -> Hermitian sh a

A^H + A

solve :: (C vert, C horiz, C sh, Eq sh, C nrhs, Floating a) => Hermitian sh a -> Full vert horiz sh nrhs a -> Full vert horiz sh nrhs a

inverse :: (C sh, Floating a) => Hermitian sh a -> Hermitian sh a

determinant :: (C sh, Floating a) => Hermitian sh a -> RealOf a

eigenvalues :: (C sh, Floating a) => Hermitian sh a -> Vector sh (RealOf a)

eigensystem :: (C sh, Floating a) => Hermitian sh a -> (Square sh a, Vector sh (RealOf a))

For symmetric eigenvalue problems, eigensystem and schur coincide.