pith. sign in

arxiv: 1805.12047 · v1 · pith:D4SVTBQSnew · submitted 2018-05-30 · 🧮 math.NA · cs.NA· math.AG

Generalized eigenvalue methods for Gaussian quadrature rules

classification 🧮 math.NA cs.NAmath.AG
keywords nodesquadratureeigenvaluegeneralizedlinepolynomialproblemreal
0
0 comments X
read the original abstract

A quadrature rule of a measure $\mu$ on the real line represents a convex combination of finitely many evaluations at points, called nodes, that agrees with integration against $\mu$ for all polynomials up to some fixed degree. In this paper, we present a bivariate polynomial whose roots parametrize the nodes of minimal quadrature rules for measures on the real line. We give two symmetric determinantal formulas for this polynomial, which translate the problem of finding the nodes to solving a generalized eigenvalue problem.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.