Algorithms for computing greedy sequences. More...

#include "tsgEnumerates.hpp"

Include dependency graph for tsgSequenceOptimizer.hpp:

This graph shows which files directly or indirectly include this file:

Classes
struct	TasGrid::Optimizer::OptimizerResult
	Simple pair of numbers for the node and the value of the functional at the node. More...

Namespaces
	TasGrid
	Encapsulates the Tasmanian Sparse Grid module.

Functions
template<TypeOneDRule rule>
double	TasGrid::Optimizer::getNextNode (std::vector< double > const &nodes)
	For the given rule and set of nodes, compute the next node using the greedy procedure.

std::vector< double >	TasGrid::Optimizer::getPrecomputedMinLebesgueNodes ()
	Get the hard-coded pre-computed nodes. More...

std::vector< double >	TasGrid::Optimizer::getPrecomputedMinDeltaNodes ()
	Get the hard-coded pre-computed nodes. More...

template<TypeOneDRule rule>
std::vector< double >	TasGrid::Optimizer::getGreedyNodes (int n)
	Get n nodes for the given sequence rule, either compute or use pre-computed.

Detailed Description

Algorithms for computing greedy sequences.

Classes