arXiv subjects

James Bremer

Publications and source records attributed to James Bremer.

26 records · Page 2Linked to original sources

arXiv2017

An algorithm for the rapid numerical evaluation of Bessel functions of real orders and arguments

We describe a method for the rapid numerical evaluation of the Bessel functions of the first and second kinds of nonnegative real orders and positive arguments. Our algorithm makes use of the well-known observation that although the Bessel functions themselves are expensive to represent via piecewise polynomial expansions, the logarithms of certain solutions of Bessel's equation are not. We exploit this observation by numerically precomputing the logarithms of carefully chosen Bessel functions and representing them with piecewise bivariate Chebyshev expansions. Our scheme is able to evaluate Bessel functions of orders between $0$ and $1\sep,000\sep,000\sep,000$ at essentially any positive real argument. In that regime, it is competitive with existing methods for the rapid evaluation of Bessel functions and has several advantages over them. First, our approach is quite general and can be readily applied to many other special functions which satisfy second order ordinary differential equations. Second, by calculating the logarithms of the Bessel functions rather than the Bessel functions themselves, we avoid many issues which arise from numerical overflow and underflow. Third, in the oscillatory regime, our algorithm calculates the values of a nonoscillatory phase function for Bessel's differential equation and its derivative. These quantities are useful for computing the zeros of Bessel functions, as well as for rapidly applying the Fourier-Bessel transform. The results of extensive numerical experiments demonstrating the efficacy of our algorithm are presented. A Fortran package which includes our code for evaluating the Bessel functions as well as our code for all of the numerical experiments described here is publically available.

math.NA↗

arXiv2017

On the nonoscillatory phase function for Legendre's differential equation

We express a certain complex-valued solution of Legendre's differential equation as the product of an oscillatory exponential function and an integral involving only nonoscillatory elementary functions. By calculating the logarithmic derivative of this solution, we show that Legendre's differential equation admits a nonoscillatory phase function. Moreover, we derive from our expression an asymptotic expansion useful for evaluating Legendre functions of the first and second kinds of large orders, as well as the derivative of the nonoscillatory phase function. Numerical experiments demonstrating the properties of our asymptotic expansion are presented.

math.NA↗

arXiv2016

On the numerical calculation of the roots of special functions satisfying second order ordinary differential equations

We describe a method for calculating the roots of special functions satisfying second order linear ordinary differential equations. It exploits the recent observation that the solutions of a large class of such equations can be represented via nonoscillatory phase functions, even in the high-frequency regime. Our algorithm achieves near machine precision accuracy and the time required to compute one root of a solution is independent of the frequency of oscillations of that solution. Moreover, despite its great generality, our approach is competitive with specialized, state-of-the-art methods for the construction of Gaussian quadrature rules of large orders when it used in such a capacity. The performance of the scheme is illustrated with several numerical experiments and a Fortran implementation of our algorithm is available at the author's website.

math.NA↗

arXiv2015

On the numerical solution of second order differential equations in the high-frequency regime

We describe an algorithm for the numerical solution of second order linear differential equations in the highly-oscillatory regime. It is founded on the recent observation that the solutions of equations of this type can be accurately represented using nonoscillatory phase functions. Unlike standard solvers for ordinary differential equations, the running time of our algorithm is independent of the frequency of oscillation of the solutions. We illustrate the performance of the method with several numerical experiments.

math.NA↗

arXiv2015

Improved estimates for nonoscillatory phase functions

Recently, it was observed that solutions of a large class of highly oscillatory second order linear ordinary differential equations can be approximated using nonoscillatory phase functions. In particular, under mild assumptions on the coefficients and wavenumber $λ$ of the equation, there exists a function whose Fourier transform decays as $\exp(-μ|ξ|)$ and which represents solutions of the differential equation with accuracy on the order of $λ^{-1} \exp(-μλ)$. In this article, we establish an improved existence theorem for nonoscillatory phase functions. Among other things, we show that solutions of second order linear ordinary differential equations can be represented with accuracy on the order of $λ^{-1} \exp(-μλ)$ using functions in the space of rapidly decaying Schwartz functions whose Fourier transforms are both exponentially decaying and compactly supported. These new observations play an important role in the analysis of a method for the numerical solution of second order ordinary differential equations whose running time is independent of the parameter $λ$. This algorithm will be reported at a later date.

math.CA↗

arXiv2014

On the asymptotics of Bessel functions in the Fresnel regime

We introduce a version of the asymptotic expansions for Bessel functions $J_ν(z)$, $Y_ν(z)$ that is valid whenever $|z| > ν$ (which is deep in the Fresnel regime), as opposed to the standard expansions that are applicable only in the Fraunhofer regime (i.e. when $|z| > ν^2$). As expected, in the Fraunhofer regime our asymptotics reduce to the classical ones. The approach is based on the observation that Bessel's equation admits a non-oscillatory phase function, and uses classical formulas to obtain an asymptotic expansion for this function; this in turn leads to both an analytical tool and a numerical scheme for the efficient evaluation of $J_ν(z)$, $Y_ν(z)$, as well as various related quantities. The effectiveness of the technique is demonstrated via several numerical examples. We also observe that the procedure admits far-reaching generalizations to wide classes of second order differential equations, to be reported at a later date.

math.NA↗

arXiv2014

On the existence of nonoscillatory phase functions for second order differential equations in the high-frequency regime

We observe that solutions of a large class of highly oscillatory second order linear ordinary differential equations can be approximated using nonoscillatory phase functions. In addition, we describe numerical experiments which illustrate important implications of this fact. For example, that many special functions of great interest --- such as the Bessel functions $J_ν$ and $Y_ν$ --- can be evaluated accurately using a number of operations which is $O(1)$ in the order $ν$. The present paper is devoted to the development of an analytical apparatus. Numerical aspects of this work will be reported at a later date.

math.NA↗

arXiv2013

A high-order accurate accelerated direct solver for acoustic scattering from surfaces

We describe an accelerated direct solver for the integral equations which model acoustic scattering from curved surfaces. Surfaces are specified via a collection of smooth parameterizations given on triangles, a setting which generalizes the typical one of triangulated surfaces, and the integral equations are discretized via a high-order Nystrom method. This allows for rapid convergence in cases in which high-order surface information is available. The high-order discretization technique is coupled with a direct solver based on the recursive construction of scattering matrices. The result is a solver which often attains $O(N^{1.5})$ complexity in the number of discretization nodes $N$ and which is resistant to many of the pathologies which stymie iterative solvers in the numerical simulation of scattering. The performance of the algorithm is illustrated with numerical experiments which involve the simulation of scattering from a variety of domains, including one consisting of a collection of 1000 ellipsoids with randomly oriented semiaxes arranged in a grid, and a domain whose boundary has 12 curved edges and 8 corner points.

math.NA↗