Related papers: Computation of parabolic cylinder functions having…
Methods and an algorithm for computing the generalized Marcum $Q-$function ($Q_{\mu}(x,y)$) and the complementary function ($P_{\mu}(x,y)$) are described. These functions appear in problems of different technical and scientific areas such…
The NumericalHilbert package for Macaulay2 includes algorithms for computing local dual spaces of polynomial ideals, and related local combinatorial data about its scheme structure. These techniques are numerically stable, and can be used…
Uniform asymptotic approximations are obtained for the prolate spheroidal wave functions, in the high-frequency case. The results are obtained by an application of certain existing asymptotic solutions of differential equations, and involve…
The Euler-MacLaurin summation formula relates a sum of a function to a corresponding integral, with a remainder term. The remainder term has an asymptotic expansion, and for a typical analytic function, it is a divergent (Gevrey-1) series.…
Simple asymptotic expansions for the Jacobi functions $P_\nu^{(\alpha, \beta)}(z)$ and $Q_\nu^{(\alpha, \beta)}(z)$ for large degree $\nu$, with fixed parameters $\alpha$ and $\beta$, are surprisingly rare in the literature, with only a few…
We present a space-time multiscale method for a parabolic model problem with an underlying coefficient that may be highly oscillatory with respect to both the spatial and the temporal variables. The method is based on the framework of the…
The parabolic functions are introduced in analogy to the circular and hyperbolic cases. We discuss the relevant properties, the geometrical interpretation and touch on possible generalizations and their link with the modular elliptic…
In the paper, by virtue of expansions of two finite products of finitely many square sums, with the aid of series expansions of composite functions of (hyperbolic) sine and cosine functions with inverse sine and cosine functions, and in the…
Polyhedral projection is a main operation of the polyhedron abstract domain.It can be computed via parametric linear programming (PLP), which is more efficient than the classic Fourier-Motzkin elimination method.In prior work, PLP was done…
We discuss two theorems in analytic number theory and combinatory analysis that have seen increased use in recent years. A corollary to a Tauberian theorem of Ingham allows one to quickly prove asymptotic formulas for arithmetic sequences,…
Euler Maclaurin formulas for a polytope express the sum of the values of a function over the lattice points in the polytope in terms of integrals of the function and its derivatives over faces of the polytope or its expansions. Exact Euler…
Algorithms for numerical computation of symmetric elliptic integrals of all three kinds are improved in several ways and extended to complex values of the variables (with some restrictions in the case of the integral of the third kind).…
We derive global analytic representations of fundamental solutions for a class of linear parabolic systems with full coupling of first order derivative terms where coefficient may depend on space and time. Pointwise convergence of the…
A rapidly convergent series, based on Taylor expansion of the imaginary part of the complex error function, is presented for highly accurate approximation of the Voigt/complex error function with small imaginary argument (Y less than 0.1).…
The two most commonly used hypergeometric functions are the confluent hypergeometric function and the Gauss hypergeometric function. We review the available techniques for accurate, fast, and reliable computation of these two hypergeometric…
We provide representations of Euler's constant $\gamma=0.577...$ as series which converge geometrically fast (but use coefficients whose computation induces a quadratic cost). The asymptotic oscillations of these coefficients are discussed.
In this paper, by using the method of Contour Integral Representations and the Theorem of Residues and integral representations of series, we discuss the analytic representa- tions of parametric Euler sums that involve harmonic numbers…
In this paper, we give an explicit computable algorithm for the Zelevinsky-Aubert dual of irreducible representations of $p$-adic symplectic and odd special orthogonal groups. To do this, we establish explicit formulas for certain…
In studying the complexity of iterative processes it is usually assumed that the arithmetic operations of addition, multiplication, and division can be performed in certain constant times. This assumption is invalid if the precision…
This paper aims to derive explicit and computable error bounds for the asymptotic expansion of the Jacobi polynomials as their degree approaches infinity, using an integral method. The analysis focuses on the outer or oscillatory region of…