dfulluppermatrix_functions.h

Go to the documentation of this file.

#ifndef DFULLUPPERMATRIX_FUNCTIONS
#define DFULLUPPERMATRIX_FUNCTIONS

#include "lapack_functions.h"

void DoubleFullUpperMatrixVectorProduct( const tBoolean& isTransA,
                                         const tLVectorIndex& nRowsA,//number of viewed rows of A
                                         const tLVectorIndex& ldA,//memory distance between A[i][j] and A[i][j+1]
                                         const double* A,
                                         const tLVectorIndex& nX,
                                         const tLVectorIncrement& incX,
                                         double* x) ;
void DoubleFullUpperMatrixMatrixProduct(const tBoolean& isLeft,
                                        const tBoolean& isTransA,
                                        const tLVectorIndex& ldA,//memory distance between A[i][j] and A[i][j+1]
                                        const double* A,
                                        const double& alpha,
                                        const tLVectorIndex& nRowsB,const tLVectorIndex& nColsB,const tLVectorIndex& ldB,
                                        double* B);
void DoubleFullUpperMatrixVectorSolve( const tBoolean &isTransA,
                                       const tLVectorIndex& nARows,
                                       const tLVectorIndex& ldA,//memory distance between A[i][j] and A[i][j+1]
                                       const double *A,//upper matrix
                                       const tLVectorIndex& nB,//number of viewed element of B
                                       const tLVectorIncrement& incB,//memory distance between B[i] and B[i+1]
                                       double* B);
/* SOLVE op(A).X=alpha.B B:=X or
 * SOLVE X.op(A)=alpha B B:=X
 */
tBoolean DoubleFullUpperMatrixSolve( const tBoolean &isLeft,const tBoolean& isTransA,
                                     const tLVectorIndex& ldA,//memory distance between A[i][j] and A[i][j+1]
                                     const double *A,//upper matrix
                                     const double &alpha,
                                     const tLVectorIndex& nBRows,//number of viewed rows of B
                                     const tLVectorIndex& nBCols,//number of viewed columns of B
                                     const tLVectorIndex& ldB,//memory distance between B[i][j] and B[i][j+1]
                                     double* B);

bool DoubleFullUpperMatrixInverse( const tLVectorIndex& nRowsA,//number of viewed rows of A
                                   const tLVectorIndex& ldA,//memory distance between A[i][j] and A[i][j+1]
                                   double* A);


bool DoubleFullUpperMatrixEigenVector(const lapack_int & nRowsT,const lapack_int& ldT,const double *T,
                                      const lapack_int& ldlev,double *lev,
                                      const lapack_int& ldrev,double *rev);

#endif