Tractability of Multivariate Problems: Linear information

Tractability of Multivariate Problems: Linear information PDF Author: Erich Novak
Publisher: European Mathematical Society
ISBN: 9783037190265
Category : Mathematics
Languages : en
Pages : 402

Get Book Here

Book Description
Multivariate problems occur in many applications. These problems are defined on spaces of $d$-variate functions and $d$ can be huge--in the hundreds or even in the thousands. Some high-dimensional problems can be solved efficiently to within $\varepsilon$, i.e., the cost increases polynomially in $\varepsilon^{-1}$ and $d$. However, there are many multivariate problems for which even the minimal cost increases exponentially in $d$. This exponential dependence on $d$ is called intractability or the curse of dimensionality. This is the first volume of a three-volume set comprising a comprehensive study of the tractability of multivariate problems. It is devoted to tractability in the case of algorithms using linear information and develops the theory for multivariate problems in various settings: worst case, average case, randomized and probabilistic. A problem is tractable if its minimal cost is not exponential in $\varepsilon^{-1}$ and $d$. There are various notions of tractability, depending on how we measure the lack of exponential dependence. For example, a problem is polynomially tractable if its minimal cost is polynomial in $\varepsilon^{-1}$ and $d$. The study of tractability was initiated about 15 years ago. This is the first and only research monograph on this subject. Many multivariate problems suffer from the curse of dimensionality when they are defined over classical (unweighted) spaces. In this case, all variables and groups of variables play the same role, which causes the minimal cost to be exponential in $d$. But many practically important problems are solved today for huge $d$ in a reasonable time. One of the most intriguing challenges of the theory is to understand why this is possible. Multivariate problems may become weakly tractable, polynomially tractable or even strongly polynomially tractable if they are defined over weighted spaces with properly decaying weights. One of the main purposes of this book is to study weighted spaces and obtain necessary and sufficient conditions on weights for various notions of tractability. The book is of interest for researchers working in computational mathematics, especially in approximation of high-dimensional problems. It may be also suitable for graduate courses and seminars. The text concludes with a list of thirty open problems that can be good candidates for future tractability research.

Tractability of Multivariate Problems: Linear information

Tractability of Multivariate Problems: Linear information PDF Author: Erich Novak
Publisher: European Mathematical Society
ISBN: 9783037190265
Category : Mathematics
Languages : en
Pages : 402

Get Book Here

Book Description
Multivariate problems occur in many applications. These problems are defined on spaces of $d$-variate functions and $d$ can be huge--in the hundreds or even in the thousands. Some high-dimensional problems can be solved efficiently to within $\varepsilon$, i.e., the cost increases polynomially in $\varepsilon^{-1}$ and $d$. However, there are many multivariate problems for which even the minimal cost increases exponentially in $d$. This exponential dependence on $d$ is called intractability or the curse of dimensionality. This is the first volume of a three-volume set comprising a comprehensive study of the tractability of multivariate problems. It is devoted to tractability in the case of algorithms using linear information and develops the theory for multivariate problems in various settings: worst case, average case, randomized and probabilistic. A problem is tractable if its minimal cost is not exponential in $\varepsilon^{-1}$ and $d$. There are various notions of tractability, depending on how we measure the lack of exponential dependence. For example, a problem is polynomially tractable if its minimal cost is polynomial in $\varepsilon^{-1}$ and $d$. The study of tractability was initiated about 15 years ago. This is the first and only research monograph on this subject. Many multivariate problems suffer from the curse of dimensionality when they are defined over classical (unweighted) spaces. In this case, all variables and groups of variables play the same role, which causes the minimal cost to be exponential in $d$. But many practically important problems are solved today for huge $d$ in a reasonable time. One of the most intriguing challenges of the theory is to understand why this is possible. Multivariate problems may become weakly tractable, polynomially tractable or even strongly polynomially tractable if they are defined over weighted spaces with properly decaying weights. One of the main purposes of this book is to study weighted spaces and obtain necessary and sufficient conditions on weights for various notions of tractability. The book is of interest for researchers working in computational mathematics, especially in approximation of high-dimensional problems. It may be also suitable for graduate courses and seminars. The text concludes with a list of thirty open problems that can be good candidates for future tractability research.

Tractability of Multivariate Problems: Standard information for functionals

Tractability of Multivariate Problems: Standard information for functionals PDF Author: Erich Novak
Publisher: European Mathematical Society
ISBN: 9783037190845
Category : Mathematics
Languages : en
Pages : 684

Get Book Here

Book Description
This is the second volume of a three-volume 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 infinite-dimensional 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 (component-by-component) 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 high-dimensional problems. It is also well suited for graduate courses and seminars. There are 61 open problems listed to stimulate future research in tractability.

Uniform Distribution and Quasi-Monte Carlo Methods

Uniform Distribution and Quasi-Monte Carlo Methods PDF Author: Peter Kritzer
Publisher: Walter de Gruyter GmbH & Co KG
ISBN: 3110375036
Category : Mathematics
Languages : en
Pages : 294

Get Book Here

Book Description
This book is summarizing the results of the workshop "Uniform Distribution and Quasi-Monte Carlo Methods" of the RICAM Special Semester on "Applications of Algebra and Number Theory" in October 2013. The survey articles in this book focus on number theoretic point constructions, uniform distribution theory, and quasi-Monte Carlo methods. As deterministic versions of the Monte Carlo method, quasi-Monte Carlo rules enjoy increasing popularity, with many fruitful applications in mathematical practice, as for example in finance, computer graphics, and biology. The goal of this book is to give an overview of recent developments in uniform distribution theory, quasi-Monte Carlo methods, and their applications, presented by leading experts in these vivid fields of research.

Multivariate Algorithms and Information-Based Complexity

Multivariate Algorithms and Information-Based Complexity PDF Author: Fred J. Hickernell
Publisher: Walter de Gruyter GmbH & Co KG
ISBN: 3110633159
Category : Mathematics
Languages : en
Pages : 200

Get Book Here

Book Description
The contributions by leading experts in this book focus on a variety of topics of current interest related to information-based complexity, ranging from function approximation, numerical integration, numerical methods for the sphere, and algorithms with random information, to Bayesian probabilistic numerical methods and numerical methods for stochastic differential equations.

Monte Carlo and Quasi-Monte Carlo Methods 2012

Monte Carlo and Quasi-Monte Carlo Methods 2012 PDF Author: Josef Dick
Publisher: Springer Science & Business Media
ISBN: 3642410952
Category : Mathematics
Languages : en
Pages : 680

Get Book Here

Book Description
This book represents the refereed proceedings of the Tenth International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing that was held at the University of New South Wales (Australia) in February 2012. These biennial conferences are major events for Monte Carlo and the premiere event for quasi-Monte Carlo research. The proceedings include articles based on invited lectures as well as carefully selected contributed papers on all theoretical aspects and applications of Monte Carlo and quasi-Monte Carlo methods. The reader will be provided with information on latest developments in these very active areas. The book is an excellent reference for theoreticians and practitioners interested in solving high-dimensional computational problems arising, in particular, in finance, statistics and computer graphics.

Essays on the Complexity of Continuous Problems

Essays on the Complexity of Continuous Problems PDF Author: Erich Novak
Publisher: European Mathematical Society
ISBN: 9783037190692
Category : Computational complexity
Languages : en
Pages : 112

Get Book Here

Book Description
This book contains five essays on the complexity of continuous problems, written for a wider audience. The first four essays are based on talks presented in 2008 when Henryk Wozniakowski received an honorary doctoral degree from the Friedrich Schiller University of Jena. The focus is on the introduction and history of the complexity of continuous problems, as well as on recent progress concerning the complexity of high-dimensional numerical problems. The last essay provides a brief and informal introduction to the basic notions and concepts of information-based complexity addressed to a general readership.

Contemporary Computational Mathematics - A Celebration of the 80th Birthday of Ian Sloan

Contemporary Computational Mathematics - A Celebration of the 80th Birthday of Ian Sloan PDF Author: Josef Dick
Publisher: Springer
ISBN: 3319724568
Category : Mathematics
Languages : en
Pages : 1330

Get Book Here

Book Description
This book is a tribute to Professor Ian Hugh Sloan on the occasion of his 80th birthday. It consists of nearly 60 articles written by international leaders in a diverse range of areas in contemporary computational mathematics. These papers highlight the impact and many achievements of Professor Sloan in his distinguished academic career. The book also presents state of the art knowledge in many computational fields such as quasi-Monte Carlo and Monte Carlo methods for multivariate integration, multi-level methods, finite element methods, uncertainty quantification, spherical designs and integration on the sphere, approximation and interpolation of multivariate functions, oscillatory integrals, and in general in information-based complexity and tractability, as well as in a range of other topics. The book also tells the life story of the renowned mathematician, family man, colleague and friend, who has been an inspiration to many of us. The reader may especially enjoy the story from the perspective of his family, his wife, his daughter and son, as well as grandchildren, who share their views of Ian. The clear message of the book is that Ian H. Sloan has been a role model in science and life.

Complexity and Information

Complexity and Information PDF Author: J. F. Traub
Publisher: Cambridge University Press
ISBN: 9780521485067
Category : Computers
Languages : en
Pages : 152

Get Book Here

Book Description
The twin themes of computational complexity and information pervade this 1998 book. It starts with an introduction to the computational complexity of continuous mathematical models, that is, information-based complexity. This is then used to illustrate a variety of topics, including breaking the curse of dimensionality, complexity of path integration, solvability of ill-posed problems, the value of information in computation, assigning values to mathematical hypotheses, and new, improved methods for mathematical finance. The style is informal, and the goals are exposition, insight and motivation. A comprehensive bibliography is provided, to which readers are referred for precise statements of results and their proofs. As the first introductory book on the subject it will be invaluable as a guide to the area for the many students and researchers whose disciplines, ranging from physics to finance, are influenced by the computational complexity of continuous problems.

2018 MATRIX Annals

2018 MATRIX Annals PDF Author: Jan de Gier
Publisher: Springer Nature
ISBN: 3030382303
Category : Mathematics
Languages : en
Pages : 430

Get Book Here

Book Description
MATRIX is Australia’s international and residential mathematical research institute. It facilitates new collaborations and mathematical advances through intensive residential research programs, each 1-4 weeks in duration. This book is a scientific record of the eight programs held at MATRIX in 2018: - Non-Equilibrium Systems and Special Functions - Algebraic Geometry, Approximation and Optimisation - On the Frontiers of High Dimensional Computation - Month of Mathematical Biology - Dynamics, Foliations, and Geometry In Dimension 3 - Recent Trends on Nonlinear PDEs of Elliptic and Parabolic Type - Functional Data Analysis and Beyond - Geometric and Categorical Representation Theory The articles are grouped into peer-reviewed contributions and other contributions. The peer-reviewed articles present original results or reviews on a topic related to the MATRIX program; the remaining contributions are predominantly lecture notes or short articles based on talks or activities at MATRIX.

The Best Writing on Mathematics 2010

The Best Writing on Mathematics 2010 PDF Author: Mircea Pitici
Publisher: Princeton University Press
ISBN: 1400836123
Category : Mathematics
Languages : en
Pages : 435

Get Book Here

Book Description
The year’s most memorable writing on mathematics This anthology brings together the year's finest writing on mathematics from around the world. Featuring promising new voices alongside some of the foremost names in mathematics, The Best Writing on Mathematics makes available to a wide audience many articles not easily found anywhere else—and you don't need to be a mathematician to enjoy them. These writings offer surprising insights into the nature, meaning, and practice of mathematics today. They delve into the history, philosophy, teaching, and everyday occurrences of math, and take readers behind the scenes of today's hottest mathematical debates. Here readers will discover why Freeman Dyson thinks some mathematicians are birds while others are frogs; why Keith Devlin believes there's more to mathematics than proof; what Nick Paumgarten has to say about the timing patterns of New York City's traffic lights (and why jaywalking is the most mathematically efficient way to cross Sixty-sixth Street); what Samuel Arbesman can tell us about the epidemiology of the undead in zombie flicks; and much, much more. In addition to presenting the year's most memorable writing on mathematics, this must-have anthology also includes a foreword by esteemed mathematician William Thurston and an informative introduction by Mircea Pitici. This book belongs on the shelf of anyone interested in where math has taken us—and where it's headed.