Results 1  10
of
175
The FourierSeries Method For Inverting Transforms Of Probability Distributions
, 1991
"... This paper reviews the Fourierseries method for calculating cumulative distribution functions (cdf's) and probability mass functions (pmf's) by numerically inverting characteristic functions, Laplace transforms and generating functions. Some variants of the Fourierseries method are remar ..."
Abstract

Cited by 208 (52 self)
 Add to MetaCart
This paper reviews the Fourierseries method for calculating cumulative distribution functions (cdf's) and probability mass functions (pmf's) by numerically inverting characteristic functions, Laplace transforms and generating functions. Some variants of the Fourierseries method are remarkably easy to use, requiring programs of less than fifty lines. The Fourierseries method can be interpreted as numerically integrating a standard inversion integral by means of the trapezoidal rule. The same formula is obtained by using the Fourier series of an associated periodic function constructed by aliasing; this explains the name of the method. This Fourier analysis applies to the inversion problem because the Fourier coefficients are just values of the transform. The mathematical centerpiece of the Fourierseries method is the Poisson summation formula, which identifies the discretization error associated with the trapezoidal rule and thus helps bound it. The greatest difficulty is approximately calculating the infinite series obtained from the inversion integral. Within this framework, lattice cdf's can be calculated from generating functions by finite sums without truncation. For other cdf's, an appropriate truncation of the infinite series can be determined from the transform based on estimates or bounds. For Laplace transforms, the numerical integration can be made to produce a nearly alternating series, so that the convergence can be accelerated by techniques such as Euler summation. Alternatively, the cdf can be perturbed slightly by convolution smoothing or windowing to produce a truncation error bound independent of the original cdf. Although error bounds can be determined, an effective approach is to use two different methods without elaborate error analysis. For this...
Scaling limit for the spacetime covariance of the stationary totally asymmetric simple exclusion process
 Comm. Math. Phys
"... The totally asymmetric simple exclusion process (TASEP) on the onedimensional lattice with the Bernoulli ρ measure as initial conditions, 0 < ρ < 1, is stationary in space and time. Let Nt(j) be the number of particles which have crossed the bond from j to j + 1 during the time span [0,t]. Fo ..."
Abstract

Cited by 83 (30 self)
 Add to MetaCart
(Show Context)
The totally asymmetric simple exclusion process (TASEP) on the onedimensional lattice with the Bernoulli ρ measure as initial conditions, 0 < ρ < 1, is stationary in space and time. Let Nt(j) be the number of particles which have crossed the bond from j to j + 1 during the time span [0,t]. For j = (1 − 2ρ)t + 2w(ρ(1 − ρ)) 1/3 t 2/3 we prove that the fluctuations of Nt(j) for large t are of order t 1/3 and we determine the limiting distribution function Fw(s), which is a generalization of the GUE TracyWidom distribution. The family Fw(s) of distribution functions have been obtained before by Baik and Rains in the context of the PNG model with boundary sources, which requires the asymptotics of a RiemannHilbert problem. In our work we arrive at Fw(s) through the asymptotics of a Fredholm determinant. Fw(s) is simply related to the scaling function for the spacetime covariance of the stationary TASEP, equivalently to the asymptotic transition
Electromagnetic interactions of molecules with metal surfaces
, 1984
"... 2. Reflection of electromagnetic waves at an interface 198 metal 245 2.1. Reflection by a nonlocal medium—the SCIB model 201 4.2. Multipole polarizabilities 249 2.2. The quasistatic approximation 205 4.3. Shift and broadening of the vibrational mode 254 ..."
Abstract

Cited by 37 (0 self)
 Add to MetaCart
(Show Context)
2. Reflection of electromagnetic waves at an interface 198 metal 245 2.1. Reflection by a nonlocal medium—the SCIB model 201 4.2. Multipole polarizabilities 249 2.2. The quasistatic approximation 205 4.3. Shift and broadening of the vibrational mode 254
Representations of Orthogonal Polynomials
, 1998
"... Zeilberger's algorithm provides a method to compute recurrence and differential equations from given hypergeometric series representations, and an adaption of Almquist and Zeilberger computes recurrence and differential equations for hyperexponential integrals. Further versions of this algorith ..."
Abstract

Cited by 27 (10 self)
 Add to MetaCart
Zeilberger's algorithm provides a method to compute recurrence and differential equations from given hypergeometric series representations, and an adaption of Almquist and Zeilberger computes recurrence and differential equations for hyperexponential integrals. Further versions of this algorithm allow the computation of recurrence and differential equations from Rodrigues type formulas and from generating functions. In particular, these algorithms can be used to compute the differential/difference and recurrence equations for the classical continuous and discrete orthogonal polynomials from their hypergeometric representations, and from their Rodrigues representations and generating functions. In recent work, we used an explicit formula for the recurrence equation of families of classical continuous and discrete orthogonal polynomials, in terms of the coefficients of their differential/difference equations, to give an algorithm to identify the polynomial system from a given recurrence equation....
Nonlinear fractional dynamics of lattice with longrange interaction
, 2005
"... A unified approach has been developed to study nonlinear dynamics of a 1D lattice of particles with longrange powerlaw interaction. Classical case is treated in the framework of the wellknown FrenkelKontorova chain model. Qunatum dynamics is considered follow to Davydov’s approach to molecular e ..."
Abstract

Cited by 24 (4 self)
 Add to MetaCart
A unified approach has been developed to study nonlinear dynamics of a 1D lattice of particles with longrange powerlaw interaction. Classical case is treated in the framework of the wellknown FrenkelKontorova chain model. Qunatum dynamics is considered follow to Davydov’s approach to molecular excitons. In the continuum limit the problem is reduced to dynamical equations with fractional derivatives resulting from the fractional power of the longrange interaction. Fractional generalizations of the sineGordon, nonlinear Schrödinger, and HilbertSchrödinger equations have been found. There exists a critical value of the powers of the longrange potential. Below the critical value (s < 3, s ̸ = 1, 2) we obtain equations with fractional derivatives while for s> 3 we have the wellknown nonlinear dynamical equations with space derivatives of integer order. Longrange interaction impact on quantum lattice propagator has been studied. We have shown that the quantum exciton propagator exhibits transition from the wellknown Gaussianlike behavior to powerlaw decay due to longrange interaction. Link between 1D quantum lattice dynamics in the imanaginary time domain and random walk model has been discussed.
Congruences involving Bernoulli and Euler numbers
 J. Number Theory
"... Abstract. Let [x] be the integral part of x. Let p> 5 be a prime. In the paper 1 we mainly determineP[p/4] x=1 xk (mod p2 p−1), (mod p [p/4] ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
(Show Context)
Abstract. Let [x] be the integral part of x. Let p> 5 be a prime. In the paper 1 we mainly determineP[p/4] x=1 xk (mod p2 p−1), (mod p [p/4]
An efficient spectral method for ordinary differential equations with rational function coefficients
 Math. Comp
, 1996
"... Abstract. We present some relations that allow the efficient approximate inversion of linear differential operators with rational function coefficients. We employ expansions in terms of a large class of orthogonal polynomial families, including all the classical orthogonal polynomials. These familie ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
(Show Context)
Abstract. We present some relations that allow the efficient approximate inversion of linear differential operators with rational function coefficients. We employ expansions in terms of a large class of orthogonal polynomial families, including all the classical orthogonal polynomials. These families obey a simple 3term recurrence relation for differentiation, which implies that on an appropriately restricted domain the differentiation operator has a unique banded inverse. The inverse is an integration operator for the family, and it is simply the tridiagonal coefficient matrix for the recurrence. Since in these families convolution operators (i.e., matrix representations of multiplication by a function) are banded for polynomials, we are able to obtain a banded representation for linear differential operators with rational coefficients. This leads to a method of solution of initial or boundary value problems that, besides having an operation count that scales linearly with the order of truncation N, is computationally well conditioned. Among the applications considered is the use of rational maps for the resolution of sharp interior layers. 1.
From Useful Algorithms for Slowly Convergent Series to Physical Predictions Based on Divergent Perturbative Expansions
, 707
"... This review is focused on the borderline region of theoretical physics and mathematics. First, we describe numerical methods for the acceleration of the convergence of series. These provide a useful toolbox for theoretical physics which has hitherto not received the attention it actually deserves. T ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
(Show Context)
This review is focused on the borderline region of theoretical physics and mathematics. First, we describe numerical methods for the acceleration of the convergence of series. These provide a useful toolbox for theoretical physics which has hitherto not received the attention it actually deserves. The unifying concept for convergence acceleration methods is that in many cases, one can reach much faster convergence than by adding a particular series term by term. In some cases, it is even possible to use a divergent input series, together with a suitable sequence transformation, for the construction of numerical methods that can be applied to the calculation of special functions. This review both aims to provide some practical guidance as well as a groundwork for the study of specialized literature. As a second topic, we review some recent developments in the field of Borel resummation, which is generally recognized as one of the most versatile methods for the summation of factorially divergent (perturbation) series. Here, the focus is on algorithms which make optimal use of all information contained in a finite set of perturbative coefficients. The unifying concept for the various aspects of the Borel method investigated here is