THE STRUCTURE OF MATRICES IN RATIONAL GAUSS QUADRATURE

This paper is concerned with the approximation of matrix functionals defined by a large, sparse or structured, symmetric definite matrix. These functionals are Stieltjes integrals with a measure supported on a compact real interval. Rational Gauss quadrature rules that are designed to exactly integrate Laurent polynomials with a fixed pole in the vicinity of the support of the measure may yield better approximations of these functionals than standard Gauss quadrature rules with the same number of nodes. Therefore it can be attractive to approximate matrix functionals by these rational Gauss rules. We describe the structure of the matrices associated with these quadrature rules, derive remainder terms, and discuss computational aspects. Also discussed are rational Gauss-Radau rules and the applicability of pairs of rational Gauss and Gauss-Radau rules to computing lower and upper bounds for certain matrix functionals.