Gauss Quadratures: An Inverse Problem
This article considers the inverse problem of finding a positive weight function \(w(x)\), for a Gauss quadrature rule with given points \(\{x_ j\}\). The principal theoretical result of the article is that for a rule of degree \(M-1\), the weight function with minimal \(K^{th}\) derivative 2-norm is a unique polynomial of degree \(M+2K-1\), with coefficients determined from a linear system. The article illustrates this result with two and three point rule examples, where \(w(x)\) is explicitly determined for various \(K\) values. Orthogonal polynomials are then used to develop a numerical method for calculating minimizing weight functions for larger numbers of points. Finally, some numerical examples are given to illustrate the application of the method to problems with equidistant points.
- NUMERICAL TRANSFORM INVERSION USING GAUSSIAN QUADRATURE
- Gauss on Gaussian quadrature
- Quasi-solution in inverse coefficient problems
- scientific article; zbMATH DE number 2121334
- scientific article; zbMATH DE number 1372025
- A Newton method for inverse problems of quadratic programming
- scientific article; zbMATH DE number 19649
- Gelf'and inverse problem for a quadratic operator pencil
- Gaussian quadrature formulas and Laguerre-Perron's equation
- Quadratic functional estimation in inverse problems
This page was built for publication: Gauss Quadratures: An Inverse Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988996)