1993 · 45 citations · 24 references
ComputingComputer ScienceMathematicsAlgorithmsComputational GeometryComputational PhysicsInterpolation TechniquesNumerical AlgorithmsNumerical AnalysisNumerical IntegrationAccuracyAsymptotic AnalysisBasis FunctionsGaussian QuadratureOrthogonal PolynomialsPolynomial Basis FunctionsQuadrature TheoryRational Interpolation
Abstract. We consider quadrature formulas based on interpolation using the basis functions 1/(1 + tkx) (k = 1, 2, 3,...) on [−1,1], where tk are parameters on the interval (−1, 1). We investigate two types of quadratures: quadrature formulas of maximum accuracy which correctly integrate as many basis functions as possible (Gaussian quadrature), and quadrature formulas whose nodes are the zeros of the orthogonal functions obtained by orthogonalizing the system of basis functions (orthogonal quadrature). We show that both approaches involve orthogonal polynomials with modified (or varying) weights which depend on the number of quadrature nodes. The asymptotic distribution of the nodes is obtained as well as various interlacing properties and monotonicity results for the nodes.
24
Methods of Numerical Integration.
F. S., Philip J. Davis, Philip Rabinowitz · Mathematics of Computation · 1986 · 2.8K citations
Introduction to Approximation Theory
T. J. Rivlin, E. W. Cheney · Mathematics of Computation · 1969 · 2.1K citations