getrfnp#
Computes the LU factorization of a general m-by-n matrix without pivoting.
This routine belongs to the oneapi::mkl::lapack
namespace.
Description#
The routine computes the LU
factorization of a general
m
-by-n
matrix A
as
A = L*U,
where L
is lower triangular with unit diagonal elements (lower
trapezoidal if m > n
) and U
is upper triangular (upper
trapezoidal if m < n
). The routine does not use pivoting.
API#
Syntax#
namespace oneapi::mkl::lapack {
void getrfnp(sycl::queue &queue,
int64_t m,
int64_t n,
sycl::buffer<T> &a,
int64_t lda,
sycl::buffer<T> &scratchpad,
int64_t scratchpad_size)
}
getrfnp
supports the following precisions and devices.
T |
Devices supported |
---|---|
|
CPU and GPU* |
|
CPU and GPU* |
|
CPU and GPU* |
|
CPU and GPU* |
*Hybrid support; some computations are performed on the CPU.
Input Parameters#
queue |
Device queue where calculations will be performed. |
m |
The number of rows in the matrix |
n |
The number of columns in |
a |
Buffer holding input matrix |
lda |
The leading dimension of |
scratchpad |
Buffer holding scratchpad memory to be used by the routine for storing intermediate results. |
scratchpad_size |
Size of scratchpad memory as a number of floating point elements of type |
Output Parameters#
a |
Overwritten by |
Exceptions#
Exception |
Description |
---|---|
|
This exception is thrown when problems occur during calculations. You can obtain the info code of the problem using the info() method of the exception object: If If If |