![]() |
MAGMA
2.0.0
Matrix Algebra for GPU and Multicore Architectures
|
Functions | |
magma_int_t | magma_slauum (magma_uplo_t uplo, magma_int_t n, float *A, magma_int_t lda, magma_int_t *info) |
SLAUUM computes the product U * U^H or L^H * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A. More... | |
magma_int_t | magma_slauum_gpu (magma_uplo_t uplo, magma_int_t n, magmaFloat_ptr dA, magma_int_t ldda, magma_int_t *info) |
SLAUUM computes the product U * U^H or L^H * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array dA. More... | |
magma_int_t | magma_spotf2_gpu (magma_uplo_t uplo, magma_int_t n, magmaFloat_ptr dA, magma_int_t ldda, magma_int_t *info) |
spotf2 computes the Cholesky factorization of a real symmetric positive definite matrix A. More... | |
magma_int_t | magma_spotf2_tile_batched (magma_uplo_t uplo, magma_int_t m, magma_int_t n, float **dA_array, magma_int_t lda, magma_int_t *info_array, magma_int_t gbstep, magma_int_t batchCount, magma_queue_t queue) |
spotf2 computes the Cholesky factorization of a real symmetric positive definite matrix A. More... | |
magma_int_t magma_slauum | ( | magma_uplo_t | uplo, |
magma_int_t | n, | ||
float * | A, | ||
magma_int_t | lda, | ||
magma_int_t * | info | ||
) |
SLAUUM computes the product U * U^H or L^H * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array A.
If UPLO = MagmaUpper then the upper triangle of the result is stored, overwriting the factor U in A. If UPLO = MagmaLower then the lower triangle of the result is stored, overwriting the factor L in A. This is the blocked form of the algorithm, calling Level 3 BLAS.
[in] | uplo | magma_uplo_t Specifies whether the triangular factor stored in the array A is upper or lower triangular:
|
[in] | n | INTEGER The order of the triangular factor U or L. N >= 0. |
[in,out] | A | REAL array, dimension (LDA,N) On entry, the triangular factor U or L. On exit, if UPLO = MagmaUpper, the upper triangle of A is overwritten with the upper triangle of the product U * U^H; if UPLO = MagmaLower, the lower triangle of A is overwritten with the lower triangle of the product L^H * L. |
[in] | lda | INTEGER The leading dimension of the array A. LDA >= max(1,N). |
[out] | info | INTEGER
|
magma_int_t magma_slauum_gpu | ( | magma_uplo_t | uplo, |
magma_int_t | n, | ||
magmaFloat_ptr | dA, | ||
magma_int_t | ldda, | ||
magma_int_t * | info | ||
) |
SLAUUM computes the product U * U^H or L^H * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array dA.
If UPLO = MagmaUpper then the upper triangle of the result is stored, overwriting the factor U in dA. If UPLO = MagmaLower then the lower triangle of the result is stored, overwriting the factor L in dA. This is the blocked form of the algorithm, calling Level 3 BLAS.
[in] | uplo | magma_uplo_t Specifies whether the triangular factor stored in the array dA is upper or lower triangular:
|
[in] | n | INTEGER The order of the triangular factor U or L. N >= 0. |
[in,out] | dA | REAL array on the GPU, dimension (LDDA,N) On entry, the triangular factor U or L. On exit, if UPLO = MagmaUpper, the upper triangle of dA is overwritten with the upper triangle of the product U * U^H; if UPLO = MagmaLower, the lower triangle of dA is overwritten with the lower triangle of the product L^H * L. |
[in] | ldda | INTEGER The leading dimension of the array A. LDDA >= max(1,N). |
[out] | info | INTEGER
|
magma_int_t magma_spotf2_gpu | ( | magma_uplo_t | uplo, |
magma_int_t | n, | ||
magmaFloat_ptr | dA, | ||
magma_int_t | ldda, | ||
magma_int_t * | info | ||
) |
spotf2 computes the Cholesky factorization of a real symmetric positive definite matrix A.
The factorization has the form A = U**H * U, if UPLO = MagmaUpper, or A = L * L**H, if UPLO = MagmaLower, where U is an upper triangular matrix and L is lower triangular.
This is the unblocked version of the algorithm, calling Level 2 BLAS.
[in] | uplo | magma_uplo_t Specifies whether the upper or lower triangular part of the symmetric matrix A is stored.
|
[in] | n | INTEGER The order of the matrix A. N >= 0 and N <= 512. |
[in,out] | dA | REAL array, dimension (LDDA,N) On entry, the symmetric matrix A. If UPLO = MagmaUpper, the leading n by n upper triangular part of A contains the upper triangular part of the matrix A, and the strictly lower triangular part of A is not referenced. If UPLO = MagmaLower, the leading n by n lower triangular part of A contains the lower triangular part of the matrix A, and the strictly upper triangular part of A is not referenced. On exit, if INFO = 0, the factor U or L from the Cholesky factorization A = U**H * U or A = L * L**H. |
[in] | ldda | INTEGER The leading dimension of the array A. LDDA >= max(1,N). |
[out] | info | INTEGER
|
magma_int_t magma_spotf2_tile_batched | ( | magma_uplo_t | uplo, |
magma_int_t | m, | ||
magma_int_t | n, | ||
float ** | dA_array, | ||
magma_int_t | lda, | ||
magma_int_t * | info_array, | ||
magma_int_t | gbstep, | ||
magma_int_t | batchCount, | ||
magma_queue_t | queue | ||
) |
spotf2 computes the Cholesky factorization of a real symmetric positive definite matrix A.
The factorization has the form A = U**H * U, if UPLO = MagmaUpper, or A = L * L**H, if UPLO = MagmaLower, where U is an upper triangular matrix and L is lower triangular.
This is the unblocked version of the algorithm, calling Level 2 BLAS.
[in] | uplo | magma_uplo_t Specifies whether the upper or lower triangular part of the symmetric matrix A is stored.
|
[in] | m | INTEGER The number of rows of the matrix A. |
[in] | n | INTEGER The order of the matrix A. N >= 0 and N <= 512. |
[in,out] | dA_array | Array of pointers, dimension (batchCount). Each is a REAL array A, dimension (lda,n) On entry, the symmetric matrix A. If UPLO = MagmaUpper, the leading n by n upper triangular part of A contains the upper triangular part of the matrix A, and the strictly lower triangular part of A is not referenced. If UPLO = MagmaLower, the leading n by n lower triangular part of A contains the lower triangular part of the matrix A, and the strictly upper triangular part of A is not referenced. On exit, if INFO = 0, the factor U or L from the Cholesky factorization A = U**H * U or A = L * L**H. |
[in] | lda | INTEGER The leading dimension of the array A. LDDA >= max(1,N). |
[out] | info_array | INTEGER array, dimension (batchCount). Each is the info parameter for the corresponding matrix A
|
[in] | gbstep | INTEGER Internal use, global step. |
[in] | batchCount | INTEGER The number of matrices to operate on. |
[in] | queue | magma_queue_t Queue to execute in. |