Definition in file APPSPACK_LAPACK_Wrappers.hpp.
#include "APPSPACK_Common.hpp"
Include dependency graph for APPSPACK_LAPACK_Wrappers.hpp:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Namespaces  
namespace  APPSPACK 
Defines  
#define  DGELQF_F77 F77_FUNC(dgelqf,DGELQF) 
Name of LAPACK dqelfq function.  
#define  DGGLSE_F77 F77_FUNC(dgglse,DGGLSE) 
Name of LAPACK dgglse function.  
#define  DGESVD_F77 F77_FUNC(dgesvd,DGESVD) 
Name of LAPACK dgesvd function.  
#define  DGEMM_F77 F77_FUNC(dgemm,DGEMM) 
Name of LAPACK dgemm function.  
#define  DGEMM_F77 F77_FUNC(dgemm,DGEMM) 
Name of LAPACK dgemm function.  
#define  DGEMV_F77 F77_FUNC(dgemv,DGEMV) 
Name of BLAS dgemm function.  
#define  DDOT_F77 F77_FUNC(ddot,DDOT) 
Name of BLAS ddot function.  
Functions  
void  DGELQF_F77 (int *M, int *N, double A[], int *LDA, double TAU[], double WORK[], int *LWORK, int *INFO) 
DGELQF computes an LQ factorization of a real MbyN matrix A: A = L * Q.  
void  DGGLSE_F77 (int *M, int *N, int *P, double B[], int *LDB, double A[], int *LDA, double C[], double D[], double X[], double WORK[], int *LWORK, int *INFO) 
Solves the linear equalityconstrained least squares problem min  c  Ax  subject to Bx = d.  
void  DGESVD_F77 (char *JOBU, char *JOBVT, int *M, int *N, double A[], int *LDA, double S[], double U[], int *LDU, double VT[], int *LDVT, double WORK[], int *LWORK, int *INFO) 
DGESVD computes the singular value decomposition (SVD) of a real MbyN matrix A, optionally computing the left and/or right singular vectors. The SVD is written
where is an MbyN matrix which is zero except for its min(m,n) diagonal elements, U is an MbyM orthogonal matrix, and V is an NbyN orthogonal matrix. The diagonal elements of are the singular values of A; they are real and nonnegative, and are returned in descending order. The first min(m,n) columns of U and V are the left and right singular vectors of A.  
void  DGEMM_F77 (char *TRANSA, char *TRANSB, int *M, int *N, int *K, double *ALPHA, double A[], int *LDA, double B[], int *LDB, double *BETA, double C[], int *LDC) 
DGEMM performs one of the matrixmatrix operations
where is one of or , and and are scalars, and , and are matrices, with an matrix, a matrix and an matrix.  
void  DGEMV_F77 (char *TRANS, int *M, int *N, double *ALPHA, double A[], int *LDA, double X[], int *INCX, double *BETA, double Y[], int *INCY) 
DGEMV performs one of the matrixvector operations
 
double  DDOT_F77 (int *n, double dx[], int *incx, double dy[], int *incy) 
Forms the dot product of two vectors. Uses unrolled loops for increments equal to one. 

Name of LAPACK dqelfq function.
Definition at line 48 of file APPSPACK_LAPACK_Wrappers.hpp. 

Name of LAPACK dgglse function.
Definition at line 51 of file APPSPACK_LAPACK_Wrappers.hpp. 

Name of LAPACK dgesvd function.
Definition at line 54 of file APPSPACK_LAPACK_Wrappers.hpp. 

Name of LAPACK dgemm function.
Definition at line 60 of file APPSPACK_LAPACK_Wrappers.hpp. 

Name of LAPACK dgemm function.
Definition at line 60 of file APPSPACK_LAPACK_Wrappers.hpp. 

Name of BLAS dgemm function.
Definition at line 63 of file APPSPACK_LAPACK_Wrappers.hpp. 

Name of BLAS ddot function.
Definition at line 66 of file APPSPACK_LAPACK_Wrappers.hpp. 

DGELQF computes an LQ factorization of a real MbyN matrix A: A = L * Q.
The matrix Q is represented as a product of elementary reflectors Q = H(k) . . . H(2) H(1), where k = min(m,n). Each H(i) has the form H(i) = I  tau * v * v' where tau is a real scalar, and v is a real vector with v(1:i1) = 0 and v(i) = 1; v(i+1:n) is stored on exit in A(i,i+1:n), and tau in TAU(i). Referenced by APPSPACK::Matrix::pruneDependentRows(). 

Solves the linear equalityconstrained least squares problem min  c  Ax  subject to Bx = d. DGGLSE solves the linear equalityconstrained least squares (LSE) problem:
where A is an MbyN matrix, B is a PbyN matrix, c is a given Mvector, and d is a given Pvector. It is assumed that P <= N <= M+P, and
These conditions ensure that the LSE problem has a unique solution, which is obtained using a GRQ factorization of the matrices B and A.
Referenced by APPSPACK::Matrix::constrainedLSQR(). 

DGESVD computes the singular value decomposition (SVD) of a real MbyN matrix A, optionally computing the left and/or right singular vectors. The SVD is written
where is an MbyN matrix which is zero except for its min(m,n) diagonal elements, U is an MbyM orthogonal matrix, and V is an NbyN orthogonal matrix. The diagonal elements of are the singular values of A; they are real and nonnegative, and 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 , not .
Referenced by APPSPACK::Matrix::svd(). 

DGEMM performs one of the matrixmatrix operations
where is one of or , and and are scalars, and , and are matrices, with an matrix, a matrix and an matrix.
Referenced by APPSPACK::Matrix::multMatWithBlas(). 

DGEMV performs one of the matrixvector operations
where and are scalars, and are vectors and is an by matrix.
 Written on 22October1986.
Referenced by APPSPACK::Matrix::multVecWithBlas(). 

Forms the dot product of two vectors. Uses unrolled loops for increments equal to one.
Referenced by APPSPACK::Vector::dot(). 
© Sandia Corporation  Site Contact  Privacy and Security
Generated on Fri Feb 16 10:33:35 2007 for APPSPACK 5.0.1 by 1.3.9.1 written by Dimitri van Heesch, © 19972002