相关论文: On a Vectorized Version of a Generalized Richardso…

We study multivariate numerical integration of smooth functions in weighted Sobolev spaces with dominating mixed smoothness $\alpha\geq 2$ defined over the $s$-dimensional unit cube. We propose a new quasi-Monte Carlo (QMC)-based quadrature…

We present an algorithm that on input of an $n$-vertex $m$-edge weighted graph $G$ and a value $k$, produces an {\em incremental sparsifier} $\hat{G}$ with $n-1 + m/k$ edges, such that the condition number of $G$ with $\hat{G}$ is bounded…

Consider a critical Galton-Watson process Z={Z_n: n=0,1,...} of index 1+alpha, alpha in (0,1]. Let S_k(j) denote the sum of the Z_n with n in the window [k,...,k+j), and M_m(j) the maximum of the S_k with k moving in [0,m-j]. We describe…

We provide a generalization of Theorem 1 in Bartkiewicz, Jakubowski, Mikosch and Wintenberger (2011) in the sense that we give sufficient conditions for weak convergence of finite dimensional distributions of the partial sum processes of a…

Let $\boldsymbol{X}(t)=(X_1(t),\ldots,X_d(t))$ be a Gaussian vector process and $g(t)$ be a continuous function. The asymptotics of distribution of $\left\|\boldsymbol{X}(t)\right\|_p$, the $L^p$ norm for Gaussian finite-dimensional vector,…

As a generalization of the sum of digits function and other digital sequences, sequences defined as the sum of the output of a transducer are asymptotically analyzed. The input of the transducer is a random integer in $[0, N)$. Analogues in…

A fast approximation to the Boys functions (related to the lower incomplete gamma function of half-integer parameter) by a single closed-form analytical expression for all argument values have been developed and tested. Besides the…

We prove a deterministic analogue of Rudelson's sampling theorem for sums of positive semidefinite matrices. Let $A_1,\dots,A_m$ be positive semidefinite \(d\times d\) matrices, and let $\lambda_1,\dots,\lambda_m \ge 0$ satisfy \[…

Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…

This article deals with the conjugate gradient method on a Riemannian manifold with interest in global convergence analysis. The existing conjugate gradient algorithms on a manifold endowed with a vector transport need the assumption that…

Let $X_{1},X_{2},...$ be a sequence of independent copies (s.i.c) of a real random variable (r.v.) $X\geq 1$, with distribution function $df$ $F(x)=\mathbb{P}% (X\leq x)$ and let $X_{1,n}\leq X_{2,n} \leq ... \leq X_{n,n}$ be the order…

We study trade-offs between convergence rate and robustness to gradient errors in the context of first-order methods. Our focus is on generalized momentum methods (GMMs)--a broad class that includes Nesterov's accelerated gradient,…

We propose new iterative methods for computing nontrivial extremal generalized singular values and vectors. The first method is a generalized Davidson-type algorithm and the second method employs a multidirectional subspace expansion…

In this paper, we first propose a general inertial proximal point method for the mixed variational inequality (VI) problem. Based on our knowledge, without stronger assumptions, convergence rate result is not known in the literature for…

This paper presents GeNI-ADMM, a framework for large-scale composite convex optimization that facilitates theoretical analysis of both existing and new approximate ADMM schemes. GeNI-ADMM encompasses any ADMM algorithm that solves a first-…

In this paper, we consider a Riemannian manifold $M$ and the Poisson-Voronoi tessellation generated by the union of a fixed point $x_0$ and a Poisson point process of intensity $\lambda$ on $M$. We obtain asymptotic expansions up to the…

Richardson extrapolation is applied to a simple first-order upwind difference scheme for the approximation of solutions of singularly perturbed convection-diffusion problems in one dimension. Robust a posteriori error bounds are derived for…

Let $x \in \mathbb{R}$ be arbitrary and consider the `greedy' approximation of $x$ by signed harmonic sums: given $a_n = \sum_{k \leq n} \varepsilon_k/k$ with $\varepsilon_k \in \left\{-1,1\right\}$, we set $\varepsilon_{n+1} = 1$ if $a_n…

The Robbins-Siegmund theorem establishes the convergence of stochastic processes that are almost supermartingales and is one of the most commonly used approaches for analyzing stochastic iterative algorithms in stochastic approximation and…

The average properties of the well-known Subset Sum Problem can be studied by the means of its randomised version, where we are given a target value $z$, random variables $X_1, \ldots, X_n$, and an error parameter $\varepsilon > 0$, and we…