sparsity_example.cpp File Reference

#include "Stokhos_Epetra.hpp"
#include "Teuchos_CommandLineProcessor.hpp"
#include "Epetra_SerialComm.h"
#include "Ifpack_RCMReordering.h"
#include <fstream>
#include <iostream>

Include dependency graph for sparsity_example.cpp:

Go to the source code of this file.

Enumerations
enum	BasisType {   HERMITE, LEGENDRE, CC_LEGENDRE, GP_LEGENDRE,   RYS, JACOBI, HERMITE, LEGENDRE,   CC_LEGENDRE, GP_LEGENDRE, RYS, JACOBI,   HERMITE, LEGENDRE, CC_LEGENDRE, GP_LEGENDRE,   RYS, JACOBI, HERMITE, LEGENDRE,   RYS, HERMITE, LEGENDRE, CC_LEGENDRE,   GP_LEGENDRE, RYS, JACOBI }
enum	ProductBasisType {   COMPLETE, TENSOR, TOTAL, SMOLYAK,   COMPLETE, TENSOR, TOTAL, SMOLYAK,   COMPLETE, TENSOR, TOTAL, SMOLYAK,   COMPLETE, TENSOR, TOTAL, SMOLYAK,   COMPLETE, TENSOR, TOTAL, SMOLYAK,   COMPLETE, TENSOR, TOTAL, SMOLYAK,   COMPLETE, TENSOR, TOTAL, SMOLYAK,   COMPLETE, TENSOR, TOTAL, SMOLYAK,   COMPLETE, TENSOR, TOTAL, SMOLYAK }
enum	OrderingType {   TOTAL_ORDERING, LEXICOGRAPHIC_ORDERING, TOTAL_ORDERING, LEXICOGRAPHIC_ORDERING,   TOTAL_ORDERING, LEXICOGRAPHIC_ORDERING, TOTAL_ORDERING, LEXICOGRAPHIC_ORDERING,   TOTAL_ORDERING, LEXICOGRAPHIC_ORDERING, TOTAL_ORDERING, LEXICOGRAPHIC_ORDERING,   TOTAL_ORDERING, LEXICOGRAPHIC_ORDERING, MORTON_Z_ORDERING, TOTAL_ORDERING,   LEXICOGRAPHIC_ORDERING, MORTON_Z_ORDERING }

Functions
int	main (int argc, char **argv)

Variables
const int	num_basis_types = 6
const BasisType	basis_type_values []
const char *	basis_type_names []
const int	num_growth_types = 2
const Stokhos::GrowthPolicy	growth_type_values []
const char *	growth_type_names [] = { "slow", "moderate" }
const int	num_prod_basis_types = 4
const ProductBasisType	prod_basis_type_values []
const char *	prod_basis_type_names []
const int	num_ordering_types = 3
const OrderingType	ordering_type_values []
const char *	ordering_type_names []

Enumeration Type Documentation

enum BasisType

Enumerator
HERMITE
LEGENDRE
CC_LEGENDRE
GP_LEGENDRE
RYS
JACOBI
HERMITE
LEGENDRE
CC_LEGENDRE
GP_LEGENDRE
RYS
JACOBI
HERMITE
LEGENDRE
CC_LEGENDRE
GP_LEGENDRE
RYS
JACOBI
HERMITE
LEGENDRE
RYS
HERMITE
LEGENDRE
CC_LEGENDRE
GP_LEGENDRE
RYS
JACOBI

Definition at line 71 of file sparsity_example.cpp.

enum ProductBasisType

Enumerator
COMPLETE
TENSOR
TOTAL
SMOLYAK
COMPLETE
TENSOR
TOTAL
SMOLYAK
COMPLETE
TENSOR
TOTAL
SMOLYAK
COMPLETE
TENSOR
TOTAL
SMOLYAK
COMPLETE
TENSOR
TOTAL
SMOLYAK
COMPLETE
TENSOR
TOTAL
SMOLYAK
COMPLETE
TENSOR
TOTAL
SMOLYAK
COMPLETE
TENSOR
TOTAL
SMOLYAK
COMPLETE
TENSOR
TOTAL
SMOLYAK

Definition at line 85 of file sparsity_example.cpp.

enum OrderingType

Enumerator
TOTAL_ORDERING
LEXICOGRAPHIC_ORDERING
TOTAL_ORDERING
LEXICOGRAPHIC_ORDERING
TOTAL_ORDERING
LEXICOGRAPHIC_ORDERING
TOTAL_ORDERING
LEXICOGRAPHIC_ORDERING
TOTAL_ORDERING
LEXICOGRAPHIC_ORDERING
TOTAL_ORDERING
LEXICOGRAPHIC_ORDERING
TOTAL_ORDERING
LEXICOGRAPHIC_ORDERING
MORTON_Z_ORDERING
TOTAL_ORDERING
LEXICOGRAPHIC_ORDERING
MORTON_Z_ORDERING

Definition at line 93 of file sparsity_example.cpp.

Function Documentation

int main	(	int	argc,
		char **	argv
	)

Definition at line 100 of file sparsity_example.cpp.

Variable Documentation

const int num_basis_types = 6

Definition at line 72 of file sparsity_example.cpp.

const BasisType basis_type_values[]

Initial value:

= {
  HERMITE, LEGENDRE, CC_LEGENDRE, GP_LEGENDRE, RYS, JACOBI }

Definition at line 73 of file sparsity_example.cpp.

const char* basis_type_names[]

Initial value:

= {
  "hermite", "legendre", "clenshaw-curtis", "gauss-patterson", "rys", "jacobi" }

Definition at line 75 of file sparsity_example.cpp.

const int num_growth_types = 2

Definition at line 79 of file sparsity_example.cpp.

const Stokhos::GrowthPolicy growth_type_values[]

Initial value:

= {
  Stokhos::SLOW_GROWTH, Stokhos::MODERATE_GROWTH }

Definition at line 80 of file sparsity_example.cpp.

const char* growth_type_names[] = { "slow", "moderate" }

Definition at line 82 of file sparsity_example.cpp.

const int num_prod_basis_types = 4

Definition at line 86 of file sparsity_example.cpp.

const ProductBasisType prod_basis_type_values[]

Initial value:

= {
  COMPLETE, TENSOR, TOTAL, SMOLYAK }

Definition at line 87 of file sparsity_example.cpp.

const char* prod_basis_type_names[]

Initial value:

= {
  "complete", "tensor", "total", "smolyak" }

Definition at line 89 of file sparsity_example.cpp.

const int num_ordering_types = 3

Definition at line 94 of file sparsity_example.cpp.

const OrderingType ordering_type_values[]

Initial value:

= {
  TOTAL_ORDERING, LEXICOGRAPHIC_ORDERING, MORTON_Z_ORDERING }

Definition at line 95 of file sparsity_example.cpp.

const char* ordering_type_names[]

Initial value:

= {
  "total", "lexicographic", "morton-z" }

Definition at line 97 of file sparsity_example.cpp.