Probabilistic analysis of numerical integration algorithms
نویسندگان
چکیده
منابع مشابه
Probabilistic Analysis of Algorithms
Rather than analyzing the worst case performance of algorithms, one can investigate their performance on typical instances of a given size. This is the approach we investigate in this paper. Of course, the first question we must answer is: what do we mean by a typical instance of a given size? Sometimes, there is a natural answer to this question. For example, in developing an algorithm which i...
متن کاملAutomatic differentiation of numerical integration algorithms
Automatic differentiation (AD) is a technique for automatically augmenting computer programs with statements for the computation of derivatives. This article discusses the application of automatic differentiation to numerical integration algorithms for ordinary differential equations (ODEs), in particular, the ramifications of the fact that AD is applied not only to the solution of such an algo...
متن کاملAutomatic Diierentiation of Numerical Integration Algorithms
Automatic diierentiation (AD) is a technique for automatically augmenting computer programs with statements for the computation of derivatives. This article discusses the application of automatic diierentiation to numerical integration algorithms for ordinary diierential equations (ODEs), in particular, the ramiications of the fact that AD is applied not only to the solution of such an algorith...
متن کاملOptimal algorithms for numerical integration: a survey
We discuss optimality of approximation algorithms and lower bounds on their complexity using Carl’s inequality, which states that for any two Banach spaces X and Y and any α > 0 there exists a constant γα > 0 such that sup 1≤k≤n kek(T ) ≤ γα sup 1≤k≤n kck(T ) holds for all linear and bounded operators T : X → Y . Here ek(T ) is the k-th entropy number of T and ck(T ) is the k-th Gelfand number ...
متن کاملProbabilistic Analysis of Satisfiability Algorithms
Probabilistic and average-case analysis can give useful insight into the question of what algorithms for testing satisfiability might be effective and why. Under certain circumstances, one or more structural properties shared by each of a family or class of expressions may be exploited to solve such expressions efficiently; or structural properties might force a class of algorithms to require s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1991
ISSN: 0885-064X
DOI: 10.1016/0885-064x(91)90044-x