Related papers: Explicit Expressions for Iterates of Power Series
Through introducing a new iterative formula for divided differnce using Neville's and Aitken's algorithms,we study new iterative methods for interpolation,numerical differentiation and numerical integration formulas with arbitrary order of…
Recently Ahmadi et al. (2021) and Tagliaferro (2022) proposed some iterative methods for the numerical solution of linear systems which, under the classical hypothesis of strict diagonal dominance, typically converge faster than the Jacobi…
An iterative algorithm is adopted to construct approximate representations of matrices describing the scattering properties of arbitrary objects. The method is based on the implicit evaluation of scattering responses from iteratively…
A new calculus based on fractal subsets of the real line is formulated. In this calculus, an integral of order $\alpha, 0 < \alpha \leq 1$, called $F^\alpha$-integral, is defined, which is suitable to integrate functions with fractal…
We introduce a new class of extensions of terms that consists in navigation strategies and insertion of contexts. We introduce an operation of combination on this class which is associative, admits a neutral element and so that each…
We obtain series expansion formulas for the Hadamard fractional integral and fractional derivative of a smooth function. When considering finite sums only, an upper bound for the error is given. Numerical simulations show the efficiency of…
Factorial series played a major role in Stirling's classic book "Methodus Differentialis" (1730), but now only a few specialists still use them. This article wants to show that this neglect is unjustified, and that factorial series are…
Various approaches to the numerical representation of the Incomplete Gamma Function F_m(z) for complex arguments z and small integer indexes m are compared with respect to numerical fitness (accuracy and speed). We consider power series,…
We expose (without proofs) a unified computational approach to integrable structures (including recursion, Hamiltonian, and symplectic operators) based on geometrical theory of partial differential equations. We adopt a coordinate based…
We obtain an iterative formula that converges incrementally to the smallest singular value. Similarly, we obtain an iterative formula that converges decreasingly to the largest singular value.
Starting with the recursive extended Euclid's algorithm, we apply a systematic approach using matrix notation to transform it into an iterative algorithm. The partial correctness proof derived from the transformation turns out to be very…
We describe the qFunctions Mathematica package for $q$-series and partition theory applications. This package includes both experimental and symbolic tools. The experimental set of elements includes guessers for $q$-shift equations and…
In this work we derive and evaluate some infinite integrals involving the product of a generalized logarithm and polynomial functions in the denominator. These integrals are expressed in terms of finite series involving the Hurwitz-Lerch…
We present a set of algebraic functions for evaluating the coefficients of the scalar integral basis of a general one-loop amplitude. The functions are derived from unitarity cuts, but the complete cut-integral procedure has been carried…
This work is an extension of our earlier article, where a well-known integral representation of the logarithmic function was explored, and was accompanied with demonstrations of its usefulness in obtaining compact, easily-calculable, exact…
We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of…
Decompositions of the unitary group U(n) are useful tools in quantum information theory as they allow one to decompose unitary evolutions into local evolutions and evolutions causing entanglement. Several recursive decompositions have been…
We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over $p$-adic numbers gives a recurrence relation computing modular inverse modulo $p^m$, that is logarithmic in $m$. We solve the recurrence to…
We prove a useful formula and new properties for the recently introduced power fractional calculus with non-local and non-singular kernels. In particular, we prove a new version of Gronwall's inequality involving the power fractional…
Although fractional powers of non-negative operators have received much attention in recent years, there is still little known about their behavior if real-valued exponents are greater than one. In this article, we define and study the…