Smolyak cubature of given polynomial degree with few nodes for increasing dimension (Q1865745)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Smolyak cubature of given polynomial degree with few nodes for increasing dimension |
scientific article |
Statements
Smolyak cubature of given polynomial degree with few nodes for increasing dimension (English)
0 references
27 March 2003
0 references
This paper deals with the Smolyak algorithm, a procedure that derives numerical cubature methods for tensor product problems from quadrature rules. The number of nodes grow fast for increasing dimensions. It is investigated how to obtain Smolyak cubature formulae with a given degree of polynomial exactness and the asymptotically minimal number of nodes for increasing dimension. A characterization for a subset of Smolyak formulae is given. Error bounds and numerical examples show their behaviour for smooth integrands. A modification is applied to problems of mathematical finance as indicated by a further numerical example.
0 references
Smolyak cubature
0 references
cubature formulae
0 references
tensor product problems
0 references
minimal number of nodes
0 references
degree of polynomial exactness
0 references
error bounds
0 references
numerical examples
0 references
mathematical finance
0 references
