This paper introduces GAUSS a system for the automatic selection of quadrature routines in numerical computation. Given a problem in numerical integration and constraints on time and accuracy, GAUSS comes up with an efficient algorithm to solve it. It banks on a performance database of various algorithms and test problems, an automatic feature identification module and a knowledge methodology t...

We present telescoping recursive representations for both continuous and discrete indexed noncausal Gauss-Markov random fields. Our recursions start at the boundary (for example, a hypersurface in R, d ≥ 1) and telescope inwards. Under appropriate conditions, the recursions for the random field are differential/difference representations driven by white noise, for which we can use standard recu...

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...

We study static black hole solutions in Einstein and Einstein–Gauss–Bonnet gravity with the topology of the product of two spheres,Sn × Sn, in higher dimensions. There is an unusual new feature of the Gauss–Bonnet black hole: the avoidance of a non-central naked singularity prescribes a mass range for the black hole in terms of > 0. For an Einstein–Gauss–Bonnet black hole a limited window of ne...

The main object of this paper is to consider the asymptotic distribution of the zeros of certain classes of the Gauss hypergeometric polynomials. Some classical analytic methods and techniques are used here to analyze the behavior of the zeros of the Gauss hypergeometric polynomials, 2F1(−n, a;−n+ b; z), where n is a nonnegative integer. Owing to the connection between the classical Jacobi poly...

We have recently considered decomposing a system of nonlinear equations by defining new variables corresponding to the intermediate results in the evaluation process. In that previous work, we applied both a derivative-free component solution process and an interval Gauss–Seidel method to the large, sparse system of equations so obtained. An analysis of the component solution process indicates ...

In this paper, we develop a Jacobi-Gauss-Lobatto collocation method for solving the nonlinear fractional Langevin equation with three-point boundary conditions. The fractional derivative is described in the Caputo sense. The shifted Jacobi-Gauss-Lobatto points are used as collocation nodes. The main characteristic behind the Jacobi-Gauss-Lobatto collocation approach is that it reduces such a pr...

respectively. There are many iterative methods such as GMRES [7] and Bi-CGSTAB [9] algorithms for solving Eq. (1.1) which are more efficient than the Jacobi and Gauss-Seidel methods. However, when these methods are combined with the more efficient methods, for example as a preconditioner, can be quite successful. For example see [4, 6]. It has been proved that if A is a strictly diagonally domi...

Gauss words are finite sequences of letters associated with self-intersecting closed curves in the plane. (These curves have no “triple” self-intersection). These sequences encode the order of intersections on the curves. We characterize, up to homeomorphism, all curves having a given Gauss word. We extend this characterization to the n-tuples of closed curves having a given n-tuple of words, t...

For Ax = b, it has recently been reported that the convergence of the preconditioned Gauss-Seidel iterative method which uses a matrix of the type P = I + S (α) to perform certain elementary row operations on is faster than the basic Gauss-Seidel method. In this paper, we discuss the adaptive Gauss-Seidel iterative method which uses P = I + S (α) + K̄ (β) as a preconditioner. We present some com...