The objective of this paper is to analyse the application of the Half-Sweep Gauss-Seidel (HSGS) method by using the Half-sweep approximation equation based on central difference (CD) and repeated trapezoidal (RT) formulas to solve linear fredholm integro-differential equations of first order. The formulation and implementation of the Full-Sweep Gauss-Seidel (FSGS) and HalfSweep Gauss-Seidel (HS...

A class of formulas for the numerical evaluation of multiple integrals is described, which combines features of the Monte-Carlo and the classical methods. For certain classes of functions—defined by smoothness conditions—these formulas provide the fastest possible rate of convergence to the integral. Asymptotic error estimates are derived, and a method is described for obtaining good a posterio...

The effect of numerical quadrature in finite element methods for solving quasilinear elliptic problems of nonmonotone type is studied. Under similar assumption on the quadrature formula as for linear problems, optimal error estimates in the L2 and the H1 norms are proved. The numerical solution obtained from the finite element method with quadrature formula is shown to be unique for a sufficien...

We derive in this paper the asymptotic estimates of the nodes and weights of the Gauss-Lobatto-Legendre-Birkhoff (GLLB) quadrature formula, and obtain optimal error estimates for the associated GLLB interpolation in Jacobi weighted Sobolev spaces. We also present a useroriented implementation of the pseudospectral methods based on the GLLB quadrature nodes for Neumann problems. This approach al...

The Jacobi matrix of the (2n+1)-point Gauss-Kronrod quadrature rule for a given measure is calculated efficiently by a five-term recurrence relation. The algorithm uses only rational operations and is therefore also useful for obtaining the Jacobi-Kronrod matrix analytically. The nodes and weights can then be computed directly by standard software for Gaussian quadrature formulas.

In this paper, we propose and analyze a new predictor-corrector method for solving a nonlinear system of equations using the weight combination of mid-point, Trapezoidal and quadrature formulas. A new algorithm based on this method has been presented. The proposed method has been tested on a series of examples published in the literature and shows good results. Comparison with other similar met...

Gaussian formulas are among the most often used quadrature formulas in practice. In this survey, an overview is given on stopping functionals for Gaussian formulas which are of the same type as quadrature formulas, i.e., linear combinations of function evaluations. In particular, methods based on extended formulas like the important Gauss-Kronrod and Patterson schemes, and methods which are bas...

Restarting GMRES, a linear solver frequently used in numerical schemes, is known to suffer from stagnation. In this paper, a simple strategy is proposed to detect and avoid stagnation, without modifying the standard GMRES code. Numerical tests with the modified GMRES(m), GMRESH(m) procedure, alone and as part of an inexact Newton procedure with several choices for the forcing term, demonstrate ...

This paper investigates the global chaos synchronization of identical hyperchaotic Newton-Leipnik systems (Ghosh and Bhattacharya, 2010) by sliding mode control. The stability results derived in this paper for the complete synchronization of identical hyperchaotic Newton-Leipnik chaotic systems are established using Lyapunov stability theory. Since the Lyapunov exponents are not required for th...

Gauss and Clenshaw–Curtis quadrature, like Legendre and Chebyshev spectral methods, make use of grids strongly clustered at boundaries. From the viewpoint of polynomial approximation this seems necessary and indeed in certain respects optimal. Nevertheless such methods may “waste” a factor of π/2 with respect to each space dimension. We propose new nonpolynomial quadrature methods that avoid th...