mirror of
https://github.com/triqs/dft_tools
synced 2024-10-31 19:23:45 +01:00
161 lines
6.4 KiB
C++
161 lines
6.4 KiB
C++
/*******************************************************************************
|
|
*
|
|
* TRIQS: a Toolbox for Research in Interacting Quantum Systems
|
|
*
|
|
* Copyright (C) 2011 by M. Ferrero, O. Parcollet
|
|
*
|
|
* TRIQS is free software: you can redistribute it and/or modify it under the
|
|
* terms of the GNU General Public License as published by the Free Software
|
|
* Foundation, either version 3 of the License, or (at your option) any later
|
|
* version.
|
|
*
|
|
* TRIQS is distributed in the hope that it will be useful, but WITHOUT ANY
|
|
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
|
|
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
|
|
* details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License along with
|
|
* TRIQS. If not, see <http://www.gnu.org/licenses/>.
|
|
*
|
|
******************************************************************************/
|
|
#ifndef TRIQS_ARRAYS_BLAS_HEADER_H
|
|
#define TRIQS_ARRAYS_BLAS_HEADER_H
|
|
|
|
// UNUNSED : just here to keep the old bindings
|
|
|
|
/*
|
|
|
|
// Declaration of the lapack routines.
|
|
extern "C"
|
|
{
|
|
void TRIQS_FORTRAN_MANGLING(dgetrf) (int &,int &,double[], int & ,int [],int &);
|
|
void TRIQS_FORTRAN_MANGLING(dgetri) (int & , double [], int & ,int [],double [],int & ,int & );
|
|
void TRIQS_FORTRAN_MANGLING(dgetrs) (char *,int & , int & , double [], int & ,int [],double [],int & ,int & );
|
|
|
|
void TRIQS_FORTRAN_MANGLING(zgetrf) (int &,int &,std::complex<double>[], int & ,int [],int &);
|
|
void TRIQS_FORTRAN_MANGLING(zgetri) (int & , std::complex<double> [], int & ,int [],std::complex<double> [],int & ,int & );
|
|
void TRIQS_FORTRAN_MANGLING(zgetrs) (char *,int & , int & , std::complex<double> [], int & ,int [],std::complex<double> [],int & ,int & );
|
|
// C <- alpha AB + beta C
|
|
void TRIQS_FORTRAN_MANGLING(dgemm) (char *, char *, //TRANSA, TRANSB
|
|
int & , //
|
|
int & , //
|
|
int & , //
|
|
double &, //ALPHA,
|
|
const double[], // A,
|
|
int &, // LDA
|
|
const double[], // B
|
|
int &, // LDB,
|
|
double &, // BETA,
|
|
double[], // C
|
|
int & // LDC
|
|
);
|
|
|
|
void TRIQS_FORTRAN_MANGLING(zgemm) (char *, char *, //TRANSA, TRANSB
|
|
int & , //
|
|
int & , //
|
|
int & , //
|
|
std::complex<double> &, //ALPHA,
|
|
const std::complex<double>[], // A,
|
|
int &, // LDA
|
|
const std::complex<double>[], // B
|
|
int &, // LDB,
|
|
std::complex<double> &, // BETA,
|
|
std::complex<double>[], // C
|
|
int & // LDC
|
|
);
|
|
|
|
void TRIQS_FORTRAN_MANGLING(dgemv)(const char* trans, const int & m, const int & n, const double & alpha, const double A[], int & lda,
|
|
const double x[], const int & incx, const double & beta, double y[], const int & incy);
|
|
|
|
void TRIQS_FORTRAN_MANGLING(zgemv)(const char* trans, const int & m, const int & n, const std::complex<double> & alpha, const std::complex<double> A[], int & lda,
|
|
const std::complex<double> x[], const int & incx, const std::complex<double> & beta, std::complex<double> y[], const int & incy);
|
|
|
|
void TRIQS_FORTRAN_MANGLING(zhseqr)( char *,char*, //JOB, COMPZ
|
|
int &, // N
|
|
int &, //ILO
|
|
int &,// IHI
|
|
std::complex<double>[], // H
|
|
int &, // LDH
|
|
std::complex<double>[], //W
|
|
std::complex<double>[], //Z
|
|
int &, // LDZ
|
|
std::complex<double>[], //WORK
|
|
int &, // LWORK
|
|
int & // INFO
|
|
);
|
|
|
|
void TRIQS_FORTRAN_MANGLING(dsyev)(char*,char*, // JOBZ and UPLO
|
|
int &, // Matrix Size
|
|
double[], // matrix
|
|
int&, // LDA of the matrix
|
|
double[], // Eigenvalues array
|
|
double[], // WORK
|
|
int&, // LWORK
|
|
int & // INFO
|
|
);
|
|
|
|
|
|
void TRIQS_FORTRAN_MANGLING(zheev)(char*,char*, // JOBZ and UPLO
|
|
int &, // Matrix Size
|
|
std::complex<double> [], // matrix
|
|
int&, // LDA of the matrix
|
|
double[], // Eigenvalues array
|
|
std::complex<double>[], // WORK
|
|
int &, // LWORK
|
|
double[], // WORK2
|
|
int & // INFO
|
|
);
|
|
|
|
void TRIQS_FORTRAN_MANGLING(zgeev)(char*,char*, // JOBVL, JOBVR
|
|
int &, // Matrix Size
|
|
std::complex<double> [], // matrix
|
|
int&, // LDA of the matrix
|
|
std::complex<double>[], // Eigenvalues array
|
|
std::complex<double>[], // VL
|
|
int &, //LDVL
|
|
std::complex<double>[], // VR
|
|
int &, //LDVR
|
|
std::complex<double>[], // WORK
|
|
int &, // LWORK
|
|
double[], // RWORK
|
|
int & // INFO
|
|
);
|
|
|
|
|
|
void TRIQS_FORTRAN_MANGLING(zgesdd)(char*, // JOBZ
|
|
int &, // M
|
|
int &, // N
|
|
std::complex<double> [], // matrix
|
|
int&, // LDA of the matrix
|
|
double[], // Singular values array
|
|
std::complex<double>[], // U
|
|
int &, //LDU
|
|
std::complex<double>[], // VT
|
|
int &, //LDVT
|
|
std::complex<double>[], // WORK
|
|
int &, // LWORK
|
|
double[], // RWORK
|
|
int [], //IWORK
|
|
int & // INFO
|
|
);
|
|
|
|
double TRIQS_FORTRAN_MANGLING(dswap)(const int & N , double x[], const int& incx, double y[], const int& incy);
|
|
double TRIQS_FORTRAN_MANGLING(dcopy)(const int & N , double x[], const int& incx, double y[], const int& incy);
|
|
double TRIQS_FORTRAN_MANGLING(dscal)(const int & N , double & alpha,double x[], const int& incx);
|
|
|
|
|
|
double TRIQS_FORTRAN_MANGLING(ddot)(const int & N, double x[], const int& incx, double y[], const int & incy);
|
|
double TRIQS_FORTRAN_MANGLING(zdot)(const int & N, std::complex<double> x[], const int& incx, std::complex<double> y[], const int& incy);
|
|
|
|
void TRIQS_FORTRAN_MANGLING(dtrmv)(const char & UPLO, const char & TRANS, const char & DIAG,
|
|
int & N, double A[], int & LDA, double X[], int & INCX);
|
|
void TRIQS_FORTRAN_MANGLING(dgemv)(const char* trans, const int & m, const int & n, const double & alpha, const double A[], int & lda,
|
|
const double x[], const int & incx, const double & beta, double y[], const int & incy);
|
|
void TRIQS_FORTRAN_MANGLING(dger)(const int &, const int &, const double &, double [], const int &, double [], const int &, double [], const int &);
|
|
}
|
|
*/
|
|
|
|
|
|
#endif
|
|
|