Go to the source code of this file.
|
enum | Quadrature_Method { TENSOR,
SPARSE
} |
|
enum | Reduced_Basis_Method {
LANCZOS,
MONOMIAL_PROJ_GS,
MONOMIAL_PROJ_GS2,
MONOMIAL_GS,
LANCZOS_GS
} |
|
enum | Orthogonalization_Method {
HOUSEHOLDER,
HOUSEHOLDER_NP,
CGS,
MGS,
MGSRO,
MGSNP,
MGSNPRO,
SVD
} |
|
enum | Quadrature_Reduction_Method { NONE,
QSQUARED,
QSQUARED2,
Q2
} |
|
enum | Solver_Method {
TRSM,
GLPK,
CLP,
CLP_IP,
QPOASES,
BASIS_PURSUIT,
ORTHOGONAL_MATCHING_PURSUIT
} |
|
|
template<class ScalarType > |
ScalarType | f (const Teuchos::Array< ScalarType > &x, double a, double b) |
|
template<class ScalarType > |
ScalarType | g (const Teuchos::Array< ScalarType > &x, const ScalarType &y) |
|
double | coeff_error (const pce_type &z, const pce_type &z2) |
|
double | disc_orthog_error (const Stokhos::OrthogPolyBasis< int, double > &basis, const Stokhos::Quadrature< int, double > &quad) |
|
void | compute_pces (bool compute_z_red, int p, const MyOptions &options, MyResults &results) |
|
int | main (int argc, char **argv) |
|
Enumerator |
---|
TRSM |
|
GLPK |
|
CLP |
|
CLP_IP |
|
QPOASES |
|
BASIS_PURSUIT |
|
ORTHOGONAL_MATCHING_PURSUIT |
|
Definition at line 87 of file gram_schmidt_example3.cpp.
template<class ScalarType >
template<class ScalarType >
ScalarType g |
( |
const Teuchos::Array< ScalarType > & |
x, |
|
|
const ScalarType & |
y |
|
) |
| |
|
inline |
void compute_pces |
( |
bool |
compute_z_red, |
|
|
int |
p, |
|
|
const MyOptions & |
options, |
|
|
MyResults & |
results |
|
) |
| |
int main |
( |
int |
argc, |
|
|
char ** |
argv |
|
) |
| |
const int num_quadrature_method = 2 |
|
static |
const char* quadrature_method_names[] |
|
static |
const int num_reduced_basis_method = 5 |
|
static |
const char* reduced_basis_method_names[] |
|
static |
Initial value:= {
"Lanczos", "Monomial-Proj-GS", "Monomial-Proj-GS2", "Monomial-GS", "Lanczos-GS" }
Definition at line 67 of file gram_schmidt_example3.cpp.
const int num_orthogonalization_method = 8 |
|
static |
const char* orthogonalization_method_names[] |
|
static |
Initial value:= {
"Householder", "Householder without Pivoting", "Classical Gram-Schmidt", "Modified Gram-Schmidt", "Modified Gram-Schmidt with Reorthogonalization", "Modified Gram-Schmidt without Pivoting", "Modified Gram-Schmidt without Pivoting with Reorthogonalization", "SVD" }
Definition at line 75 of file gram_schmidt_example3.cpp.
const int num_quad_reduction_method = 4 |
|
static |
const char* quad_reduction_method_names[] |
|
static |
const int num_solver_method = 7 |
|
static |
const char* solver_method_names[] |
|
static |
Initial value:= {
"TRSM", "GLPK", "Clp", "Clp-IP", "qpOASES", "Basis Pursuit", "Orthogonal Matching Pursuit" }
Definition at line 91 of file gram_schmidt_example3.cpp.