High dimensional numerical problems

DOI10.1016/S0362-546X(96)00134-4zbMath0890.65052OpenAlexW2027338456MaRDI QIDQ4377209

Erich Novak

Publication date: 14 July 1998

Published in: Nonlinear Analysis: Theory, Methods & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0362-546x(96)00134-4

zbMATH Keywords

global optimizationintegrationBoolean methodsinformation based complexityhigh-dimensional numerical problemssparse grid methodsdiscrete blending methodshyperbolic cross point methodsSmolyak formulas

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05)

Related Items (1)

A Sparse Interpolation Algorithm for Dynamical Simulations in Computational Chemistry

Uses Software

• TESTPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to increase the order to get minimal-error algorithms for systems of ODE
• On sequential and parallel solution of initial value problems
• Remarks on algorithm 006: An adaptive algorithm for numerical integration over an N-dimensional rectangular region
• Variational properties of averaged equations for periodic media
• Average case complexity of linear multivariate problems. II: Applications
• Deterministic and stochastic error bounds in numerical analysis
• An adaptive algorithm for numerical integration over an \(n\)-dimensional cube
• Tractability and strong tractability of linear multivariate problems
• Explicit cost bounds of algorithms for multivariate tensor product problems
• High dimensional integration of smooth functions over cubes
• On the power of adaption
• On tractability of path integration

This page was built for publication: High dimensional numerical problems