Related papers: Arc length of function graphs via Taylor's formula
Extensions to the trapezoidal rule using derivative information are studied for periodic integrands and integrals along the entire real line. Integrands which are analytic within a half plane or within a strip containing the path of…
We develope a difference calculus analogous to the differential geometry by translating the forms and exterior derivatives to similar expressions with difference operators, and apply the results to fields theory on the lattice [Ref. 1]. Our…
In this paper, we present and prove a new truncated $\mathcal{V}$-fractional Taylor's formula using the truncated $\mathcal{V}$-fractional variation of constants formula. In this sense, we present the truncated $\mathcal{V}$-fractional…
The Fourier extension method, also known as the Fourier continuation method, is a method for approximating non-periodic functions on an interval using truncated Fourier series with period larger than the interval on which the function is…
Let $\Gamma$ be a metric graph having a linear system $g^r_{2r}$ for some $2 \leq r \leq g-2$ then $\Gamma$ has a linear system $g^1_2$. This is similar to the well-known Clifford's Theorem from the theory of linear systems on smooth…
Motivated by recent results of Kapron and Steinberg (LICS 2018) we introduce new forms of iteration on length in the setting of applied lambda-calculi for higher-type poly-time computability. In particular, in a type-two setting, we…
An alternative class of the Lagrangian called the multiplicative form is suc- cessfully derived for a system with one degree of freedom for both non-relativistic and relativistic cases. This new Lagrangian can be considered as a…
In this paper, we derive Taylor's theorem for beta-fractional derivative. We also investigate some new properties of Taylor's theorem and some useful related theorems for this derivative. We extend some recent and classical integral…
Computational methods for fractional differential equations exhibit essential instability. Even a minor modification of the coefficients or other entry data may switch good results to the divergent. The goal of this paper is to suggest the…
We describe an expansion of Legendre polynomials, analogous to the Taylor expansion, to approximate arbitrary functions. We show that the polynomial coefficients in Legendre expansion, therefore the whole series, converge to zero much more…
Courcelle's Theorem is an important result in graph theory, proving the existence of linear-time algorithms for many decision problems on graphs whose tree-width is bounded by a constant. The purpose of this text is twofold: to provide an…
Holderian functions have strong non-linearities, which result in singularities in the derivatives. This manuscript presents several fractional-order Taylor expansions of H\"olderian functions around points of non- differentiability. These…
The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions that are representable as lattice polynomials. This result is…
The paper is devoted to the multiple chordal Loewner differential equation with different driving functions on two time intervals. We obtain exact implicit or explicit solutions to the Loewner equations with piecewise constant driving…
Tempered fractional derivatives originated from the tempered fractional diffusion equations (TFDEs) modeled on the whole space R (see [23]). For numerically solving TFDEs, two kinds of generalized Laguerre functions were defined and some…
Consider an arbitrary complex-valued, twice continuously differentiable, nonvanishing function $\phi$ defined on a finite segment $[a,b]\subset \mathbb{R}$. Let us introduce an infinite system of functions constructed in the following way.…
The aim of this paper is to establish various factorization results and then to derive estimates for linear functionals through the use of a generalized Taylor theorem. Additionally, several error bounds are established including…
We describe Gauss-type maps as geometric realizations of certain codes in the monoid of nonnegative matrices in the extended modular group. Each such code, together with an appropriate choice of unimodular intervals in P^1R, determines a…
We study an "above guarantee" version of the {\sc Longest Path} problem in directed graphs: We are given a graph $G$, two vertices $s$ and $t$ of $G$, and a non-negative integer $k$, and the objective is to determine whether $G$ contains a…
Complex interval arithmetic is a powerful tool for the analysis of computational errors. The naturally arising rectangular, polar, and circular (together called primitive) interval types are not closed under simple arithmetic operations,…