Computing Fresnel integrals via modified trapezium rules

In this paper we propose methods for computing Fresnel integrals based on truncated trapezium rule approximations to integrals on the real line, these trapezium rules modified to take into account poles of the integrand near the real axis. Our starting point is a method for computation of the error function of complex argument due to Matta and Reichel (J Math Phys 34:298–307, 1956) and Hunter and Regan (Math Comp 26:539–541, 1972). We construct approximations which we prove are exponentially convergent as a function of N , the number of quadrature points, obtaining explicit error bounds which show that accuracies of 10−15 uniformly on the real line are achieved with N=12 , this confirmed by computations. The approximations we obtain are attractive, additionally, in that they maintain small relative errors for small and large argument, are analytic on the real axis (echoing the analyticity of the Fresnel integrals), and are straightforward to implement

Effect of spatial configuration of an extended nonlinear Kierstead-Slobodkin reaction-transport model with adaptive numerical scheme

In this paper, we consider the numerical simulations of an extended nonlinear form of Kierstead-Slobodkin reaction-transport system in one and two dimensions. We employ the popular fourth-order exponential time differencing Runge-Kutta (ETDRK4) schemes proposed by Cox and Matthew (J Comput Phys 176:430-455, 2002), that was modified by Kassam and Trefethen (SIAM J Sci Comput 26:1214-1233, 2005), for the time integration of spatially discretized partial differential equations. We demonstrate the supremacy of ETDRK4 over the existing exponential time differencing integrators that are of standard approaches and provide timings and error comparison. Numerical results obtained in this paper have granted further insight to the question "What is the minimal size of the spatial domain so that the population persists?" posed by Kierstead and Slobodkin (J Mar Res 12:141-147, 1953 ), with a conclusive remark that the popula- tion size increases with the size of the domain. In attempt to examine the biological wave phenomena of the solutions, we present the numerical results in both one- and two-dimensional space, which have interesting ecological implications. Initial data and parameter values were chosen to mimic some existing patternsScopus 201

Numerical instability of the Akhmediev breather and a finite-gap model of it

In this paper we study the numerical instabilities of the NLS Akhmediev breather, the simplest space periodic, one-mode perturbation of the unstable background, limiting our considerations to the simplest case of one unstable mode. In agreement with recent theoretical findings of the authors, in the situation in which the round-off errors are negligible with respect to the perturbations due to the discrete scheme used in the numerical experiments, the split-step Fourier method (SSFM), the numerical output is well-described by a suitable genus 2 finite-gap solution of NLS. This solution can be written in terms of different elementary functions in different time regions and, ultimately, it shows an exact recurrence of rogue waves described, at each appearance, by the Akhmediev breather. We discover a remarkable empirical formula connecting the recurrence time with the number of time steps used in the SSFM and, via our recent theoretical findings, we establish that the SSFM opens up a vertical unstable gap whose length can be computed with high accuracy, and is proportional to the inverse of the square of the number of time steps used in the SSFM. This neat picture essentially changes when the round-off error is sufficiently large. Indeed experiments in standard double precision show serious instabilities in both the periods and phases of the recurrence. In contrast with it, as predicted by the theory, replacing the exact Akhmediev Cauchy datum by its first harmonic approximation, we only slightly modify the numerical output. Let us also remark, that the first rogue wave appearance is completely stable in all experiments and is in perfect agreement with the Akhmediev formula and with the theoretical prediction in terms of the Cauchy data.Comment: 27 pages, 8 figures, Formula (30) at page 11 was corrected, arXiv admin note: text overlap with arXiv:1707.0565

Numerical methods for the computation of the confluent and Gauss hypergeometric functions

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 functions in different parameter and variable regimes. The methods that we investigate include Taylor and asymptotic series computations, Gauss-Jacobi quadrature, numerical solution of differential equations, recurrence relations, and others. We discuss the results of numerical experiments used to determine the best methods, in practice, for each parameter and variable regime considered. We provide 'roadmaps' with our recommendation for which methods should be used in each situation

Numerical integration of periodic functions: A few examples

NatuurwetenskappeToegepaste WiskundePlease help us populate SUNScholar with the post print version of this article. It can be e-mailed to: [email protected]

Pad#&233 approximations to the logarithm I: Derivation via defferential equations

No Abstract. Quaestiones Mathematicae. Vol.28 (3) 2005: pp. 375-39

A MATLAB differentiation matrix suite

NatuurwetenskappeToegepaste WiskundePlease help us populate SUNScholar with the post print version of this article. It can be e-mailed to: [email protected]

Quadrature rules based on partial fraction expansions.

NatuurwetenskappeToegepaste WiskundePlease help us populate SUNScholar with the post print version of this article. It can be e-mailed to: [email protected]

Exponential node clustering at singularities for rational approximation, quadrature, and PDEs

Rational approximations of functions with singularities can converge at a root-exponential rate if the poles are exponentially clustered. We begin by reviewing this effect in minimax, least-squares, and AAA approximations on intervals and complex domains, conformal mapping, and the numerical solution of Laplace, Helmholtz, and biharmonic equations by the “lightning” method. Extensive and wide-ranging numerical experiments are involved. We then present further experiments giving evidence that in all of these applications, it is advantageous to use exponential clustering whose density on a logarithmic scale is not uniform but tapers off linearly to zero near the singularity. We propose a theoretical model of the tapering effect based on the Hermite contour integral and potential theory, which suggests that tapering doubles the rate of convergence. Finally we show that related mathematics applies to the relationship between exponential (not tapered) and doubly exponential (tapered) quadrature formulas. Here it is the Gauss–Takahasi–Mori contour integral that comes into play