ﻻ يوجد ملخص باللغة العربية
Automatic numerical algorithms attempt to provide approximate solutions that differ from exact solutions by no more than a user-specified error tolerance. The computational cost is often determined emph{adaptively} by the algorithm based on the function values sampled. While adaptive, automatic algorithms are widely used in practice, most lack emph{guarantees}, i.e., conditions on input functions that ensure that the error tolerance is met. This article establishes a framework for guaranteed, adaptive, automatic algorithms. Sufficient conditions for success and two-sided bounds on the computational cost are provided in Theorems ref{TwoStageDetermThm} and ref{MultiStageThm}. Lower bounds on the complexity of the problem are given in Theorem ref{complowbd}, and conditions under which the proposed algorithms have optimal order are given in Corollary ref{optimcor}. These general theorems are illustrated for univariate numerical integration and function recovery via adaptive algorithms based on linear splines. The key to these adaptive algorithms is performing the analysis for emph{cones} of input functions rather than balls. Cones provide a setting where adaption may be beneficial.
We present an analysis of the additive average Schwarz preconditioner with two newly proposed adaptively enriched coarse spaces which was presented at the 23rd International conference on domain decomposition methods in Korea, for solving second orde
A systematic mathematical framework for the study of numerical algorithms would allow comparisons, facilitate conjugacy arguments, as well as enable the discovery of improved, accelerated, data-driven algorithms. Over the course of the last century,
The fragile complexity of a comparison-based algorithm is $f(n)$ if each input element participates in $O(f(n))$ comparisons. In this paper, we explore the fragile complexity of algorithms adaptive to various restrictions on the input, i.e., algorith
Numerical methods for stochastic partial differential equations typically estimate moments of the solution from sampled paths. Instead, we shall directly target the deterministic equations satisfied by the first and second moments, as well as the cov
This paper provides an algorithmic framework for obtaining fast distributed algorithms for a highly-dynamic setting, in which *arbitrarily many* edge changes may occur in each round. Our algorithm significantly improves upon prior work in its combina