B is an m by nb real general matrix. X is an n by nb real general matrix. Optionally, the Euclidean Norms of the residual vectors can be computed. Following are the steps involved in finding the minimal norm linear least squares solution of AX is congruent to B . Q is an orthogonal matrix.
R is an upper triangular matrix.
If m or n is equal to 0, no computation is performed. These algorithms have a tendency to generate underflows that may hurt overall performance. The system default is to mask underflow, which improves the performance of these subroutines. Return code 1 is returned if error 2015 is recoverable. This example solves the underdetermined system AX is congruent to B .