getrfnp_batch (USM Strided Version)¶
Computes the batch of LU factorizations of a batch of general m-by-n matrices.
This routine belongs to the oneapi::mkl::lapack
namespace.
Description¶
The routine computes the LU factorizations of a batch of general
m
-by-n
matrices A
i, as
Where L
i is lower triangular with unit diagonal elements
(lower trapezoidal if m > n
) and U
i is upper triangular
(upper trapezoidal if m < n
). The routine does not perform any
pivoting.
API¶
Syntax¶
namespace oneapi::mkl::lapack {
sycl::event getrfnp_batch(sycl::queue &queue,
std::int64_t m,
std::int64_t n,
T *a,
std::int64_t lda,
std::int64_t stride_a,
std::int64_t batch_size,
T *scratchpad,
std::int64_t scratchpad_size,
const std::vector<sycl::event> &events = {})
}
This function supports the following precisions and devices:
T |
Devices supported |
---|---|
|
CPU and GPU |
|
CPU and GPU |
|
CPU and GPU |
|
CPU and GPU |
Input Parameters¶
- queue
Device queue where calculations will be performed.
- m
The number of rows in the matrices
A
i (0 ≤ m
).- n
The number of columns in the matrices
A
i (0 ≤ n
).- a
Array holding input matrices
A
i.- lda
The leading dimension of
A
i .- stride_a
The stride between the beginnings of matrices
A
i inside the batch arraya
.- batch_size
The number of problems in a batch.
- scratchpad
Scratchpad memory to be used by routine for storing intermediate results.
- scratchpad_size
Size of scratchpad memory as a number of floating point elements of type
T
. Size should not be less than the value returned by getrfnp_batch_scratchpad_size (Strided Version).- events
List of events to wait for before starting computation. Defaults to empty list.
Output Parameters¶
- a
Overwritten by
L
i andU
i. The unit diagnonal elements ofL
i are not stored.
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 |
Return Values¶
Output event to wait on to ensure computation is complete.