55 research outputs found
Formulas for Continued Fractions. An Automated Guess and Prove Approach
We describe a simple method that produces automatically closed forms for the
coefficients of continued fractions expansions of a large number of special
functions. The function is specified by a non-linear differential equation and
initial conditions. This is used to generate the first few coefficients and
from there a conjectured formula. This formula is then proved automatically
thanks to a linear recurrence satisfied by some remainder terms. Extensive
experiments show that this simple approach and its straightforward
generalization to difference and -difference equations capture a large part
of the formulas in the literature on continued fractions.Comment: Maple worksheet attache
Exact power spectra of Brownian motion with solid friction
We study a Langevin equation describing the Brownian motion of an object
subjected to a viscous drag, an external constant force, and a solid friction
force of the Coulomb type. In a previous work [H. Touchette, E. Van der
Straeten, W. Just, J. Phys. A: Math. Theor. 43, 445002, 2010], we have
presented the exact solution of the velocity propagator of this equation based
on a spectral decomposition of the corresponding Fokker-Planck equation. Here,
we present an alternative, exact solution based on the Laplace transform of
this equation, which has the advantage of being expressed in closed form. From
this solution, we also obtain closed-form expressions for the Laplace transform
of the velocity autocorrelation function and for the power spectrum, i.e., the
Fourier transform of the autocorrelation function. The behavior of the power
spectrum as a function of the dry friction force and external forcing shows a
clear crossover between stick and slip regimes known to occur in the presence
of solid friction.Comment: v1: 14 pages, 5 figures; v2: new figures, some text added, typos
correcte
Revisit Sparse Polynomial Interpolation based on Randomized Kronecker Substitution
In this paper, a new reduction based interpolation algorithm for black-box
multivariate polynomials over finite fields is given. The method is based on
two main ingredients. A new Monte Carlo method is given to reduce black-box
multivariate polynomial interpolation to black-box univariate polynomial
interpolation over any ring. The reduction algorithm leads to multivariate
interpolation algorithms with better or the same complexities most cases when
combining with various univariate interpolation algorithms. We also propose a
modified univariate Ben-or and Tiwarri algorithm over the finite field, which
has better total complexity than the Lagrange interpolation algorithm.
Combining our reduction method and the modified univariate Ben-or and Tiwarri
algorithm, we give a Monte Carlo multivariate interpolation algorithm, which
has better total complexity in most cases for sparse interpolation of black-box
polynomial over finite fields
Polya's inequalities, global uniform integrability and the size of plurisubharmonic lemniscates
First we prove a new inequality comparing uniformly the relative volume of a
Borel subset with respect to any given complex euclidean ball \B \sub \C^n
with its relative logarithmic capacity in \C^n with respect to the same ball
\B.
An analoguous comparison inequality for Borel subsets of euclidean balls of
any generic real subspace of \C^n is also proved.
Then we give several interesting applications of these inequalities.
First we obtain sharp uniform estimates on the relative size of \psh
lemniscates associated to the Lelong class of \psh functions of logarithmic
singularities at infinity on \C^n as well as the Cegrell class of
\psh functions of bounded Monge-Amp\`ere mass on a hyperconvex domain \W
\Sub \C^n.
Then we also deduce new results on the global behaviour of both the Lelong
class and the Cegrell class of \psh functions.Comment: 25 page
The inverse moment problem for convex polytopes
The goal of this paper is to present a general and novel approach for the
reconstruction of any convex d-dimensional polytope P, from knowledge of its
moments. In particular, we show that the vertices of an N-vertex polytope in
R^d can be reconstructed from the knowledge of O(DN) axial moments (w.r.t. to
an unknown polynomial measure od degree D) in d+1 distinct generic directions.
Our approach is based on the collection of moment formulas due to Brion,
Lawrence, Khovanskii-Pukhikov, and Barvinok that arise in the discrete geometry
of polytopes, and what variously known as Prony's method, or Vandermonde
factorization of finite rank Hankel matrices.Comment: LaTeX2e, 24 pages including 1 appendi
Accurate Results from Perturbation Theory for Strongly Frustrated Heisenberg Spin Clusters
We investigate the use of perturbation theory in finite sized frustrated spin
systems by calculating the effect of quantum fluctuations on coherent states
derived from the classical ground state. We first calculate the ground and
first excited state wavefunctions as a function of applied field for a 12-site
system and compare with the results of exact diagonalization. We then apply the
technique to a 20-site system with the same three fold site coordination as the
12-site system. Frustration results in asymptotically convergent series for
both systems which are summed with Pad\'e approximants.
We find that at zero magnetic field the different connectivity of the two
systems leads to a triplet first excited state in the 12-site system and a
singlet first excited state in the 20-site system, while the ground state is a
singlet for both. We also show how the analytic structure of the Pad\'e
approximants at evolves in the complex plane at
the values of the applied field where the ground state switches between spin
sectors and how this is connected with the non-trivial dependence of the
number on the strength of quantum fluctuations. We discuss the origin
of this difference in the energy spectra and in the analytic structures. We
also characterize the ground and first excited states according to the values
of the various spin correlation functions.Comment: Final version, accepted for publication in Physical review
Asymptotic Improvement of Resummation and Perturbative Predictions in Quantum Field Theory
The improvement of resummation algorithms for divergent perturbative
expansions in quantum field theory by asymptotic information about perturbative
coefficients is investigated. Various asymptotically optimized resummation
prescriptions are considered. The improvement of perturbative predictions
beyond the reexpansion of rational approximants is discussed.Comment: 21 pages, LaTeX, 3 tables; title shortened; typographical errors
corrected; minor changes of style; 2 references adde
Transition probabilities for general birth-death processes with applications in ecology, genetics, and evolution
A birth-death process is a continuous-time Markov chain that counts the
number of particles in a system over time. In the general process with
current particles, a new particle is born with instantaneous rate
and a particle dies with instantaneous rate . Currently no robust and
efficient method exists to evaluate the finite-time transition probabilities in
a general birth-death process with arbitrary birth and death rates. In this
paper, we first revisit the theory of continued fractions to obtain expressions
for the Laplace transforms of these transition probabilities and make explicit
an important derivation connecting transition probabilities and continued
fractions. We then develop an efficient algorithm for computing these
probabilities that analyzes the error associated with approximations in the
method. We demonstrate that this error-controlled method agrees with known
solutions and outperforms previous approaches to computing these probabilities.
Finally, we apply our novel method to several important problems in ecology,
evolution, and genetics
Adaptive Multidimensional Modeling with Applications in Scientific Computing
No abstract availabl
Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions
- …