Author: Erich Novak
Publisher: European Mathematical Society
ISBN: 9783037190265
Category : Mathematics
Languages : en
Pages : 402
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
Author: Erich Novak
Publisher: European Mathematical Society
ISBN: 9783037190265
Category : Mathematics
Languages : en
Pages : 402
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.
Publisher: European Mathematical Society
ISBN: 9783037190265
Category : Mathematics
Languages : en
Pages : 402
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.
Multivariate Algorithms and Information-Based Complexity
Author: Fred J. Hickernell
Publisher: Walter de Gruyter GmbH & Co KG
ISBN: 3110635461
Category : Mathematics
Languages : en
Pages : 158
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.
Publisher: Walter de Gruyter GmbH & Co KG
ISBN: 3110635461
Category : Mathematics
Languages : en
Pages : 158
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.
Essays on the Complexity of Continuous Problems
Author: Erich Novak
Publisher: European Mathematical Society
ISBN: 9783037190692
Category : Computational complexity
Languages : en
Pages : 112
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.
Publisher: European Mathematical Society
ISBN: 9783037190692
Category : Computational complexity
Languages : en
Pages : 112
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.
Uniform Distribution and Quasi-Monte Carlo Methods
Author: Peter Kritzer
Publisher: Walter de Gruyter GmbH & Co KG
ISBN: 3110375036
Category : Mathematics
Languages : en
Pages : 294
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.
Publisher: Walter de Gruyter GmbH & Co KG
ISBN: 3110375036
Category : Mathematics
Languages : en
Pages : 294
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.
Contemporary Computational Mathematics - A Celebration of the 80th Birthday of Ian Sloan
Author: Josef Dick
Publisher: Springer
ISBN: 3319724568
Category : Mathematics
Languages : en
Pages : 1330
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.
Publisher: Springer
ISBN: 3319724568
Category : Mathematics
Languages : en
Pages : 1330
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.
Monte Carlo and Quasi-Monte Carlo Methods 2012
Author: Josef Dick
Publisher: Springer Science & Business Media
ISBN: 3642410952
Category : Mathematics
Languages : en
Pages : 680
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.
Publisher: Springer Science & Business Media
ISBN: 3642410952
Category : Mathematics
Languages : en
Pages : 680
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.
Complexity and Information
Author: J. F. Traub
Publisher: Cambridge University Press
ISBN: 9780521485067
Category : Computers
Languages : en
Pages : 152
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.
Publisher: Cambridge University Press
ISBN: 9780521485067
Category : Computers
Languages : en
Pages : 152
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.
Digital Nets and Sequences
Author: Josef Dick
Publisher: Cambridge University Press
ISBN: 1139490052
Category : Computers
Languages : en
Pages : 619
Book Description
Indispensable for students, invaluable for researchers, this comprehensive treatment of contemporary quasi–Monte Carlo methods, digital nets and sequences, and discrepancy theory starts from scratch with detailed explanations of the basic concepts and then advances to current methods used in research. As deterministic versions of the Monte Carlo method, quasi–Monte Carlo rules have increased in popularity, with many fruitful applications in mathematical practice. These rules require nodes with good uniform distribution properties, and digital nets and sequences in the sense of Niederreiter are known to be excellent candidates. Besides the classical theory, the book contains chapters on reproducing kernel Hilbert spaces and weighted integration, duality theory for digital nets, polynomial lattice rules, the newest constructions by Niederreiter and Xing and many more. The authors present an accessible introduction to the subject based mainly on material taught in undergraduate courses with numerous examples, exercises and illustrations.
Publisher: Cambridge University Press
ISBN: 1139490052
Category : Computers
Languages : en
Pages : 619
Book Description
Indispensable for students, invaluable for researchers, this comprehensive treatment of contemporary quasi–Monte Carlo methods, digital nets and sequences, and discrepancy theory starts from scratch with detailed explanations of the basic concepts and then advances to current methods used in research. As deterministic versions of the Monte Carlo method, quasi–Monte Carlo rules have increased in popularity, with many fruitful applications in mathematical practice. These rules require nodes with good uniform distribution properties, and digital nets and sequences in the sense of Niederreiter are known to be excellent candidates. Besides the classical theory, the book contains chapters on reproducing kernel Hilbert spaces and weighted integration, duality theory for digital nets, polynomial lattice rules, the newest constructions by Niederreiter and Xing and many more. The authors present an accessible introduction to the subject based mainly on material taught in undergraduate courses with numerous examples, exercises and illustrations.
A Panorama of Discrepancy Theory
Author: William Chen
Publisher: Springer
ISBN: 3319046969
Category : Mathematics
Languages : en
Pages : 708
Book Description
This is the first work on Discrepancy Theory to show the present variety of points of view and applications covering the areas Classical and Geometric Discrepancy Theory, Combinatorial Discrepancy Theory and Applications and Constructions. It consists of several chapters, written by experts in their respective fields and focusing on the different aspects of the theory. Discrepancy theory concerns the problem of replacing a continuous object with a discrete sampling and is currently located at the crossroads of number theory, combinatorics, Fourier analysis, algorithms and complexity, probability theory and numerical analysis. This book presents an invitation to researchers and students to explore the different methods and is meant to motivate interdisciplinary research.
Publisher: Springer
ISBN: 3319046969
Category : Mathematics
Languages : en
Pages : 708
Book Description
This is the first work on Discrepancy Theory to show the present variety of points of view and applications covering the areas Classical and Geometric Discrepancy Theory, Combinatorial Discrepancy Theory and Applications and Constructions. It consists of several chapters, written by experts in their respective fields and focusing on the different aspects of the theory. Discrepancy theory concerns the problem of replacing a continuous object with a discrete sampling and is currently located at the crossroads of number theory, combinatorics, Fourier analysis, algorithms and complexity, probability theory and numerical analysis. This book presents an invitation to researchers and students to explore the different methods and is meant to motivate interdisciplinary research.
Bases in Function Spaces, Sampling, Discrepancy, Numerical Integration
Author: Hans Triebel
Publisher: European Mathematical Society
ISBN: 9783037190852
Category : Mathematics
Languages : en
Pages : 314
Book Description
The first chapters of this book deal with Haar bases, Faber bases and some spline bases for function spaces in Euclidean $n$-space and $n$-cubes. These are used in the subsequent chapters to study sampling and numerical integration preferably in spaces with dominating mixed smoothness. The subject of the last chapter is the symbiotic relationship between numerical integration and discrepancy, measuring the deviation of sets of points from uniformity. This book is addressed to graduate students and mathematicians who have a working knowledge of basic elements of function spaces and approximation theory and who are interested in the subtle interplay between function spaces, complexity theory and number theory (discrepancy).
Publisher: European Mathematical Society
ISBN: 9783037190852
Category : Mathematics
Languages : en
Pages : 314
Book Description
The first chapters of this book deal with Haar bases, Faber bases and some spline bases for function spaces in Euclidean $n$-space and $n$-cubes. These are used in the subsequent chapters to study sampling and numerical integration preferably in spaces with dominating mixed smoothness. The subject of the last chapter is the symbiotic relationship between numerical integration and discrepancy, measuring the deviation of sets of points from uniformity. This book is addressed to graduate students and mathematicians who have a working knowledge of basic elements of function spaces and approximation theory and who are interested in the subtle interplay between function spaces, complexity theory and number theory (discrepancy).