Information-based complexity
The computational complexity of differential and integral equations: an information-based approach
The computational complexity of differential and integral equations: an information-based approach
Tractability and strong tractability of linear multivariate problems
Journal of Complexity
When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
Journal of Complexity
Complexity and information
Finite-order weights imply tractability of multivariate integration
Journal of Complexity
Finite-order weights imply tractability of linear multivariate problems
Journal of Approximation Theory
Foundations of Computational Mathematics
Good Lattice Rules in Weighted Korobov Spaces with General Weights
Numerische Mathematik
Note: A note on the complexity and tractability of the heat equation
Journal of Complexity
Hi-index | 0.00 |
The tractability of multivariate problems has usually been studied only for the approximation of linear operators. In this paper we study the tractability of quasilinear multivariate problems. That is, we wish to approximate nonlinear operators S"d(.,.) that depend linearly on the first argument and satisfy a Lipschitz condition with respect to both arguments. Here, both arguments are functions of d variables. Many computational problems of practical importance have this form. Examples include the solution of specific Dirichlet, Neumann, and Schrodinger problems. We show, under appropriate assumptions, that quasilinear problems, whose domain spaces are equipped with product or finite-order weights, are tractable or strongly tractable in the worst case setting. This paper is the first part in a series of papers. Here, we present tractability results for quasilinear problems under general assumptions on quasilinear operators and weights. In future papers, we shall verify these assumptions for quasilinear problems such as the solution of specific Dirichlet, Neumann, and Schrodinger problems.