Quasi-polynomial tractability
نویسندگان
چکیده
منابع مشابه
Quasi-polynomial tractability
Tractability of multivariate problems has become nowadays a popular research subject. Polynomial tractability means that the solution of a d-variate problem can be solved to within ε with polynomial cost in ε−1 and d. Unfortunately, many multivariate problems are not polynomially tractable. This holds for all non-trivial unweighted linear tensor product problems. By an unweighted problem we mea...
متن کاملWeak and quasi-polynomial tractability of approximation of infinitely differentiable functions
We comment on recent results in the field of information based complexity, which state (in a number of different settings), that approximation of infinitely differentiable functions is intractable and suffers from the curse of dimensionality. We show that renorming the space of infinitely differentiable functions in a suitable way allows weakly tractable uniform approximation by using only func...
متن کاملStrong tractability of multivariate integration using quasi-Monte Carlo algorithms
We study quasi–Monte Carlo algorithms based on low discrepancy sequences for multivariate integration. We consider the problem of how the minimal number of function evaluations needed to reduce the worst-case error from its initial error by a factor of ε depends on ε−1 and the dimension s. Strong tractability means that it does not depend on s and is bounded by a polynomial in ε−1. The least po...
متن کاملBounded quasi-interpolatory polynomial operators
We construct bounded polynomial operators, similar to the classical de la Valleé Poussin operators in Fourier series, which preserve polynomials of a certain degree, but are defined in terms of the values of the function rather than its Fourier coefficients. AMS classification: 41 A 10, 41 A 05
متن کامل(using the Quasi-polynomial Ansatz)
The purpose of this short article is to announce, and briefly describe, a Maple package, PARTITIONS, that (inter alia) completely automatically discovers, and then proves, explicit expressions (as sums of quasi-polynomials) for pm(n) for any desired m. We do this to demonstrate the power of “rigorous guessing” as facilitated by the quasi-polynomial ansatz. ∗E-mail addresses: ASills@GeorgiaSouth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2011
ISSN: 0885-064X
DOI: 10.1016/j.jco.2010.07.001