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
SliceKind kind
size_t[] n
Iterator
)
(
Slice!(kind, n, Iterator) b
)

Meta