AbstractIn this paper a recurrence formula for the computation of Mk = ∫−1+1 (1 − x)α(1 + x)β exp[−a/(1+x)]Tk(x)dx is presented. The numerical stability is discussed. The starting values are confluent hypergeometric functions which can be evaluated using Luke's results on Chebyshev series expansions and Padé approximations of hypergeometric functions. Applications of this recurrence relation are the evaluation of the Fourier transform of singular functions by modified Clenshaw-Curtis integration, the construction of Gaussian quadrature formulae for Fourier integrals and the numerical inversion of the Laplace transform
This paper describes methods that are important for the numerical evaluation of certain functions th...
Abstract. A modification of the Poincaré-type asymptotic expansion for functions defined by Laplace...
AbstractWe prove a recursion formula for generating functions of certain renormalizations of ∗-momen...
AbstractIn this paper we consider a method for the computation of finite Fourier transforms of funct...
AbstractThe well-known correspondence of a power series with a certain Stieltjes integral is exploit...
AbstractThis paper gives a survey of the use of Chebyshev polynomials in the computation and the inv...
AbstractTo evaluate the class of integrals ∫1−1e−αxƒ(x) dx, where R† and the function f(x) is known ...
This paper investigates the implementation of Clenshaw–Curtis algorithms on singular and highly osci...
AbstractA nonadaptive automatic integration scheme using Clenshaw-Curtis quadrature is presented. Ex...
AbstractA computationally efficient algorithm for evaluating Fourier integrals ∫1−1⨍(x)eiωxdx using ...
AbstractWe introduce an efficient and easily implemented numerical method for the inversion of Lapla...
In the first part of this dissertation we establish several new theorems in multidimensional inverse...
AbstractThe singular integral S = ∫0∞ f(x)e−x J0(ωx) dx, related to the Hankel transform of order 0,...
This project presents a modified method of numerical integration for a “well behaved� function o...
AbstractWe use results of some preceding papers (see [1–3]) in order to derive two discretization fo...
This paper describes methods that are important for the numerical evaluation of certain functions th...
Abstract. A modification of the Poincaré-type asymptotic expansion for functions defined by Laplace...
AbstractWe prove a recursion formula for generating functions of certain renormalizations of ∗-momen...
AbstractIn this paper we consider a method for the computation of finite Fourier transforms of funct...
AbstractThe well-known correspondence of a power series with a certain Stieltjes integral is exploit...
AbstractThis paper gives a survey of the use of Chebyshev polynomials in the computation and the inv...
AbstractTo evaluate the class of integrals ∫1−1e−αxƒ(x) dx, where R† and the function f(x) is known ...
This paper investigates the implementation of Clenshaw–Curtis algorithms on singular and highly osci...
AbstractA nonadaptive automatic integration scheme using Clenshaw-Curtis quadrature is presented. Ex...
AbstractA computationally efficient algorithm for evaluating Fourier integrals ∫1−1⨍(x)eiωxdx using ...
AbstractWe introduce an efficient and easily implemented numerical method for the inversion of Lapla...
In the first part of this dissertation we establish several new theorems in multidimensional inverse...
AbstractThe singular integral S = ∫0∞ f(x)e−x J0(ωx) dx, related to the Hankel transform of order 0,...
This project presents a modified method of numerical integration for a “well behaved� function o...
AbstractWe use results of some preceding papers (see [1–3]) in order to derive two discretization fo...
This paper describes methods that are important for the numerical evaluation of certain functions th...
Abstract. A modification of the Poincaré-type asymptotic expansion for functions defined by Laplace...
AbstractWe prove a recursion formula for generating functions of certain renormalizations of ∗-momen...