Commit e46b6449 authored by Mathieu Faverge's avatar Mathieu Faverge

Rules precision

parent 747ea54a
......@@ -97,7 +97,7 @@ option(BUILD_SHARED_LIBS "Build shared libraries" OFF)
# Define precision supported by CHAMELEON
# -----------------------------------------
set( RP_CHAMELEON_DICTIONNARY ${CHAMELEON_CMAKE_MODULE_PATH}/precision_generator/subs.py )
set( RP_CHAMELEON_DICTIONNARY ${CMAKE_SOURCE_DIR}/cmake_modules/local_subs.py )
set( RP_CHAMELEON_PRECISIONS "s;d;c;z" )
include(RulesPrecisions)
......@@ -586,7 +586,7 @@ endif(NOT CHAMELEON_SIMULATION)
# -------------------------------
if( CHAMELEON_SCHED_STARPU )
set(CHAMELEON_STARPU_VERSION "1.1" CACHE STRING "oldest STARPU version desired")
set(CHAMELEON_STARPU_VERSION "1.3" CACHE STRING "oldest STARPU version desired")
# create list of components in order to make a single call to find_package(starpu...)
if(NOT CHAMELEON_SIMULATION)
......
_extra_blas = [
# ----- Additional BLAS
('', 'dsgesv', 'dsgesv', 'zcgesv', 'zcgesv' ),
('', 'sgesplit', 'dgesplit', 'cgesplit', 'zgesplit' ),
('', 'slascal', 'dlascal', 'clascal', 'zlascal' ),
('', 'slapack', 'dlapack', 'clapack', 'zlapack' ),
('', 'stile', 'dtile', 'ctile', 'ztile' ),
('', 'sgecon', 'dgecon', 'cgecon', 'zgecon' ),
('', 'spocon', 'dpocon', 'cpocon', 'zpocon' ),
('', 'strasm', 'dtrasm', 'ctrasm', 'ztrasm' ),
('', 'sgecfi', 'dgecfi', 'cgecfi', 'zgecfi' ),
('', 'splssq', 'dplssq', 'cplssq', 'zplssq' ),
('', 'sy2sb', 'sy2sb' , 'he2hb', 'he2hb' ),
('', 'she2ge', 'dhe2ge', 'che2ge', 'zhe2ge' ),
('', 'slatro', 'dlatro', 'clatro', 'zlatro' ), #=> Replace by getmo/gecmo as in essl
('', 'sbuild', 'dbuild', 'cbuild', 'zbuild' ), #=> Replace by map function
]
_extra_BLAS = [ [ x.upper() for x in row ] for row in _extra_blas ]
subs = {
# ------------------------------------------------------------
# replacements applied to mixed precision files.
'mixed' : [
# double/single, double/single-complex
#'12345678901234567890', '12345678901234567890')
(r'\bdouble', r'\bCHAMELEON_Complex64_t'),
(r'\bChamRealDouble', r'\bChamComplexDouble' ),
(r'\bfloat', r'\bCHAMELEON_Complex32_t'),
(r'\bChamRealFloat', r'\bChamComplexFloat' ),
(r'\breal\b', r'\bcomplex\b' ),
('dsgels', 'zcgels' ),
('dsorgesv', 'zcungesv' ),
],
# ------------------------------------------------------------
# replacements applied to mixed precision files.
'normal': [
# pattern single double single-complex double-complex
#'12345678901234567890', '12345678901234567890', '12345678901234567890', '12345678901234567890', '12345678901234567890')
('int', 'float', 'double', 'CHAMELEON_Complex32_t', r'\bCHAMELEON_Complex64_t'),
('ChamPattern', 'ChamRealFloat', 'ChamRealDouble', 'ChamComplexFloat', r'\bChamComplexDouble' ),
('ChamPattern', 'ChamRealFloat', 'ChamRealDouble', 'ChamRealFloat', r'\bChamRealDouble' ),
# ----- Additional BLAS
('', 'sTile', 'dTile', 'cTile', 'zTile' ),
('', 'sLapack', 'dLapack', 'cLapack', 'zLapack' ),
('', 'ORMQR', 'ORMQR', 'UNMQR', 'UNMQR' ),
('', 'ORMLQ', 'ORMLQ', 'UNMLQ', 'UNMLQ' ),
('', 'SYEV', 'SYEV', 'HEEV', 'HEEV' ),
('', 'SYG', 'SYG', 'HEG', 'HEG' ),
]
+ _extra_blas
+ _extra_BLAS
+ [
# ----- For norms: compute result in Real or Double
('', 'slange', 'dlange', 'slange', 'dlange' ),
('', 'slaset', 'dlaset', 'slaset', 'dlaset' ),
('', 'splssq', 'dplssq', 'splssq', 'dplssq' ),
('', 'slacpy', 'dlacpy', 'slacpy', 'dlacpy' ),
('', 'saxpy', 'daxpy', 'saxpy', 'daxpy' ),
(r'\b', r'szero\b', r'dzero\b', r'czero\b', r'zzero\b' ),
# (r'\b', r'sone\b', r'done\b', r'cone\b', r'zone\b' ),
# ----- Chameleon Prefixes
('CHAMELEON_P', 'CHAMELEON_S', 'CHAMELEON_D', 'CHAMELEON_C', 'CHAMELEON_Z' ),
('RUNTIME_P', 'RUNTIME_s', 'RUNTIME_d', 'RUNTIME_c', 'RUNTIME_z' ),
('chameleon_p', 'chameleon_s', 'chameleon_d', 'chameleon_c', 'chameleon_z' ),
('codelet_p', 'codelet_s', 'codelet_d', 'codelet_c', 'codelet_z' ),
('runtime_p', 'runtime_s', 'runtime_d', 'runtime_c', 'runtime_z' ),
('testing_p', 'testing_s', 'testing_d', 'testing_c', 'testing_z' ),
('timing_p', 'timing_s', 'timing_d', 'timing_c', 'timing_z' ),
('workspace_p', 'workspace_s', 'workspace_d', 'workspace_c', 'workspace_z' ),
# ('CORE_P', 'CORE_S', 'CORE_D', 'CORE_C', 'CORE_Z' ),
# ('vec_p', 'vec_s', 'vec_d', 'vec_c', 'vec_z' ),
# ('', 'starpu_s', 'starpu_d', 'starpu_c', 'starpu_z' ),
# ('', 'STARPU_S', 'STARPU_D', 'STARPU_C', 'STARPU_Z' ),
# ('', 's_', 'd_', 'c_', 'z_' ),
# ('', 'S_', 'D_', 'C_', 'Z_' ),
# ('', 'FLT_EPSILON', 'DBL_EPSILON', 'FLT_EPSILON', 'DBL_EPSILON' ),
# ('', 's_RAFF_FLOAT', 'd_RAFF_FLOAT', 'c_RAFF_FLOAT', 'z_RAFF_FLOAT' ),
# # ----- unused?
# ('', 's_check', 'd_check', 'c_check', 'z_check' ),
# ('', 'stesting', 'dtesting', 'ctesting', 'ztesting' ),
# ('', 'SAUXILIARY', 'DAUXILIARY', 'CAUXILIARY', 'ZAUXILIARY' ),
# ('', 'sbuild', 'dbuild', 'cbuild', 'zbuild' ),
]
}
Subproject commit 33a182878f9049c47af1fce3e86e72b9a10e7f7a
Subproject commit ade499661b58c71fe0586c2bbb98ea9725a88c52
......@@ -48,7 +48,7 @@
* @param[in] trans
* Intended usage:
* = ChamNoTrans: the linear system involves A;
* = ChamConjTrans: the linear system involves A**H.
* = ChamConjTrans: the linear system involves A^H.
* Currently only ChamNoTrans is supported.
*
* @param[in] M
......@@ -218,7 +218,7 @@ int CHAMELEON_zgels( cham_trans_t trans, int M, int N, int NRHS,
* @param[in] trans
* Intended usage:
* = ChamNoTrans: the linear system involves A;
* = ChamConjTrans: the linear system involves A**H.
* = ChamConjTrans: the linear system involves A^H.
* Currently only ChamNoTrans is supported.
*
* @param[in,out] A
......
......@@ -48,7 +48,7 @@
* @param[in] trans
* Intended usage:
* = ChamNoTrans: the linear system involves A;
* = ChamConjTrans: the linear system involves A**H.
* = ChamConjTrans: the linear system involves A^H.
* Currently only ChamNoTrans is supported.
*
* @param[in] M
......@@ -221,7 +221,7 @@ int CHAMELEON_zgels_param( const libhqr_tree_t *qrtree, cham_trans_t trans, int
* @param[in] trans
* Intended usage:
* = ChamNoTrans: the linear system involves A;
* = ChamConjTrans: the linear system involves A**H.
* = ChamConjTrans: the linear system involves A^H.
* Currently only ChamNoTrans is supported.
*
* @param[in,out] A
......
......@@ -44,7 +44,7 @@
* are returned in descending order. The first min(m,n) columns of
* U and V are the left and right singular vectors of A.
*
* Note that the routine returns V**T, not V.
* Note that the routine returns V^T, not V.
*******************************************************************************
*
* @param[in] jobu
......@@ -62,16 +62,16 @@
* NOT SUPPORTTED YET
*
* @param[in] jobvt
* Specifies options for computing all or part of the matrix V**H.
* Specifies options for computing all or part of the matrix V^H.
* Intended usage:
* = ChamVec = 'A'(lapack): all N rows of V**H are returned
* = ChamVec = 'A'(lapack): all N rows of V^H are returned
* in the array VT;
* = ChamNoVec = 'N': no rows of V**H (no right singular vectors)
* = ChamNoVec = 'N': no rows of V^H (no right singular vectors)
* are computed.
* = ChamSVec = 'S': the first min(m,n) rows of V**H (the right
* = ChamSVec = 'S': the first min(m,n) rows of V^H (the right
* singular vectors) are returned in the array VT;
* NOT SUPPORTTED YET
* = ChamOVec = 'O': the first min(m,n) rows of V**H (the right
* = ChamOVec = 'O': the first min(m,n) rows of V^H (the right
* singular vectors) are overwritten on the array A;
* NOT SUPPORTTED YET
*
......@@ -90,7 +90,7 @@
* columns of U (the left singular vectors,
* stored columnwise);
* if JOBVT = 'O', A is overwritten with the first min(m,n)
* rows of V**H (the right singular vectors,
* rows of V^H (the right singular vectors,
* stored rowwise);
* if JOBU .ne. 'O' and JOBVT .ne. 'O', the contents of A
* are destroyed.
......@@ -118,9 +118,9 @@
*
* @param[out] VT
* If JOBVT = 'A', VT contains the N-by-N unitary matrix
* V**H;
* V^H;
* if JOBVT = 'S', VT contains the first min(m,n) rows of
* V**H (the right singular vectors, stored rowwise);
* V^H (the right singular vectors, stored rowwise);
* if JOBVT = 'N' or 'O', VT is not referenced.
*
* @param[in] LDVT
......@@ -259,16 +259,16 @@ int CHAMELEON_zgesvd( cham_job_t jobu, cham_job_t jobvt,
* NOT SUPPORTTED YET
*
* @param[in] jobvt
* Specifies options for computing all or part of the matrix V**H.
* Specifies options for computing all or part of the matrix V^H.
* Intended usage:
* = ChamVec = 'A'(lapack): all N rows of V**H are returned
* = ChamVec = 'A'(lapack): all N rows of V^H are returned
* in the array VT;
* = ChamNoVec = 'N': no rows of V**H (no right singular vectors)
* = ChamNoVec = 'N': no rows of V^H (no right singular vectors)
* are computed.
* = ChamSVec = 'S': the first min(m,n) rows of V**H (the right
* = ChamSVec = 'S': the first min(m,n) rows of V^H (the right
* singular vectors) are returned in the array VT;
* NOT SUPPORTTED YET
* = ChamOVec = 'O': the first min(m,n) rows of V**H (the right
* = ChamOVec = 'O': the first min(m,n) rows of V^H (the right
* singular vectors) are overwritten on the array A;
* NOT SUPPORTTED YET
*
......@@ -281,7 +281,7 @@ int CHAMELEON_zgesvd( cham_job_t jobu, cham_job_t jobvt,
* columns of U (the left singular vectors,
* stored columnwise);
* if JOBVT = 'O', A is overwritten with the first min(m,n)
* rows of V**H (the right singular vectors,
* rows of V^H (the right singular vectors,
* stored rowwise);
* if JOBU .ne. 'O' and JOBVT .ne. 'O', the contents of A
* are destroyed.
......@@ -306,9 +306,9 @@ int CHAMELEON_zgesvd( cham_job_t jobu, cham_job_t jobvt,
*
* @param[out] VT
* If JOBVT = 'A', VT contains the N-by-N unitary matrix
* V**H;
* V^H;
* if JOBVT = 'S', VT contains the first min(m,n) rows of
* V**H (the right singular vectors, stored rowwise);
* V^H (the right singular vectors, stored rowwise);
* if JOBVT = 'N' or 'O', VT is not referenced.
*
* @param[in] LDVT
......
......@@ -37,8 +37,8 @@
* @param[in] trans
* Intended to specify the the form of the system of equations:
* = ChamNoTrans: A * X = B (No transpose)
* = ChamTrans: A**T * X = B (Transpose)
* = ChamConjTrans: A**H * X = B (Conjugate transpose)
* = ChamTrans: A^T * X = B (Transpose)
* = ChamConjTrans: A^H * X = B (Conjugate transpose)
* Currently only ChamNoTrans is supported.
*
* @param[in] N
......
......@@ -38,8 +38,8 @@
* @param[in] trans
* Intended to specify the the form of the system of equations:
* = ChamNoTrans: A * X = B (No transpose)
* = ChamTrans: A**T * X = B (Transpose)
* = ChamConjTrans: A**H * X = B (Conjugate transpose)
* = ChamTrans: A^T * X = B (Transpose)
* = ChamConjTrans: A^H * X = B (Conjugate transpose)
* Currently only ChamNoTrans is supported.
*
* @param[in] N
......
......@@ -34,7 +34,7 @@
* tridiagonal form S using a two-stage approach
* First stage: reduction to band tridiagonal form (unitary Q1);
* Second stage: reduction from band to tridiagonal form (unitary
* Q2). Let Q = Q1 * Q2 be the global unitary transformation; Q**H *
* Q2). Let Q = Q1 * Q2 be the global unitary transformation; Q^H *
* A * Q = S.
*
*******************************************************************************
......@@ -190,7 +190,7 @@ int CHAMELEON_zhetrd( cham_job_t jobz, cham_uplo_t uplo, int N,
* First stage: reduction to band tridiagonal form (unitary Q1);
* Second stage: reduction from band to tridiagonal form (unitary Q2).
* Let Q = Q1 * Q2 be the global unitary transformation;
* Q**H * A * Q = S.
* Q^H * A * Q = S.
* Tile equivalent of CHAMELEON_zhetrd().
* Operates on matrices stored by tiles.
* All matrices are passed through descriptors.
......
......@@ -61,7 +61,7 @@
* triangular part of the matrix A, and the strictly upper triangular part of A is not
* referenced.
* On exit, if return value = 0, the factor U or L from the Cholesky factorization
* A = U**H*U or A = L*L**H.
* A = U^H*U or A = L*L^H.
*
* @param[in] LDA
* The leading dimension of the array A. LDA >= max(1,N).
......@@ -197,7 +197,7 @@ int CHAMELEON_zposv( cham_uplo_t uplo, int N, int NRHS,
* triangular part of the matrix A, and the strictly upper triangular part of A is not
* referenced.
* On exit, if return value = 0, the factor U or L from the Cholesky factorization
* A = U**H*U or A = L*L**H.
* A = U^H*U or A = L*L^H.
*
* @param[in,out] B
* On entry, the N-by-NRHS right hand side matrix B.
......
......@@ -55,7 +55,7 @@
* triangular part of the matrix A, and the strictly upper triangular part of A is not
* referenced.
* On exit, if return value = 0, the factor U or L from the Cholesky factorization
* A = U**H*U or A = L*L**H.
* A = U^H*U or A = L*L^H.
*
* @param[in] LDA
* The leading dimension of the array A. LDA >= max(1,N).
......@@ -170,7 +170,7 @@ int CHAMELEON_zpotrf( cham_uplo_t uplo, int N,
* triangular part of the matrix A, and the strictly upper triangular part of A is not
* referenced.
* On exit, if return value = 0, the factor U or L from the Cholesky factorization
* A = U**H*U or A = L*L**H.
* A = U^H*U or A = L*L^H.
*
*******************************************************************************
*
......
......@@ -29,7 +29,7 @@
* @ingroup CHAMELEON_Complex64_t
*
* CHAMELEON_zpotri - Computes the inverse of a complex Hermitian positive definite
* matrix A using the Cholesky factorization A = U**H*U or A = L*L**H
* matrix A using the Cholesky factorization A = U^H*U or A = L*L^H
* computed by CHAMELEON_zpotrf.
*
*******************************************************************************
......@@ -43,7 +43,7 @@
*
* @param[in,out] A
* On entry, the triangular factor U or L from the Cholesky
* factorization A = U**H*U or A = L*L**H, as computed by
* factorization A = U^H*U or A = L*L^H, as computed by
* CHAMELEON_zpotrf.
* On exit, the upper or lower triangle of the (Hermitian)
* inverse of A, overwriting the input factor U or L.
......@@ -140,7 +140,7 @@ int CHAMELEON_zpotri( cham_uplo_t uplo, int N,
*
* CHAMELEON_zpotri_Tile - Computes the inverse of a complex Hermitian
* positive definite matrix A using the Cholesky factorization
* A = U**H*U or A = L*L**H computed by CHAMELEON_zpotrf.
* A = U^H*U or A = L*L^H computed by CHAMELEON_zpotrf.
* Tile equivalent of CHAMELEON_zpotri().
* Operates on matrices stored by tiles.
* All matrices are passed through descriptors.
......@@ -154,7 +154,7 @@ int CHAMELEON_zpotri( cham_uplo_t uplo, int N,
*
* @param[in] A
* On entry, the triangular factor U or L from the Cholesky
* factorization A = U**H*U or A = L*L**H, as computed by
* factorization A = U^H*U or A = L*L^H, as computed by
* CHAMELEON_zpotrf.
* On exit, the upper or lower triangle of the (Hermitian)
* inverse of A, overwriting the input factor U or L.
......@@ -206,8 +206,8 @@ int CHAMELEON_zpotri_Tile( cham_uplo_t uplo, CHAM_desc_t *A )
* @ingroup CHAMELEON_Complex64_t_Tile_Async
*
* CHAMELEON_zpotri_Tile_Async - Computes the inverse of a complex Hermitian
* positive definite matrix A using the Cholesky factorization A = U**H*U
* or A = L*L**H computed by CHAMELEON_zpotrf.
* positive definite matrix A using the Cholesky factorization A = U^H*U
* or A = L*L^H computed by CHAMELEON_zpotrf.
* Non-blocking equivalent of CHAMELEON_zpotri_Tile().
* May return before the computation is finished.
* Allows for pipelining of operations at runtime.
......
......@@ -29,7 +29,7 @@
* @ingroup CHAMELEON_Complex64_t
*
* CHAMELEON_zpotrimm - Computes the inverse of a complex Hermitian positive definite
* matrix A using the Cholesky factorization A = U**H*U or A = L*L**H
* matrix A using the Cholesky factorization A = U^H*U or A = L*L^H
* computed by CHAMELEON_zpotrf.
*
*******************************************************************************
......@@ -43,7 +43,7 @@
*
* @param[in,out] A
* On entry, the triangular factor U or L from the Cholesky
* factorization A = U**H*U or A = L*L**H, as computed by
* factorization A = U^H*U or A = L*L^H, as computed by
* CHAMELEON_zpotrf.
* On exit, the upper or lower triangle of the (Hermitian)
* inverse of A, overwriting the input factor U or L.
......@@ -162,7 +162,7 @@ int CHAMELEON_zpotrimm( cham_uplo_t uplo, int N,
*
* CHAMELEON_zpotrimm_Tile - Computes the inverse of a complex Hermitian
* positive definite matrix A using the Cholesky factorization
* A = U**H*U or A = L*L**H computed by CHAMELEON_zpotrf.
* A = U^H*U or A = L*L^H computed by CHAMELEON_zpotrf.
* Tile equivalent of CHAMELEON_zpotrimm().
* Operates on matrices stored by tiles.
* All matrices are passed through descriptors.
......@@ -176,7 +176,7 @@ int CHAMELEON_zpotrimm( cham_uplo_t uplo, int N,
*
* @param[in] A
* On entry, the triangular factor U or L from the Cholesky
* factorization A = U**H*U or A = L*L**H, as computed by
* factorization A = U^H*U or A = L*L^H, as computed by
* CHAMELEON_zpotrf.
* On exit, the upper or lower triangle of the (Hermitian)
* inverse of A, overwriting the input factor U or L.
......@@ -230,8 +230,8 @@ int CHAMELEON_zpotrimm_Tile( cham_uplo_t uplo, CHAM_desc_t *A, CHAM_desc_t *B, C
* @ingroup CHAMELEON_Complex64_t_Tile_Async
*
* CHAMELEON_zpotrimm_Tile_Async - Computes the inverse of a complex Hermitian
* positive definite matrix A using the Cholesky factorization A = U**H*U
* or A = L*L**H computed by CHAMELEON_zpotrf.
* positive definite matrix A using the Cholesky factorization A = U^H*U
* or A = L*L^H computed by CHAMELEON_zpotrf.
* Non-blocking equivalent of CHAMELEON_zpotrimm_Tile().
* May return before the computation is finished.
* Allows for pipelining of operations at runtime.
......
......@@ -31,7 +31,7 @@
*
* CHAMELEON_zpotrs - Solves a system of linear equations A * X = B with a symmetric positive
* definite (or Hermitian positive definite in the complex case) matrix A using the Cholesky
* factorization A = U**H*U or A = L*L**H computed by CHAMELEON_zpotrf.
* factorization A = U^H*U or A = L*L^H computed by CHAMELEON_zpotrf.
*
*******************************************************************************
*
......@@ -46,7 +46,7 @@
* The number of right hand sides, i.e., the number of columns of the matrix B. NRHS >= 0.
*
* @param[in] A
* The triangular factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H,
* The triangular factor U or L from the Cholesky factorization A = U^H*U or A = L*L^H,
* computed by CHAMELEON_zpotrf.
*
* @param[in] LDA
......@@ -173,7 +173,7 @@ int CHAMELEON_zpotrs( cham_uplo_t uplo, int N, int NRHS,
* = ChamLower: Lower triangle of A is stored.
*
* @param[in] A
* The triangular factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H,
* The triangular factor U or L from the Cholesky factorization A = U^H*U or A = L*L^H,
* computed by CHAMELEON_zpotrf.
*
* @param[in,out] B
......
......@@ -62,7 +62,7 @@
* triangular part of the matrix A, and the strictly upper triangular part of A is not
* referenced.
* On exit, if return value = 0, the factor U or L from the Cholesky factorization
* A = U**T*U or A = L*L**T.
* A = U^T*U or A = L*L^T.
*
* @param[in] LDA
* The leading dimension of the array A. LDA >= max(1,N).
......@@ -194,7 +194,7 @@ int CHAMELEON_zsysv( cham_uplo_t uplo, int N, int NRHS,
* triangular part of the matrix A, and the strictly upper triangular part of A is not
* referenced.
* On exit, if return value = 0, the factor U or L from the Cholesky factorization
* A = U**T*U or A = L*L**T.
* A = U^T*U or A = L*L^T.
*
* @param[in,out] B
* On entry, the N-by-NRHS right hand side matrix B.
......
......@@ -50,7 +50,7 @@
* triangular part of the matrix A, and the strictly upper triangular part of A is not
* referenced.
* On exit, if return value = 0, the factor U or L from the Cholesky factorization
* A = U**H*U or A = L*L**H.
* A = U^H*U or A = L*L^H.
*
* @param[in] LDA
* The leading dimension of the array A. LDA >= max(1,N).
......@@ -164,7 +164,7 @@ int CHAMELEON_zsytrf( cham_uplo_t uplo, int N,
* triangular part of the matrix A, and the strictly upper triangular part of A is not
* referenced.
* On exit, if return value = 0, the factor U or L from the Cholesky factorization
* A = U**T*U or A = L*L**T.
* A = U^T*U or A = L*L^T.
*
*******************************************************************************
*
......
......@@ -33,7 +33,7 @@
*
* CHAMELEON_zsytrs - Solves a system of linear equations A * X = B with a complex
* symmetric matrix A using the Cholesky factorization
* A = U**H*U or A = L*L**H computed by CHAMELEON_zsytrf.
* A = U^H*U or A = L*L^H computed by CHAMELEON_zsytrf.
*
*******************************************************************************
*
......@@ -48,7 +48,7 @@
* The number of right hand sides, i.e., the number of columns of the matrix B. NRHS >= 0.
*
* @param[in] A
* The triangular factor U or L from the Cholesky factorization A = U**T*U or A = L*L**T,
* The triangular factor U or L from the Cholesky factorization A = U^T*U or A = L*L^T,
* computed by CHAMELEON_zsytrf.
*
* @param[in] LDA
......@@ -172,7 +172,7 @@ int CHAMELEON_zsytrs( cham_uplo_t uplo, int N, int NRHS,
* = ChamLower: Lower triangle of A is stored.
*
* @param[in] A
* The triangular factor U or L from the Cholesky factorization A = U**T*U or A = L*L**T,
* The triangular factor U or L from the Cholesky factorization A = U^T*U or A = L*L^T,
* computed by CHAMELEON_zsytrf.
*
* @param[in,out] B
......
......@@ -35,7 +35,7 @@
*
* SIDE = 'L' SIDE = 'R'
* TRANS = 'N': Q * C C * Q
* TRANS = 'C': Q**H * C C * Q**H
* TRANS = 'C': Q^H * C C * Q^H
*
* where Q is a complex unitary matrix defined as the product of k
* elementary reflectors
......@@ -49,13 +49,13 @@
*
* @param[in] side
* Intended usage:
* = ChamLeft: apply Q or Q**H from the left;
* = ChamRight: apply Q or Q**H from the right.
* = ChamLeft: apply Q or Q^H from the left;
* = ChamRight: apply Q or Q^H from the right.
*
* @param[in] trans
* Intended usage:
* = ChamNoTrans: no transpose, apply Q;
* = ChamConjTrans: conjugate transpose, apply Q**H.
* = ChamConjTrans: conjugate transpose, apply Q^H.
*
* @param[in] M
* The number of rows of the matrix C. M >= 0.
......@@ -79,7 +79,7 @@
*
* @param[in,out] C
* On entry, the M-by-N matrix C.
* On exit, C is overwritten by Q*C or Q**H*C.
* On exit, C is overwritten by Q*C or Q^H*C.
*
* @param[in] LDC
* The leading dimension of the array C. LDC >= max(1,M).
......@@ -211,14 +211,14 @@ int CHAMELEON_zunmlq( cham_side_t side, cham_trans_t trans, int M, int N, int K,
*
* @param[in] side
* Intended usage:
* = ChamLeft: apply Q or Q**H from the left;
* = ChamRight: apply Q or Q**H from the right.
* = ChamLeft: apply Q or Q^H from the left;
* = ChamRight: apply Q or Q^H from the right.
* Currently only ChamLeft is supported.
*
* @param[in] trans
* Intended usage:
* = ChamNoTrans: no transpose, apply Q;
* = ChamConjTrans: conjugate transpose, apply Q**H.
* = ChamConjTrans: conjugate transpose, apply Q^H.
* Currently only ChamConjTrans is supported.
*
* @param[in] A
......@@ -229,7 +229,7 @@ int CHAMELEON_zunmlq( cham_side_t side, cham_trans_t trans, int M, int N, int K,
*
* @param[in,out] C
* On entry, the M-by-N matrix C.
* On exit, C is overwritten by Q*C or Q**H*C.
* On exit, C is overwritten by Q*C or Q^H*C.
*
*******************************************************************************
*
......
......@@ -29,7 +29,7 @@
*
* SIDE = 'L' SIDE = 'R'
* TRANS = 'N': Q * C C * Q
* TRANS = 'C': Q**H * C C * Q**H
* TRANS = 'C': Q^H * C C * Q^H
*
* where Q is a complex unitary matrix defined as the product of k
* elementary reflectors
......@@ -46,13 +46,13 @@
*
* @param[in] side
* Intended usage:
* = ChamLeft: apply Q or Q**H from the left;
* = ChamRight: apply Q or Q**H from the right.
* = ChamLeft: apply Q or Q^H from the left;
* = ChamRight: apply Q or Q^H from the right.
*
* @param[in] trans
* Intended usage:
* = ChamNoTrans: no transpose, apply Q;
* = ChamConjTrans: conjugate transpose, apply Q**H.
* = ChamConjTrans: conjugate transpose, apply Q^H.
*
* @param[in] M
* The number of rows of the matrix C. M >= 0.
......@@ -79,7 +79,7 @@
*
* @param[in,out] C
* On entry, the M-by-N matrix C.
* On exit, C is overwritten by Q*C or Q**H*C.
* On exit, C is overwritten by Q*C or Q^H*C.
*
* @param[in] LDC
* The leading dimension of the array C. LDC >= max(1,M).
......@@ -210,14 +210,14 @@ int CHAMELEON_zunmlq_param( const libhqr_tree_t *qrtree, cham_side_t side, cham_
*
* @param[in] side
* Intended usage:
* = ChamLeft: apply Q or Q**H from the left;
* = ChamRight: apply Q or Q**H from the right.
* = ChamLeft: apply Q or Q^H from the left;
* = ChamRight: apply Q or Q^H from the right.
* Currently only ChamLeft is supported.
*
* @param[in] trans
* Intended usage:
* = ChamNoTrans: no transpose, apply Q;
* = ChamConjTrans: conjugate transpose, apply Q**H.
* = ChamConjTrans: conjugate transpose, apply Q^H.
* Currently only ChamConjTrans is supported.
*
* @param[in] A
......@@ -228,7 +228,7 @@ int CHAMELEON_zunmlq_param( const libhqr_tree_t *qrtree, cham_side_t side, cham_
*
* @param[in,out] C
* On entry, the M-by-N matrix C.
* On exit, C is overwritten by Q*C or Q**H*C.
* On exit, C is overwritten by Q*C or Q^H*C.
*
*******************************************************************************
*
......
......@@ -34,7 +34,7 @@
*
* SIDE = 'L' SIDE = 'R'
* TRANS = 'N': Q * C C * Q
* TRANS = 'C': Q**H * C C * Q**H
* TRANS = 'C': Q^H * C C * Q^H
*
* where Q is a complex unitary matrix defined as the product of k
* elementary reflectors
......@@ -48,13 +48,13 @@
*
* @param[in] side
* Intended usage:
* = ChamLeft: apply Q or Q**H from the left;
* = ChamRight: apply Q or Q**H from the right.
* = ChamLeft: apply Q or Q^H from the left;
* = ChamRight: apply Q or Q^H from the right.
*
* @param[in] trans
* Intended usage:
* = ChamNoTrans: no transpose, apply Q;
* = ChamConjTrans: conjugate transpose, apply Q**H.
* = ChamConjTrans: conjugate transpose, apply Q^H.
*
* @param[in] M
* The number of rows of the matrix C. M >= 0.
......@@ -81,7 +81,7 @@
*
* @param[in,out] C
* On entry, the M-by-N matrix C.
* On exit, C is overwritten by Q*C or Q**H*C.
* On exit, C is overwritten by Q*C or Q^H*C.
*
* @param[in] LDC
* The leading dimension of the array C. LDC >= max(1,M).
......@@ -212,14 +212,14 @@ int CHAMELEON_zunmqr( cham_side_t side, cham_trans_t trans, int M, int N, int K,
*
* @param[in] side
* Intended usage:
* = ChamLeft: apply Q or Q**H from the left;
* = ChamRight: apply Q or Q**H from the right.
* = ChamLeft: apply Q or Q^H from the left;
* = ChamRight: apply Q or Q^H from the right.
* Currently only ChamLeft is supported.
*
* @param[in] trans
* Intended usage:
* = ChamNoTrans: no transpose, apply Q;
* = ChamConjTrans: conjugate transpose, apply Q**H.
* = ChamConjTrans: conjugate transpose, apply Q^H.
* Currently only ChamConjTrans is supported.
*
* @param[in] A
......@@ -231,7 +231,7 @@ int CHAMELEON_zunmqr( cham_side_t side, cham_trans_t trans, int M, int N, int K,
*
* @param[in,out] C
* On entry, the M-by-N matrix C.
* On exit, C is overwritten by Q*C or Q**H*C.
* On exit, C is overwritten by Q*C or Q^H*C.
*
*******************************************************************************
*
......
......@@ -29,7 +29,7 @@
*
* SIDE = 'L' SIDE = 'R'
* TRANS = 'N': Q * C C * Q
* TRANS = 'C': Q**H * C C * Q**H
* TRANS = 'C': Q^H * C C * Q^H
*
* where Q is a complex unitary matrix defined as the product of k
* elementary reflectors
......@@ -46,13 +46,13 @@
*
* @param[in] side
* Intended usage:
* = ChamLeft: apply Q or Q**H from the left;
* = ChamRight: apply Q or Q**H from the right.
* = ChamLeft: apply Q or Q^H from the left;
* = ChamRight: apply Q or Q^H from the right.
*
* @param[in] trans
* Intended usage:
* = ChamNoTrans: no transpose, apply Q;
* = ChamConjTrans: conjugate transpose, apply Q**H.
* = ChamConjTrans: conjugate transpose, apply Q^H.
*
* @param[in] M
* The number of rows of the matrix C. M >= 0.
......@@ -82,7 +82,7 @@
*
* @param[in,out] C
* On entry, the M-by-N matrix C.
* On exit, C is overwritten by Q*C or Q**H*C.
* On exit, C is overwritten by Q*C or Q^H*C.
*
* @param[in] LDC
* The leading dimension of the array C. LDC >= max(1,M).
......@@ -215,14 +215,14 @@ int CHAMELEON_zunmqr_param( const libhqr_tree_t *qrtree,
*
* @param[in] side
* Intended usage:
* = ChamLeft: apply Q or Q**H from the left;
* = ChamRight: apply Q or Q**H from the right.
* = ChamLeft: apply Q or Q^H from the left;
* = ChamRight: apply Q or Q^H from the right.
* Currently only ChamLeft is supported.
*
* @param[in] trans
* Intended usage:
* = ChamNoTrans: no transpose, apply Q;
* = ChamConjTrans: conjugate transpose, apply Q**H.
* = ChamConjTrans: conjugate transpose, apply Q^H.
* Currently only ChamConjTrans is supported.
*
* @param[in] A
......@@ -234,7 +234,7 @@ int CHAMELEON_zunmqr_param( const libhqr_tree_t *qrtree,
*
* @param[in,out] C
* On entry, the M-by-N matrix C.
* On exit, C is overwritten by Q*C or Q**H*C.
* On exit, C is overwritten by Q*C or Q^H*C.
*
*******************************************************************************