If we compose sufficiently many random functions on a finite set, then the composite function will be constant. We determine the number of compositions that are needed, on average...
The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional...
The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q((x))[y], th...
: The predictor-corrector method for following a reduced gradient (RGF) to determine saddle points [Quapp, W. et al., J Comput Chem 1998, 19, 1087] is further accelerated by a modi...
ABSTRACT. The aim of this paper is to provide a convergence analysis for a preconditioned subspace iteration, which is designated to determine a modest number of the smallest eigen...