QR factorization using the modified Gram-Schmidt algorithm.

::

 qr(DM A) -> (DM OUTPUT1, DM OUTPUT2)
 qr(SX A) -> (SX OUTPUT1, SX OUTPUT2)

More stable than the classical Gram-Schmidt, but may break down if the rows of A are nearly linearly dependent See J. Demmel: Applied Numerical Linear Algebra (algorithm 3.1.). Note that in SWIG, Q and R are returned by value.

Extra doc: https://github.com/casadi/casadi/wiki/L_18s

Doc source: https://github.com/casadi/casadi/blob/develop/casadi/core/matrix_decl.hpp#L530

Implementation: https://github.com/casadi/casadi/blob/develop/casadi/core/matrix_decl.hpp#L530-L532

To edit, see writing tips.