Let p be an odd prime and {χ(m) = (m/p)}, m = 0,1, . . . ,p − 1 be a finite arithmetic sequence with elements the values of a Dirichlet character χ modp which are defined in terms of the Legendre symbol (m/p), (m,p)= 1. We study the relation between the Gauss and the quadratic Gauss sums. It is shown that the quadratic Gauss sumsG(k;p) are equal to the Gauss sums G(k,χ) that correspond to this ...

Nodal point sets, and associated collocation projections, play an important role in a range of high-order methods, including Flux Reconstruction (FR) schemes. Historically, efforts have focused on identifying nodal sets that aim to minimise the L∞ error interpolating polynomial. The present work combines comprehensive review known approximation theory results, with new numerical experiments, mo...

In this paper, we present an entropy-stable Gauss collocation discontinuous Galerkin (DG) method on 3D curvilinear meshes for the GLM-MHD equations: single-fluid magneto-hydrodynamics (MHD) equations with a generalized Lagrange multiplier (GLM) divergence cleaning mechanism. For continuous entropy analysis to hold and ensure Galilean invariance in technique, system requires use of non-conservat...

We extend the Chebyshev-Legendre spectral method to multi-domain case for solving the two-dimensional vorticity equations. The schemes are formulated in Legendre-Galerkinmethod while the nonlinear term is collocated at Chebyshev-Gauss collocation points. We introduce proper basis functions in order that the matrix of algebraic system is sparse. The algorithm can be implemented efficiently and i...

Abstract We show that the determinant of a Hankel matrix of odd dimension n whose entries are the enumerators of the Jacobi symbols which depend on the row and the column indices vanishes iff n is composite. If the dimension is a prime p, then the determinant evaluates to a polynomial of degree p−1 which is the product of a power of p and the generating polynomial of the partial sums of Legendr...

In this paper, we consider numerical differentiation of bivariate functions when a set of noisy data is given. A mollification method based on spanned by Legendre polynomials is proposed and the mollification parameter is chosen by a discrepancy principle. The theoretical analyses show that the smoother the genuine solution, the higher the convergence rates of the numerical solution. To get a p...

Other machines on which the adaption has been tested: CRAY-i Other machines on which the adaption has been tested: CRAY-i and 1BM4341/2 No. of bits in a byte: 8 No. of bits in a byte: 8 No. of lines required to effect adaptation: 190 No. of lines required to effect adaptation: 215 Additional keywords: spherical oscillator functions . Additional keywords: Gauss—Legendre quadrature, isotopic subs...

In this paper, an effective technique is proposed to determine thenumerical solution of nonlinear Volterra-Fredholm integralequations (VFIEs) which is based on interpolation by the hybrid ofradial basis functions (RBFs) including both inverse multiquadrics(IMQs), hyperbolic secant (Sechs) and strictly positive definitefunctions. Zeros of the shifted Legendre polynomial are used asthe collocatio...

In this paper‎, ‎we decide to select the best center nodes‎ ‎of radial basis functions by applying the Multiple Criteria Decision‎ ‎Making (MCDM) techniques‎. ‎Two methods based on radial basis‎ ‎functions to approximate the solution of partial differential‎ ‎equation by using collocation method are applied‎. ‎The first is based‎ ‎on the Kansa's approach‎, ‎and the second is based on the Hermit...