rocsolver_sgetf2_npvt Interface Reference#
hipfort_rocsolver::rocsolver_sgetf2_npvt Interface Reference
The GETF2_NPVT functions compute the LU factorization of a general m -by-n matrix A without partial pivoting.
More...
Public Member Functions | |
| integer(kind(rocblas_status_success)) function | rocsolver_sgetf2_npvt_ (handle, m, n, a, lda, myinfo) |
| integer(kind(rocblas_status_success)) function | rocsolver_sgetf2_npvt_rank_0 (handle, m, n, a, lda, myinfo) |
| integer(kind(rocblas_status_success)) function | rocsolver_sgetf2_npvt_rank_1 (handle, m, n, a, lda, myinfo) |
| integer(kind(rocblas_status_success)) function | rocsolver_sgetf2_npvt_full_rank (handle, m, n, a, lda, myinfo) |
Detailed Description
The GETF2_NPVT functions compute the LU factorization of a general m -by-n matrix A without partial pivoting.
(This is the unblocked Level-2-BLAS version of the algorithm. An optimized internal implementation without rocBLAS calls could be executed with small and mid-size matrices if optimizations are enabled (default option). For more details, see the "rocSOLVER performance tuning" guide.)
The factorization has the form
\[ A = LU \]
where L is lower triangular with unit diagonal elements (lower trapezoidal if m > n), and U is upper triangular (upper trapezoidal if m < n).
- Note
- Although this routine can offer better performance, Gaussian elimination without pivoting is not backward stable. If numerical accuracy is compromised, use the legacy-LAPACK API GETF2 routines instead.
- Parameters
-
[in] handle - rocblas_handle. [in] m - rocblas_int. m >= 0. The number of rows of the matrix A. [in] n - rocblas_int. n >= 0. The number of columns of the matrix A. [in,out] A - pointer to type. Array on the GPU of dimension lda*n. On entry, the m-by-n matrix A to be factored. On exit, the factors L and U from the factorization. The unit diagonal elements of L are not stored. [in] lda - rocblas_int. lda >= m. Specifies the leading dimension of A. [out] myInfo - pointer to a rocblas_int on the GPU. If info = 0, successful exit. If info = i > 0, U is singular. U[i,i] is the first zero element in the diagonal. The factorization from this point might be incomplete.
Member Function/Subroutine Documentation
◆ rocsolver_sgetf2_npvt_()
| integer(kind(rocblas_status_success)) function hipfort_rocsolver::rocsolver_sgetf2_npvt::rocsolver_sgetf2_npvt_ | ( | type(c_ptr), value | handle, |
| integer(c_int), value | m, | ||
| integer(c_int), value | n, | ||
| type(c_ptr), value | a, | ||
| integer(c_int), value | lda, | ||
| type(c_ptr), value | myinfo | ||
| ) |
◆ rocsolver_sgetf2_npvt_full_rank()
| integer(kind(rocblas_status_success)) function hipfort_rocsolver::rocsolver_sgetf2_npvt::rocsolver_sgetf2_npvt_full_rank | ( | type(c_ptr) | handle, |
| integer(c_int) | m, | ||
| integer(c_int) | n, | ||
| real(c_float), dimension(:,:), target | a, | ||
| integer(c_int) | lda, | ||
| type(c_ptr) | myinfo | ||
| ) |
◆ rocsolver_sgetf2_npvt_rank_0()
| integer(kind(rocblas_status_success)) function hipfort_rocsolver::rocsolver_sgetf2_npvt::rocsolver_sgetf2_npvt_rank_0 | ( | type(c_ptr) | handle, |
| integer(c_int) | m, | ||
| integer(c_int) | n, | ||
| real(c_float), target | a, | ||
| integer(c_int) | lda, | ||
| type(c_ptr) | myinfo | ||
| ) |
◆ rocsolver_sgetf2_npvt_rank_1()
| integer(kind(rocblas_status_success)) function hipfort_rocsolver::rocsolver_sgetf2_npvt::rocsolver_sgetf2_npvt_rank_1 | ( | type(c_ptr) | handle, |
| integer(c_int) | m, | ||
| integer(c_int) | n, | ||
| real(c_float), dimension(:), target | a, | ||
| integer(c_int) | lda, | ||
| type(c_ptr) | myinfo | ||
| ) |
The documentation for this interface was generated from the following file: