QR Decomposition without Pivoting
Given the matrix 
, the problem is to compute the QR decomposition
, where
X
of size , the problem is to compute the QR decomposition
, where- Qis an orthogonal matrix of size
- Ris a rectangular upper triangular matrix of size
The library requires 
. In this case:
. In this case:
where the matrix 
has the size 
and 
has the size 
.
has the size and has the size .Computation
The following computation modes are available:
Examples
C++ (CPU)
Batch Processing:
Online Processing:
Distributed Processing:
Java*
There is no support for Java on GPU.
Batch Processing:
Online Processing:
Distributed Processing:
Python*
Batch Processing:
Online Processing:
Distributed Processing: