Consider a hermitian positive-definite linear functional F, and assume we have m distinct nodes fixed in advance anywhere on the real line. In this paper we then study the existence and construction of nth rational Gauss-Radau (m = 1) and Gauss-Lobatto (m = 2) quadrature formulas that approximate F{f}. These are quadrature formulas with n positive weights and with the n−m remaining nodes real a...

In this paper, we mainly study the superconvergence properties in approximation of second- and third-order BVPs by spectral collocation methods. The theoretical analyses identify points interpolation function. Ample numerical experiments are carried out which perfectly match results. addition, results show that also hold solving PDEs.

In this paper, An effective and simple numerical method is proposed for solving systems of integral equations using radial basis functions (RBFs). We present an algorithm based on interpolation by radial basis functions including multiquadratics (MQs), using Legendre-Gauss-Lobatto nodes and weights. Also a theorem is proved for convergence of the algorithm. Some numerical examples are presented...

Aunified framework is presented for the numerical solution of optimal control problems using collocation at Legendre–Gauss (LG), Legendre–Gauss–Radau (LGR), and Legendre–Gauss–Lobatto (LGL) points. It is shown that the LG and LGR differentiation matrices are rectangular and full rank whereas the LGL differentiation matrix is square and singular. Consequently, the LG and LGR schemes can be expre...

We present a family of four-point quadrature rule, a generalization of Gauss-two point, Simpson’s 3/8, and Lobatto four-point quadrature rule for twice-differentiable mapping. Moreover, it is shown that the corresponding optimal quadrature formula presents better estimate in the context of four-point quadrature formulae of closed type. A unified treatment of error inequalities for different cla...

A new adaptive quadrature algorithm that places a greater emphasis on cost reduction while still maintaining an acceptable accuracy is demonstrated. The different needs of science and engineering applications are highlighted as the existing algorithms are shown to be inadequate. The performance of the new algorithm is compared with the well known adaptive Simpson, Gauss-Lobatto and GaussKronrod...

This work presents a study on the performance of nodal bases on triangles and on quadrilaterals for discontinuous Galerkin solutions of hyperbolic conservation laws. A nodal basis on triangles and two tensor product nodal bases on quadrilaterals are considered. The quadrilateral element bases are constructed from the Lagrange interpolating polynomials associated with the Legendre–Gauss–Lobatto ...

Barycentric interpolation is arguably the method of choice for numerical polynomial interpolation. The polynomial interpolant is expressed in terms of function values using the so-called barycentric weights, which depend on the interpolation points. Few explicit formulae for these barycentric weights are known. In [H. Wang and S. Xiang, Math. Comp., 81 (2012), 861–877], the authors have shown t...

It is shown that the Kronrod extension to the «-point Gauss integration rule, with respect to the weight function (1 x2)V~"2, 0 < M < 2, ju i= 1, is of exact precision 3n + 1 for n even and 3n + 2 for n odd. Similarly, for the (n-t-l)-point Lobatto rule, with — V¡ < M < 1, u ^ 0, the exact precision is 3n for n odd and 3n + 1 for n even.

We propose and analyze a C spectral element method for a model eigenvalue problem with discontinuous coefficients in the one dimensional setting. A super-geometric rate of convergence is proved for the piecewise constant coefficients case and verified by numerical tests. Furthermore, the asymptotical equivalence between a Gauss-Lobatto collocation method and a spectral Galerkin method is establ...