sparse_grid_total_poly_test

sparse_grid_total_poly_test, an Octave code which calls sparse_grid_total_poly(), which investigates the limits of total polynomial approximation using sparse grids.

Licensing:

The information on this web page is distributed under the MIT license.

Related Data and Programs:

sparse_grid_total_poly, an Octave code which investigates the efficient approximation of all polynomials up to a given total degree using sparse grids.

Source Code:

• sparse_grid_total_poly_test.m calls all the tests.
• sparse_grid_total_poly_test.sh runs all the tests.
• sparse_grid_total_poly_test.txt the output file.

• point_quality_test.m computes the point quality for quadrature rules.
• rule_test.m tests a rule simply by printing out some examples of it.
• rules_test.m calls RULE_TEST for each of the rules.
• weight_quality_test.m computes the weight quality for quadrature rules.