An efficient algorithm for the accurate computation of Gauss–Legendre and Gauss– Jacobi quadrature nodes and weights is presented. The algorithm is based on Newton’s root-finding method with initial guesses and function evaluations computed via asymptotic formulae. The n-point quadrature rule is computed in O(n) operations to an accuracy of essentially double precision for any n ≥ 100.

Inequalities are obtained for quadrature rules in terms of upper and lower bounds of the first derivative of the integrand. Bounds of Ostrowski type quadrature rules are obtained and the classical Iyengar inequality for the trapezoidal rule is recaptured as a special case. Applications to numerical integration are demonstrated.

This paper deals with the stability of Runge–Kutta methods for a class of stiff systems of nonlinear Volterra delay-integro-differential equations. Two classes of methods are considered: Runge–Kutta methods extended with a compound quadrature rule, and Runge– Kutta methods extended with a Pouzet type quadrature technique. Global and asymptotic stability criteria for both types of methods are de...

OBJECTIVE To assess the static and dynamic balance performance of students with normal hearing and with sensorineural hearing loss. METHODS A cross-sectional study assessing 96 students, 48 with normal hearing and 48 with sensorineural hearing loss of both sexes, aged 7 and 18 years. To evaluate static balance, Romberg, Romberg-Barré and Fournier tests were used; and for the dynamic balance, ...

An inequality for a companion of Ostrowski's integral inequality is proved. Application to a composite quadrature rule is considered.

We develop parallel one-dimensional globally adaptive quadrature algorithms, building on NAG code D01AKF. Our most eeective strategy replaces D01AKF's error estimate ranking strategy by a tabulation approach. D01AKF uses 61-point Gauss-Kronrod (GK) quadrature. We also use the 21-point GK rule. A fuller discussion, with expanded results, is given in 7].

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.

Two quadrature rules for the approximate evaluation of Cauchy principal value integrals, with nodes at the zeros of appropriate orthogonal polynomials, are discussed. An expression for the truncation error, in terms of higher order derivatives, is given for each rule. In addition, two theorems, containing sufficient conditions for the convergence of the sequence of quadrature rules to the integ...

We study the construction of a quadrature rule which allows the simultaneous integration of a given function with respect to different weights. This construction is built on the basis of simultaneous Padé approximation of a Nikishin system of functions. The properties of these approximants are used in the proof of convergence of the quadratures and positivity of the corresponding quadrature coe...

This paper presents a symbolic model checking algorithm for continuous-time Markov chains for an extension of the continuous stochastic logic CSL of Aziz et al 1]. The considered logic contains a time-bounded until-operator and a novel operator to express steady-state probabilities. We show that the model checking problem for this logic reduces to a system of linear equations (for unbounded unt...