Error estimates are a very important aspect of numerical integration. It is desirable to know what level of truncation error might be expected for a given number of integration points. Here, we determine estimates for the truncation error when Gauss-Legendre quadrature is applied to the numerical evaluation of two dimensional integrals which arise in the boundary element method. Two examples ar...

Filon-Simpson quadrature rules are derived for integrals of the type ∫ b a dx f(x) sin(xy)/(xy) and ∫ b a dx f(x) 4 sin(xy/2)/(xy) which are needed in applications of the worldline variational approach to Quantum Field Theory. These new integration rules reduce to the standard Simpson rule for y = 0 and are exact for y → ∞ when a = 0 and f(0) 6= 0. The subleading term in the asymptotic expansio...

This work is to provide general spectral and pseudo-spectral Jacobi-PetrovGalerkin approaches for the second kind Volterra integro-differential equations. The Gauss-Legendre quadrature formula is used to approximate the integral operator and the inner product based on the Jacobi weight is implemented in the weak formulation in the numerical implementation. For some spectral and pseudo-spectral ...

A semi-parametric mixed eeects regression model is proposed for the analysis of clustered or longitudinal data with continuous, ordinal or binary outcome. The commonly used Gaussian assumption on the random eeects distribution is relaxed as the partial predictive recursion method (Newton and Zhang, 1996) is used to estimate the random eeects density function. The parameter estimates are obtaine...

Legendre was the first to state the law of quadratic reciprocity in the form that we know it and he was able to prove it in some but not all cases, with the first complete proof being given by Gauss. In this paper we trace the evolution of Legendre’s work on quadratic reciprocity in his four great works on number theory. As is well known, Adrien-Marie Legendre (1752-1833) was the first to state...

Primes are of fundamental importance in number theory, and primality testing is one of the oldest problems in mathematics. Various algorithms have been presented over the past two millenia, ever since Eratosthenes detailed his eponymous sieve in 274 B.C. After important theoretical advances by Fermat, Euler, Legendre, and Gauss in the seventeeth and eighteenth centuries, the rise of computation...

We describe a technique to analytically compute the multipole moments of a charge distribution confined to a planar triangle, which may be useful in solving the Laplace equation using the fast multipole boundary element method (FMBEM) and for charged particle tracking. This algorithm proceeds by performing the necessary integration recursively within a specific coordinate system, and then trans...

In this thesis, an integrated approach is developed for the regional renement of global gravity eld solutions. The analysis concepts are tailored to the in-situ type character of the observations provided by the new satellite missions CHAMP, GRACE, and GOCE. They are able to evaluate data derived from short arcs of the satellite's orbit and, therefore, oer the opportunity to use regional satell...

Most of the reconstruction-based robust adaptive beamforming (RAB) algorithms require covariance matrix reconstruction (CMR) by high-complexity integral computation. A Gauss-Legendre quadrature (GLQ) method with highest algebraic precision in interpolation-type is proposed to reduce complexity. The interference angular sector RAB regarded as GLQ range, and zeros three-order Legendre orthogonal ...

was surmised already by Legendre and Gauss. However, it took a hundred years before the first proofs appeared, one by Hadamard and one by de la Vall~e Poussin (1896). Their and all but one of the subsequent proofs make heavy use of the Riemann zeta function. (The one exception is the long so-called elementary proof by Selberg [11] and Erd6s [41.) For Re s > 1 the zeta function is given by the D...