LASs - Linear Algebra Routines on OmpSs
1.0.0
LASs
|
LASs-DDSs ddss_dpotrf routine. More...
#include "../include/lass.h"
Go to the source code of this file.
Functions | |
int | ddss_dpotrf (enum DDSS_UPLO UPLO, int N, double *A, int LDA) |
LASs-DDSs ddss_dpotrf routine.
LASs-DDSs is a software package provided by: Barcelona Supercomputing Center - Centro Nacional de Supercomputacion
Definition in file ddss_dpotrf.c.
int ddss_dpotrf | ( | enum DDSS_UPLO | UPLO, |
int | N, | ||
double * | A, | ||
int | LDA | ||
) |
Performs the Cholesky factorization of a symmetric positive definite matrix A:
A = L \times L^T or A = U^T \times U
where L is a lower triangular matrix and U is an upper triangular matrix.
[in] | UPLO | enum DDSS_UPLO. UPLO specifies the form of A is stored:
|
[in] | N | int. N specifies the order of the square matrix A. N >= 0. |
[in,out] | A | double *. A is a pointer to a positive definite matrix of dimension N by LDA. On exit, if return value is Success, the matrix A is overwriten by the factor U or L. |
[in] | LDA | int. LDA specifies the number of columns of A ( row-major order ). LDA must be at least max( 1, N ). |
Success | successful exit |
NoSuccess | unsuccessful exit |
Definition at line 74 of file ddss_dpotrf.c.
References kdpotrf().