getrf (USM Version)¶
Computes the LU factorization of a general m-by-n matrix. This routine
belongs to the oneapi::mkl::lapack
namespace.
Syntax
-
cl::sycl::event
getrf
(cl::sycl::queue &queue, std::int64_t m, std::int64_t n, T *a, std::int64_t lda, std::int64_t *ipiv, T *scratchpad, std::int64_t scratchpad_size, const cl::sycl::vector_class<cl::sycl::event> &events = {})¶
getrf
(USM version) supports the following precisions and
devices:
T |
Devices supported |
---|---|
|
Host, CPU, GPU |
|
Host, CPU, GPU |
|
Host, CPU, GPU |
|
Host, CPU, GPU |
Description
The routine computes the LU
factorization of a general
m
-by-n
matrix A
as
A = P*L*U,
where P
is a permutation matrix, 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 uses
partial pivoting, with row interchanges.
Input Parameters
- queue
Device queue where calculations will be performed.
- m
The number of rows in the matrix
A
(0≤m
).- n
The number of columns in the matrix
A
(0≤n
).- a
Pointer to the array holding input matrix
A
. The second dimension ofa
must be at leastmax(1, n)
.- lda
The leading dimension of
a
.- scratchpad
Pointer to 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
T
. Size should not be less than the value returned by the getrf_scratchpad_size function.- events
List of events to wait for before starting computation. Defaults to empty list.
Output Parameters
- a
Overwritten by
L
andU
. the unit diagonal elements ofL
are not stored.- ipiv
Array, size at least
max(1,min(m,n))
.Contains the pivot indices; for
1 ≤ i ≤ min(m,n)
, rowi
was interchanged with rowipiv(i)
.
Exceptions
mkl::lapack::exception |
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 |
Return Values
Output event to wait on to ensure computation is complete.