dsp-0.2.4.1: Haskell Digital Signal Processing

Safe Haskell Safe Haskell98

Matrix.QR.Householder

Synopsis

# Documentation

leastSquares :: (Ix i, Enum i, Ix j, Enum j, RealFloat a) => Array (i, j) a -> Array i a -> Array j a Source #

Solve an overconstrained linear problem, i.e. minimize ||Ax-b||. A must have dimensions m x n with m>=n and it must have full-rank. None of these conditions is checked.

Arguments

 :: (Ix i, Enum i, Ix j, Enum j, RealFloat a) => Array (i, j) a A -> ([Reflection i a], Upper i j a) QR(A)

solve :: (Ix i, Ix j, Fractional a) => ([Reflection i a], Upper i j a) -> Array i a -> Array j a Source #

det :: (Ix i, Enum i, Ix j, Enum j, RealFloat a) => Array (i, j) a -> a Source #

reflectMatrix :: (Ix i, Ix j, Num a) => Reflection i a -> Array (i, j) a -> Array (i, j) a Source #

reflectVector :: (Ix i, Num a) => Reflection i a -> Array i a -> Array i a Source #

data Upper i j a Source #

matrixFromUpper :: (Ix i, Ix j, Num a) => Upper i j a -> Array (i, j) a Source #

solveUpper :: (Ix i, Ix j, Fractional a) => Upper i j a -> Array i a -> Array j a Source #

Assumes that Upper matrix is at least as high as wide and that it has full rank.

detUpper :: (Ix i, Ix j, Fractional a) => Upper i j a -> a Source #