AbstractThe method of convolution algebra is used to compute values of the exponential type integral ezE1(z), by expansion of the integrand in a string of Taylor series' along the real s-axis for any complex parameter z, accurate within ±1 of the last digit of seven-digit computation. Accuracy is verified by comparison with existing tables of E1 and related integrals. This method is used to assess the accuracy of the error estimates of all subsequent computations.Three errors of a Taylor series are identified. These consist of a Taylor series truncation error, a digital truncation error, and a stability error. Methods are developed to estimate the error. By iteration a numerical radius of convergence for a given accuracy is determined.The ...
We show that a Fourier expansion of the exponential multiplier yields an exponential series that can...
In this note a Fredholm integral equation of the first kind with exponential expressions for the ker...
A new algorithm is developed for computing $e^{tA}B$, where $A$ is an $n\times n$ matrix and $B$ is ...
AbstractThe method of convolution algebra is used to compute values of the exponential type integral...
AbstractWe present a method for evaluation of the exponential integral, Es(x), generalized to an arb...
AbstractAn analysis of the rate of convergence is made for the interpolation series based on the bio...
Abstract We present a method for evaluation of the exponential integral, E s ( x ), generalized ...
Among the fastest methods for solving stiff PDE are exponential integrators, which require the evalu...
AbstractAn adaptation of the decomposition method allows one to calculate an integral not expressibl...
AbstractConvolution number is a new proposed name for the sequence of numbers that constitute the co...
A spline-based integral approximation is utilized to define a sequence of approximations to the erro...
AbstractLet (Sn) be the sequence given by the Jacobi-Gauss quadrature method when the integrand is a...
The matrix exponential is a much-studied matrix function having many applications. The Fr\'echet der...
AbstractThe accurate and efficient computation of the special functions Gk(x) is discussed, whereGk(...
We present a variant of the classical integration by parts to introduce a new type of Taylor series ...
We show that a Fourier expansion of the exponential multiplier yields an exponential series that can...
In this note a Fredholm integral equation of the first kind with exponential expressions for the ker...
A new algorithm is developed for computing $e^{tA}B$, where $A$ is an $n\times n$ matrix and $B$ is ...
AbstractThe method of convolution algebra is used to compute values of the exponential type integral...
AbstractWe present a method for evaluation of the exponential integral, Es(x), generalized to an arb...
AbstractAn analysis of the rate of convergence is made for the interpolation series based on the bio...
Abstract We present a method for evaluation of the exponential integral, E s ( x ), generalized ...
Among the fastest methods for solving stiff PDE are exponential integrators, which require the evalu...
AbstractAn adaptation of the decomposition method allows one to calculate an integral not expressibl...
AbstractConvolution number is a new proposed name for the sequence of numbers that constitute the co...
A spline-based integral approximation is utilized to define a sequence of approximations to the erro...
AbstractLet (Sn) be the sequence given by the Jacobi-Gauss quadrature method when the integrand is a...
The matrix exponential is a much-studied matrix function having many applications. The Fr\'echet der...
AbstractThe accurate and efficient computation of the special functions Gk(x) is discussed, whereGk(...
We present a variant of the classical integration by parts to introduce a new type of Taylor series ...
We show that a Fourier expansion of the exponential multiplier yields an exponential series that can...
In this note a Fredholm integral equation of the first kind with exponential expressions for the ker...
A new algorithm is developed for computing $e^{tA}B$, where $A$ is an $n\times n$ matrix and $B$ is ...