Related papers: Shellsort with three increments
In this work, we investigate a quasilinear subdiffusion model which involves a fractional derivative of order $\alpha \in (0,1)$ in time and a nonlinear diffusion coefficient. First, using smoothing properties of solution operators for…
The Path Contraction and Cycle Contraction problems take as input an undirected graph $G$ with $n$ vertices, $m$ edges and an integer $k$ and determine whether one can obtain a path or a cycle, respectively, by performing at most $k$ edge…
We introduce the algorithm ExpoSort, a groundbreaking method that sorts an array of $n$ numbers in a spectacularly inefficient $\Theta(2^n)$ time. ExpoSort proudly claims the title of the first reluctant algorithm to decisively surpass the…
This paper is devoted to the error analysis of a time-spectral algorithm for fractional diffusion problems of order $\alpha$ ($0 < \alpha < 1$). The solution regularity in the Sobolev space is revisited, and new regularity results in the…
Stochastic alternating algorithms for bi-objective optimization are considered when optimizing two conflicting functions for which optimization steps have to be applied separately for each function. Such algorithms consist of applying a…
Irregularly sampled time series analysis is a common problem in various disciplines. Since conventional methods are not directly applicable to irregularly sampled time series, a common interpolation approach is used; however, this causes…
The accuracy at which total energies of open-shell atoms and organic radicals may be calculated is assessed for selected coupled cluster perturbative triples expansions, all of which augment the coupled cluster singles and doubles (CCSD)…
We consider the problem of sorting $n$ elements in the case of \emph{persistent} comparison errors. In this model (Braverman and Mossel, SODA'08), each comparison between two elements can be wrong with some fixed (small) probability $p$,…
Consider a random graph $G$ of size $N$ constructed according to a \textit{graphon} $w \, : \, [0,1]^{2} \mapsto [0,1]$ as follows. First embed $N$ vertices $V = \{v_1, v_2, \ldots, v_N\}$ into the interval $[0,1]$, then for each $i < j$…
This paper studies the average complexity on the number of comparisons for sorting algorithms. Its information-theoretic lower bound is $n \lg n - 1.4427n + O(\log n)$. For many efficient algorithms, the first $n\lg n$ term is easy to…
This paper summarises a numerical investigation which aimed to identify and characterise regular and chaotic behaviour in time-dependent Hamiltonians H(r,p,t) = p^2/2 + U(r,t), with U=R(t)V(r) or U=V[R(t)r], where V(r) is a polynomial in x,…
We present some results on the proportion of permutations of length $n$ containing certain mesh patterns as $n$ grows large, and give exact enumeration results in some cases. In particular, we focus on mesh patterns where entire rows and…
He and Yuan's prediction-correction framework [SIAM J. Numer. Anal. 50: 700-709, 2012] is able to provide convergent algorithms for solving separable convex optimization problems at a rate of $O(1/t)$ ($t$ represents iteration times) in…
We consider stochastic variational inequalities with monotone operators defined as the expected value of a random operator. We assume the feasible set is the intersection of a large family of convex sets. We propose a method that combines…
Fractional stochastic volatility models have been widely used to capture the non-Markovian structure revealed from financial time series of realized volatility. On the other hand, empirical studies have identified scales in stock price…
We consider the problem of determining the maximum number of moves required to sort a permutation of $[n]$ using cut-and-paste operations, in which a segment is cut out and then pasted into the remaining string, possibly reversed. We give…
The perturbation technique within the framework of the asymptotic iteration method is used to obtain large-order shifted 1/N expansions, where N is the number of spatial dimensions. This method is contrary to the usual…
An improved estimate is given for $|\theta(x) -x|$, where $\theta(x) = \sum_{p\leq x} \log p$. Three applications are given: the first to arithmetic progressions that have points in common, the second to primes in short intervals, and the…
A novel integer sorting technique was proposed replacing bucket sort, distribution counting sort and address calculation sort family of algorithms which requires only constant amount of additional memory. The technique was inspired from one…
In this paper we consider the Euler-Maruyama scheme for a class ofstochastic delay differential equations driven by a fractional Brownian motion with index $H\in(0,1)$. We establish the consistency of the scheme and study the rate of…