Related papers: On "Upper error bounds for quadrature formulas on …
We prove that if $f:I\subset \Bbb R\to \Bbb R$ is of bounded variation, then the noncentered maximal function $Mf$ is absolutely continuous, and its derivative satisfies the sharp inequality $\|DMf\|_1\le |Df|(I)$. This allows us obtain,…
The convergence of multiple Fourier series of functions of bounded partial $% \Lambda$-variation is investigated. The sufficient and necessary conditions on the sequence $\Lambda=\{\lambda_n\}$ are found for the convergence of multiple…
The prime objective of this paper is to design a new family of eighth-order iterative methods by accelerating the order of convergence and efficiency index of well existing seventh-order iterative method of \cite{Soleymani1} without using…
We present exact mixed-integer linear programming formulations for verifying the performance of first-order methods for parametric quadratic optimization. We formulate the verification problem as a mixed-integer linear program where the…
Due to a theorem by Orlov every exact fully faithful functor between the bounded derived categories of coherent sheaves on smooth projective varieties is of Fourier-Mukai type. We extend this result to the case of bounded derived categories…
The paper is devoted to the development of control procedures with a guide for conflict-controlled dynamical systems described by ordinary fractional differential equations with the Caputo derivative of an order $\alpha \in (0, 1).$ For the…
The provably asymptotically fastest algorithm within a factor of 5 for formally described problems will be constructed. The main idea is to enumerate all programs provably equivalent to the original problem by enumerating all proofs. The…
In this article, we investigate the convergence rate of the discrete-time Clark--Ocone formula provided by Akahori--Amaba--Okuma [1]. In that paper, they mainly focus on the $L_{2}$-convergence rate of the first-order error estimate related…
The equivalence of regularity of a Q-matrix with its bounded perturbations is proved and a integration by parts formula is established for the associated Feller minimal transition functions.
In the article the author is studying the twice codifferentiable functions, defined by Prof. V.Ph. Demyanov, and some methods for calculating their codifferentials. At the beginning easier case is considered when a function is twice…
It is proved that the Fibonacci and the Frolov point sets, which are known to be very good for numerical integration, have optimal rate of decay of dispersion with respect to the cardinality of sets. This implies that the Fibonacci and the…
A consequent approach is proposed to construct symplectic force-gradient algorithms of arbitrarily high orders in the time step for precise integration of motion in classical and quantum mechanics simulations. Within this approach the basic…
We present effective upper bounds on the symmetric bilinear complexity of multiplication in extensions of a base finite field Fp2 of prime square order, obtained by combining estimates on gaps between prime numbers together with an optimal…
This paper presents an algorithm for solving multiobjective optimization problems involving composite functions, where we minimize a quadratic model that approximates $F(x) - F(x^k)$ and that can be derivative-free. We establish theoretical…
In this paper we study the forward integral of operator-valued processes with respect to a cylindrical Brownian motion. In particular, we provide conditions under which the approximating sequence of processes of the forward integral,…
This work is devoted to solving the composite optimization problem with the mixture oracle: for the smooth part of the problem, we have access to the gradient, and for the non-smooth part, only the one-point zero-order oracle is available.…
In this paper we study the global boundedness for the solutions to a class of possibly degenerate parabolic equations by De-Giorgi's iteration. As applications, we show the existence of weak solutions for possibly degenerate stochastic…
Error bounds and complexity bounds in numerical analysis and information-based complexity are often proved for functions that are defined on very simple domains, such as a cube, a torus, or a sphere. We study optimal error bounds for the…
By prior work, it is known that any distributed graph algorithm that finds a maximal matching requires $\Omega(\log^* n)$ communication rounds, while it is possible to find a maximal fractional matching in $O(1)$ rounds in bounded-degree…
In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…