Solves a system of linear equations whose coefficients are in a triangular packed matrix.
event tpsv(queue &exec_queue, uplo upper_lower, transpose trans, diag unit_nonunit, std::int64_t n, std::int64_t k, const T *a, T *x, std::int64_t incx, const vector_class<event> &dependencies = {});
The USM version of tpsv supports the following precisions and devices.
T | Devices Supported |
---|---|
float | Host, CPU, and GPU |
double | Host, CPU, and GPU |
std::complex<float> | Host, CPU, and GPU |
std::complex<double> | Host, CPU, and GPU |
The tpsv routines solve a system of linear equations whose coefficients are in a triangular packed matrix. The operation is defined as
op(A)*x = b
where:
op(A) is one of op(A) = A, or op(A) = AT, or op(A) = AH,
A is an n-by-n unit or non-unit, upper or lower triangular band matrix, supplied in packed form,
b and x are vectors of length n.
The queue where the routine should be executed.
Specifies whether A is upper or lower triangular. See Data Types for more details.
Specifies op(A), the transposition operation applied to A. See Data Types for more details.
Specifies whether the matrix A is unit triangular or not. See Data Types for more details.
Numbers of rows and columns of A. Must be at least zero.
Pointer to input matrix A. The array holding input matrix A must have size at least (n*(n+1))/2. See Matrix and Vector Storage for more details.
Pointer to the n-element right-hand side vector b. The array holding the n-element right-hand side vector b must be of size at least (1 + (n - 1)*abs(incx)). See Matrix and Vector Storage for more details.
Stride of vector x.
List of events to wait for before starting computation, if any. If omitted, defaults to no dependencies.
Pointer to the solution vector x.
Output event to wait on to ensure computation is complete.