5,412 research outputs found
Computing hypergeometric functions rigorously
We present an efficient implementation of hypergeometric functions in
arbitrary-precision interval arithmetic. The functions , ,
and (or the Kummer -function) are supported for
unrestricted complex parameters and argument, and by extension, we cover
exponential and trigonometric integrals, error functions, Fresnel integrals,
incomplete gamma and beta functions, Bessel functions, Airy functions, Legendre
functions, Jacobi polynomials, complete elliptic integrals, and other special
functions. The output can be used directly for interval computations or to
generate provably correct floating-point approximations in any format.
Performance is competitive with earlier arbitrary-precision software, and
sometimes orders of magnitude faster. We also partially cover the generalized
hypergeometric function and computation of high-order parameter
derivatives.Comment: v2: corrected example in section 3.1; corrected timing data for case
E-G in section 8.5 (table 6, figure 2); adjusted paper siz
High-order, Dispersionless "Fast-Hybrid" Wave Equation Solver. Part I: Sampling Cost via Incident-Field Windowing and Recentering
This paper proposes a frequency/time hybrid integral-equation method for the
time dependent wave equation in two and three-dimensional spatial domains.
Relying on Fourier Transformation in time, the method utilizes a fixed
(time-independent) number of frequency-domain integral-equation solutions to
evaluate, with superalgebraically-small errors, time domain solutions for
arbitrarily long times. The approach relies on two main elements, namely, 1) A
smooth time-windowing methodology that enables accurate band-limited
representations for arbitrarily-long time signals, and 2) A novel Fourier
transform approach which, in a time-parallel manner and without causing
spurious periodicity effects, delivers numerically dispersionless
spectrally-accurate solutions. A similar hybrid technique can be obtained on
the basis of Laplace transforms instead of Fourier transforms, but we do not
consider the Laplace-based method in the present contribution. The algorithm
can handle dispersive media, it can tackle complex physical structures, it
enables parallelization in time in a straightforward manner, and it allows for
time leaping---that is, solution sampling at any given time at
-bounded sampling cost, for arbitrarily large values of ,
and without requirement of evaluation of the solution at intermediate times.
The proposed frequency-time hybridization strategy, which generalizes to any
linear partial differential equation in the time domain for which
frequency-domain solutions can be obtained (including e.g. the time-domain
Maxwell equations), and which is applicable in a wide range of scientific and
engineering contexts, provides significant advantages over other available
alternatives such as volumetric discretization, time-domain integral equations,
and convolution-quadrature approaches.Comment: 33 pages, 8 figures, revised and extended manuscript (and now
including direct comparisons to existing CQ and TDIE solver implementations)
(Part I of II
Computing Periods of Hypersurfaces
We give an algorithm to compute the periods of smooth projective
hypersurfaces of any dimension. This is an improvement over existing algorithms
which could only compute the periods of plane curves. Our algorithm reduces the
evaluation of period integrals to an initial value problem for ordinary
differential equations of Picard-Fuchs type. In this way, the periods can be
computed to extreme-precision in order to study their arithmetic properties.
The initial conditions are obtained by an exact determination of the cohomology
pairing on Fermat hypersurfaces with respect to a natural basis.Comment: 33 pages; Final version. Fixed typos, minor expository changes.
Changed code repository lin
PolyLogTools - Polylogs for the masses
We review recent developments in the study of multiple polylogarithms,
including the Hopf algebra of the multiple polylogarithms and the symbol map,
as well as the construction of single valued multiple polylogarithms and
discuss an algorithm for finding fibration bases. We document how these
algorithms are implemented in the Mathematica package PolyLogTools and show how
it can be used to study the coproduct structure of polylogarithmic expressions
and how to compute iterated parametric integrals over polylogarithmic
expressions that show up in Feynman integal computations at low loop orders.Comment: Package URL: https://gitlab.com/pltteam/pl
Variational Approach in Wavelet Framework to Polynomial Approximations of Nonlinear Accelerator Problems
In this paper we present applications of methods from wavelet analysis to
polynomial approximations for a number of accelerator physics problems.
According to variational approach in the general case we have the solution as a
multiresolution (multiscales) expansion in the base of compactly supported
wavelet basis. We give extension of our results to the cases of periodic
orbital particle motion and arbitrary variable coefficients. Then we consider
more flexible variational method which is based on biorthogonal wavelet
approach. Also we consider different variational approach, which is applied to
each scale.Comment: LaTeX2e, aipproc.sty, 21 Page
High-precision computation of uniform asymptotic expansions for special functions
In this dissertation, we investigate new methods to obtain uniform asymptotic expansions for the numerical evaluation of special functions to high-precision. We shall first present the theoretical and computational fundamental aspects required for the development and ultimately implementation of such methods. Applying some of these methods, we obtain efficient new convergent and uniform expansions for numerically evaluating the confluent hypergeometric functions and the Lerch transcendent at high-precision. In addition, we also investigate a new scheme of computation for the generalized exponential integral, obtaining on the fastest and most robust implementations in double-precision floating-point arithmetic.
In this work, we aim to combine new developments in asymptotic analysis with fast and effective open-source implementations. These implementations are comparable and often faster than current open-source and commercial stateof-the-art software for the evaluation of special functions.Esta tesis presenta nuevos métodos para obtener expansiones uniformes asintóticas, para la evaluación numérica de funciones especiales en alta precisión. En primer lugar, se introducen fundamentos teóricos y de carácter computacional necesarios para el desarrollado y posterior implementación de tales métodos. Aplicando varios de dichos métodos, se obtienen nuevas expansiones uniformes convergentes para la evaluación numérica de las funciones hipergeométricas confluentes y de la función transcendental de Lerch. Por otro lado, se estudian nuevos esquemas de computo para evaluar la integral exponencial generalizada, desarrollando una de las implementaciones más eficientes y robustas en aritmética de punto flotante de doble precisión. En este trabajo, se combinan nuevos desarrollos en análisis asintótico con implementaciones rigurosas, distribuidas en código abierto. Las implementaciones resultantes son comparables, y en ocasiones superiores, a las soluciones comerciales y de código abierto actuales, que representan el estado de la técnica en el campo de la evaluación de funciones especiales
High-precision computation of uniform asymptotic expansions for special functions
In this dissertation, we investigate new methods to obtain uniform asymptotic expansions for the numerical evaluation of special functions to high-precision. We shall first present the theoretical and computational fundamental aspects required for the development and ultimately implementation of such methods. Applying some of these methods, we obtain efficient new convergent and uniform expansions for numerically evaluating the confluent hypergeometric functions and the Lerch transcendent at high-precision. In addition, we also investigate a new scheme of computation for the generalized exponential integral, obtaining on the fastest and most robust implementations in double-precision floating-point arithmetic.
In this work, we aim to combine new developments in asymptotic analysis with fast and effective open-source implementations. These implementations are comparable and often faster than current open-source and commercial stateof-the-art software for the evaluation of special functions.Esta tesis presenta nuevos métodos para obtener expansiones uniformes asintóticas, para la evaluación numérica de funciones especiales en alta precisión. En primer lugar, se introducen fundamentos teóricos y de carácter computacional necesarios para el desarrollado y posterior implementación de tales métodos. Aplicando varios de dichos métodos, se obtienen nuevas expansiones uniformes convergentes para la evaluación numérica de las funciones hipergeométricas confluentes y de la función transcendental de Lerch. Por otro lado, se estudian nuevos esquemas de computo para evaluar la integral exponencial generalizada, desarrollando una de las implementaciones más eficientes y robustas en aritmética de punto flotante de doble precisión. En este trabajo, se combinan nuevos desarrollos en análisis asintótico con implementaciones rigurosas, distribuidas en código abierto. Las implementaciones resultantes son comparables, y en ocasiones superiores, a las soluciones comerciales y de código abierto actuales, que representan el estado de la técnica en el campo de la evaluación de funciones especiales.Postprint (published version
- …