MAGMA  2.3.0 Matrix Algebra for GPU and Multicore Architectures
potf2: Cholesky panel factorization

Functions

magma_int_t magma_cpotf2_tile_batched (magma_uplo_t uplo, magma_int_t m, magma_int_t n, magmaFloatComplex **dA_array, magma_int_t lda, magma_int_t *info_array, magma_int_t gbstep, magma_int_t batchCount, magma_queue_t queue)
cpotf2 computes the Cholesky factorization of a real symmetric positive definite matrix A. More...

magma_int_t magma_dpotf2_tile_batched (magma_uplo_t uplo, magma_int_t m, magma_int_t n, double **dA_array, magma_int_t lda, magma_int_t *info_array, magma_int_t gbstep, magma_int_t batchCount, magma_queue_t queue)
dpotf2 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_zpotf2_tile_batched (magma_uplo_t uplo, magma_int_t m, magma_int_t n, magmaDoubleComplex **dA_array, magma_int_t lda, magma_int_t *info_array, magma_int_t gbstep, magma_int_t batchCount, magma_queue_t queue)
zpotf2 computes the Cholesky factorization of a real symmetric positive definite matrix A. More...

Function Documentation

 magma_int_t magma_cpotf2_tile_batched ( magma_uplo_t uplo, magma_int_t m, magma_int_t n, magmaFloatComplex ** dA_array, magma_int_t lda, magma_int_t * info_array, magma_int_t gbstep, magma_int_t batchCount, magma_queue_t queue )

cpotf2 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.

Parameters
 [in] uplo magma_uplo_t Specifies whether the upper or lower triangular part of the symmetric matrix A is stored. = MagmaUpper: Upper triangular = MagmaLower: Lower triangular [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 COMPLEX 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 = 0: successful exit < 0: if INFO = -k, the k-th argument had an illegal value > 0: if INFO = k, the leading minor of order k is not positive definite, and the factorization could not be completed. [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.
 magma_int_t magma_dpotf2_tile_batched ( magma_uplo_t uplo, magma_int_t m, magma_int_t n, double ** dA_array, magma_int_t lda, magma_int_t * info_array, magma_int_t gbstep, magma_int_t batchCount, magma_queue_t queue )

dpotf2 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.

Parameters
 [in] uplo magma_uplo_t Specifies whether the upper or lower triangular part of the symmetric matrix A is stored. = MagmaUpper: Upper triangular = MagmaLower: Lower triangular [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 DOUBLE PRECISION 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 = 0: successful exit < 0: if INFO = -k, the k-th argument had an illegal value > 0: if INFO = k, the leading minor of order k is not positive definite, and the factorization could not be completed. [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.
 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.

Parameters
 [in] uplo magma_uplo_t Specifies whether the upper or lower triangular part of the symmetric matrix A is stored. = MagmaUpper: Upper triangular = MagmaLower: Lower triangular [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 = 0: successful exit < 0: if INFO = -k, the k-th argument had an illegal value > 0: if INFO = k, the leading minor of order k is not positive definite, and the factorization could not be completed. [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.
 magma_int_t magma_zpotf2_tile_batched ( magma_uplo_t uplo, magma_int_t m, magma_int_t n, magmaDoubleComplex ** dA_array, magma_int_t lda, magma_int_t * info_array, magma_int_t gbstep, magma_int_t batchCount, magma_queue_t queue )

zpotf2 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.

Parameters
 [in] uplo magma_uplo_t Specifies whether the upper or lower triangular part of the symmetric matrix A is stored. = MagmaUpper: Upper triangular = MagmaLower: Lower triangular [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 COMPLEX_16 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 = 0: successful exit < 0: if INFO = -k, the k-th argument had an illegal value > 0: if INFO = k, the leading minor of order k is not positive definite, and the factorization could not be completed. [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.