200,428 research outputs found
Acceleration of generalized hypergeometric functions through precise remainder asymptotics
We express the asymptotics of the remainders of the partial sums {s_n} of the
generalized hypergeometric function q+1_F_q through an inverse power series z^n
n^l \sum_k c_k/n^k, where the exponent l and the asymptotic coefficients {c_k}
may be recursively computed to any desired order from the hypergeometric
parameters and argument. From this we derive a new series acceleration
technique that can be applied to any such function, even with complex
parameters and at the branch point z=1. For moderate parameters (up to
approximately ten) a C implementation at fixed precision is very effective at
computing these functions; for larger parameters an implementation in higher
than machine precision would be needed. Even for larger parameters, however,
our C implementation is able to correctly determine whether or not it has
converged; and when it converges, its estimate of its error is accurate.Comment: 36 pages, 6 figures, LaTeX2e. Fixed sign error in Eq. (2.28), added
several references, added comparison to other methods, and added discussion
of recursion stabilit
Persistence of a Continuous Stochastic Process with Discrete-Time Sampling: Non-Markov Processes
We consider the problem of `discrete-time persistence', which deals with the
zero-crossings of a continuous stochastic process, X(T), measured at discrete
times, T = n(\Delta T). For a Gaussian Stationary Process the persistence (no
crossing) probability decays as exp(-\theta_D T) = [\rho(a)]^n for large n,
where a = \exp[-(\Delta T)/2], and the discrete persistence exponent, \theta_D,
is given by \theta_D = \ln(\rho)/2\ln(a). Using the `Independent Interval
Approximation', we show how \theta_D varies with (\Delta T) for small (\Delta
T) and conclude that experimental measurements of persistence for smooth
processes, such as diffusion, are less sensitive to the effects of discrete
sampling than measurements of a randomly accelerated particle or random walker.
We extend the matrix method developed by us previously [Phys. Rev. E 64,
015151(R) (2001)] to determine \rho(a) for a two-dimensional random walk and
the one-dimensional random acceleration problem. We also consider `alternating
persistence', which corresponds to a < 0, and calculate \rho(a) for this case.Comment: 14 pages plus 8 figure
Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems
We introduce a new problem that combines the well known All Pairs Shortest
Paths (APSP) problem and the All Pairs Bottleneck Paths (APBP) problem to
compute the shortest paths for all pairs of vertices for all possible flow
amounts. We call this new problem the All Pairs Shortest Paths for All Flows
(APSP-AF) problem. We firstly solve the APSP-AF problem on directed graphs with
unit edge costs and real edge capacities in
time,
where is the number of vertices, is the number of distinct edge
capacities (flow amounts) and is the time taken
to multiply two -by- matrices over a ring. Secondly we extend the problem
to graphs with positive integer edge costs and present an algorithm with
worst case time complexity, where is
the upper bound on edge costs
- …