
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.
minimal number of nodes, mathematical finance, Smolyak cubature, tensor product problems, numerical examples, Numerical methods (including Monte Carlo methods), degree of polynomial exactness, Multidimensional problems, error bounds, Numerical quadrature and cubature formulas, cubature formulae
minimal number of nodes, mathematical finance, Smolyak cubature, tensor product problems, numerical examples, Numerical methods (including Monte Carlo methods), degree of polynomial exactness, Multidimensional problems, error bounds, Numerical quadrature and cubature formulas, cubature formulae
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 81 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
