Hardcover ISBN:  9783037190845 
Product Code:  EMSTM/12 
List Price:  $128.00 
AMS Member Price:  $102.40 
Hardcover ISBN:  9783037190845 
Product Code:  EMSTM/12 
List Price:  $128.00 
AMS Member Price:  $102.40 

Book DetailsEMS Tracts in MathematicsVolume: 12; 2010; 675 ppMSC: Primary 65; 68; 41; 46; 28; 11;
This is the second volume of a threevolume set comprising a comprehensive study of the tractability of multivariate problems. The second volume deals with algorithms using standard information consisting of function values for the approximation of linear and selected nonlinear functionals. An important example is numerical multivariate integration.
The proof techniques used in volumes I and II are quite different. It is especially hard to establish meaningful lower error bounds for the approximation of functionals by using finitely many function values. Here, the concept of decomposable reproducing kernels is helpful, allowing it to find matching lower and upper error bounds for some linear functionals. It is then possible to conclude tractability results from such error bounds.
Tractability results, even for linear functionals, are very rich in variety. There are infinitedimensional Hilbert spaces for which the approximation with an arbitrarily small error of all linear functionals requires only one function value. There are Hilbert spaces for which all nontrivial linear functionals suffer from the curse of dimensionality. This holds for unweighted spaces, where the role of all variables and groups of variables is the same. For weighted spaces one can monitor the role of all variables and groups of variables. Necessary and sufficient conditions on the decay of the weights are given to obtain various notions of tractability.
The text contains extensive chapters on discrepancy and integration, decomposable kernels and lower bounds, the Smolyak/sparse grid algorithms, lattice rules and the CBC (componentbycomponent) algorithms. This is done in various settings. Path integration and quantum computation are also discussed.
This volume is of interest to researchers working in computational mathematics, especially in approximation of highdimensional problems. It is also well suited for graduate courses and seminars. There are 61 open problems listed to stimulate future research in tractability.
A publication of the European Mathematical Society (EMS). Distributed within the Americas by the American Mathematical Society.
ReadershipGraduate students and research mathematicians interested in computational mathematics.

RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
 Book Details
 Requests
This is the second volume of a threevolume set comprising a comprehensive study of the tractability of multivariate problems. The second volume deals with algorithms using standard information consisting of function values for the approximation of linear and selected nonlinear functionals. An important example is numerical multivariate integration.
The proof techniques used in volumes I and II are quite different. It is especially hard to establish meaningful lower error bounds for the approximation of functionals by using finitely many function values. Here, the concept of decomposable reproducing kernels is helpful, allowing it to find matching lower and upper error bounds for some linear functionals. It is then possible to conclude tractability results from such error bounds.
Tractability results, even for linear functionals, are very rich in variety. There are infinitedimensional Hilbert spaces for which the approximation with an arbitrarily small error of all linear functionals requires only one function value. There are Hilbert spaces for which all nontrivial linear functionals suffer from the curse of dimensionality. This holds for unweighted spaces, where the role of all variables and groups of variables is the same. For weighted spaces one can monitor the role of all variables and groups of variables. Necessary and sufficient conditions on the decay of the weights are given to obtain various notions of tractability.
The text contains extensive chapters on discrepancy and integration, decomposable kernels and lower bounds, the Smolyak/sparse grid algorithms, lattice rules and the CBC (componentbycomponent) algorithms. This is done in various settings. Path integration and quantum computation are also discussed.
This volume is of interest to researchers working in computational mathematics, especially in approximation of highdimensional problems. It is also well suited for graduate courses and seminars. There are 61 open problems listed to stimulate future research in tractability.
A publication of the European Mathematical Society (EMS). Distributed within the Americas by the American Mathematical Society.
Graduate students and research mathematicians interested in computational mathematics.