MCPcopy Create free account
hub / github.com/andeya/algorithm / SolveQRT

Function SolveQRT

matops/qrwym.go:777–809  ·  view source on GitHub ↗

* * Solve a system of linear equations A*X = B with general M-by-N * matrix A using the QR factorization computed by DecomposeQRT(). * * If flags&TRANS != 0: * find the minimum norm solution of an overdetermined system A.T * X = B. * i.e min ||X|| s.t A.T*X = B * * Otherwise: * find t

(B, A, T, W *matrix.FloatMatrix, flags Flags, nb int)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 2

TestSolveLeastSquaresQRTFunction · 0.85
TestSolveMinQRTFunction · 0.85

Calls 5

SetIndexesMethod · 0.95
SolveTrmFunction · 0.85
MultQTFunction · 0.85
ColsMethod · 0.65
SubMatrixMethod · 0.45

Tested by 2

TestSolveLeastSquaresQRTFunction · 0.68
TestSolveMinQRTFunction · 0.68