Related papers: Computing the Lambert W function in arbitrary-prec…
The computation of the Mittag-Leffler (ML) function with matrix arguments, and some applications in fractional calculus, are discussed. In general the evaluation of a scalar function in matrix arguments may require the computation of…
We investigate solutions to the functional equation $f(f(x)) = e^x$, which can be interpreted as the problem of finding a half iterate of the exponential map. While no elementary solution exists, we construct and analyze non-elementary…
Interval computation is widely used to certify computations that use floating point operations to avoid pitfalls related to rounding error introduced by inaccurate operations. Despite its popularity and practical benefits, support for…
In this paper, we study the Lambert-Tsallis function, which is a generalization of the Lambert function with two real parameters. We give a condition on the parameters such that there exists a complex domain touching zero on boundary which…
We present a new approach to examine transient dynamics in a class of non-autonomous delay differential equations. Exact solutions for these equations are obtained using the Lambert W function alongside an appropriately chosen initial…
Measuring attenuation coefficients is a fundamental problem that can be solved with diverse techniques such as X-ray or optical tomography and lidar. We propose a novel approach based on the observation of a sample from a few different…
A numerical scheme is developed for the evaluation of Abramowitz functions $J_n$ in the right half of the complex plane. For $n=-1,\, \ldots,\, 2$, the scheme utilizes series expansions for $|z|<1$ and asymptotic expansions for $|z|>R$ with…
We present an algorithm which uses Fujiwara's inequality to bound algebraic functions over ellipses of a certain type, allowing us to concretely implement a rigorous Gauss-Legendre integration method for algebraic functions over a line…
In earlier work, we developed an approach for automatic complexity analysis of integer programs, based on an alternating modular inference of upper runtime and size bounds for program parts. In this paper, we show how recent techniques to…
Lambert's problem is the orbital boundary-value problem constrained by two points and elapsed time. It is one of the most extensively studied problems in celestial mechanics and astrodynamics, and, as such, it has always attracted the…
In this note, analysis of time delay systems using Lambert W function approach is reassessed. A common canonical form of time delay systems is defined. We extended the recent results of [6] for second order into nth order system. The…
System identification is an important area of science, which aims to describe the characteristics of the system, representing them by mathematical models. Since many of these models can be seen as recursive functions, it is extremely…
Much algorithmic research in NLP aims to efficiently manipulate rich formal structures. An algorithm designer typically seeks to provide guarantees about their proposed algorithm -- for example, that its running time or space complexity is…
In this paper we present two efficient approximations for the complex error function $w \left( {z} \right)$ with small imaginary argument $\operatorname{Im}{\left[ { z } \right]} < < 1$ over the range $0 \le \operatorname{Re}{\left[ { z }…
A numerical approach to solve the perturbed Lambert's problem is presented. The proposed technique uses the Theory of Functional Connections, which allows the derivation of a constrained functional that analytically satisfies the boundary…
In the present work, we introduce the Lambert-Tsallis Wq function. It is a generalization of the Lambert W function, that solves the equation Wq(x)expq(Wq(x)) = x, where expq(x) is the q-exponential used by Tsallis in nonextensive…
We consider a sequence of polynomials appearing in expressions for the derivatives of the Lambert W function. The coefficients of each polynomial are shown to form a positive sequence that is log-concave and unimodal. This property implies…
Verification of C++ programs has seen considerable progress in several areas, but not for programs that use these languages' mathematical libraries. The reason is that all libraries in widespread use come with no guarantees about the…
This paper provides a description of the algorithms employed by the Warwick AUTOMATA package for calculating the finite state automata associated with a short-lex automatic group. The aim is to provide an overview of the whole process,…
The paper deals with the problem of approximating the functions of several variables by branched continued fractions, in particular, multidimensional A- and J-fractions with independent variables. A generalization of Gragg's algorithm is…