Numerical methods for higher dimensional problems and the curse of the dimension.
zbMath0958.65150MaRDI QIDQ1818934
Publication date: 5 January 2000
Published in: Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)
computational complexitynumerical integrationintegral equationspolynomial algorithmshigh-dimensional problems
Analysis of algorithms and problem complexity (68Q25) Monte Carlo methods (65C05) Multidimensional problems (41A63) Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity and performance of numerical algorithms (65Y20) Irregularities of distribution, discrepancy (11K38)
This page was built for publication: Numerical methods for higher dimensional problems and the curse of the dimension.