相关论文: Finite N\"orlund Summation Methods

We investigate the subsequence $\{t_{2^n}f \}$ of N\"{o}rlund means with respect to the Walsh system generated by non-increasing and convex sequences. In particular, we prove that a big class of such summability methods are not bounded from…

Power series in which the summand satisfies a linear recurrence relation with polynomial coefficients are shown to be the solution of a linear differential or algebraic equation. Solving the associated differential or algebraic equation…

Let $p,p_1,\ldots,p_m$ be positive integers with $p_1\leq p_2\leq\cdots\leq p_m$ and $x\in [-1,1)$, define the so-called Euler type sums ${S_{{p_1}{p_2} \cdots {p_m},p}}\left( x \right)$, which are the infinite sums whose general term is a…

We show that if ${\bf a}=(a_n)_{n\in \N}$ is a good weight for the dominated weighted ergodic theorem in $L^p$, $p>1$, then the N\"orlund matrix $N_{\bf a}=\{a_{i-j}/A_i\}_{0\le j\le i}$, $A_i=\sum_{k=0}^i |a_k|$ is bounded on $\ell^p(\N)$.…

This paper discusses the semantics and proof theory of Nilsson's probabilistic logic, outlining both the benefits of its well-defined model theory and the drawbacks of its proof theory. Within Nilsson's semantic framework, we derive a set…

We investigate the approximation for computing the sum $a_1+...+a_n$ with an input of a list of nonnegative elements $a_1,..., a_n$. If all elements are in the range $[0,1]$, there is a randomized algorithm that can compute an…

The article addresses the problem whether indefinite double sums involving a generic sequence can be simplified in terms of indefinite single sums. Depending on the structure of the double sum, the proposed summation machinery may provide…

In this paper, we present the foundations of Summability Calculus, which places various established results in number theory, infinitesimal calculus, summability theory, asymptotic analysis, information theory, and the calculus of finite…

Approximative properties of linear summation methods of Fourier series are considered in the Orlicz type spaces ${\mathcal S}_{M}$. In particular, in terms of approximations by such methods, constructive characteristics are obtained for…

Recent advances in randomized incremental methods for minimizing $L$-smooth $\mu$-strongly convex finite sums have culminated in tight complexity of $\tilde{O}((n+\sqrt{n L/\mu})\log(1/\epsilon))$ and $O(n+\sqrt{nL/\epsilon})$, where…

Summation methods play a very important role in quantum field theory because all perturbation series are divergent and the expansion parameter is not always small. A number of methods have been tried in this context, most notably Pade…

A recently developed analytical method for systematic improvement of the convergence of path integrals is used to derive a generalization of Euler's summation formula for path integrals. The first $p$ terms in this formula improve…

These are classified by the direction of approximation (from above or below), the set family types (partition or covering) of simple functions, the coefficient signature (non-negative or signed), and cardinal number of terms of simple…

In the framework of generalized Oppenheim expansions we prove strong law of large numbers for lightly trimmed sums. In the first part of this work we identify a particular class of expansions for which we provide a convergence result…

Recent advances in optimization theory have shown that smooth strongly convex finite sums can be minimized faster than by treating them as a black box "batch" problem. In this work we introduce a new method in this class with a theoretical…

This paper presents a lower bound for optimizing a finite sum of $n$ functions, where each function is $L$-smooth and the sum is $\mu$-strongly convex. We show that no algorithm can reach an error $\epsilon$ in minimizing all functions from…

Recently, in [Bor4], Bor proved a main theorem dealing with $|\bar{N}, p_{n}|_{k}$ summability factors of infinite series. In the present paper, we have generalized that theorem for $|A, p_{n}|_{k}$ summability method by taking normal…

In this note, we study the flint hills series of the form \begin{align} \sum \limits_{n=1}^{\infty}\frac{1}{(\sin^2n) n^3}\nonumber \end{align} via a certain method. The method essentially works by erecting certain pillars sufficiently…

We reexamine the Riemann Rearrangement Theorem for different types of convergence. We consider series convergence with respect to a filter. We describe the Sum Range (SR) of a series along the 2n-filter and for statistically convergent…

We present Korovkin approximation theorems that incorporate summability methods. These result allows us to obtain a unified treatment of several previous results, focusing on the underlying structure and the properties that a summability…