QRResult.solve

Solve the least squares problem: \min ||A * X - B|| Using the QR factorization: \A = Q * R computed by qrDecomp.

struct QRResult(T)

solve

(

Flag!"allowDestroy" allowDestroy = No.allowDestroy

Iterator

size_t N

SliceKind kind

)

(

Slice!(Iterator, N, kind) b

)

Meta

Source

See Implementation

kaleidic lubeck QRResult functions

variables