On generating orthogonal polynomials for discrete measures
From MaRDI portal
Publication:1381131
DOI10.4171/ZAA/815zbMath0901.42017MaRDI QIDQ1381131
Publication date: 17 November 1998
Published in: Zeitschrift für Analysis und ihre Anwendungen (Search for Journal in Brave)
Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Numerical approximation and computational geometry (primarily algorithms) (65D99)
Related Items
On sensitivity of Gauss-Christoffel quadrature ⋮ Direct and inverse computation of Jacobi matrices of infinite iterated function systems ⋮ Orthogonal polynomials of equilibrium measures supported on Cantor sets ⋮ Computation of Gauss-type quadrature formulas ⋮ On the sensitivity of Lanczos recursions to the spectrum ⋮ Adaptive multi-element polynomial chaos with discrete measure: algorithms and application to SPDEs ⋮ Computation of quadrature rules for integration with respect to refinable functions on assigned nodes ⋮ Explicit calculation of some polynomials introduced by W. Gautschi ⋮ Sensitivity of the Lanczos recurrence to Gaussian quadrature data: how malignant can small weights be? ⋮ How to choose modified moments?
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The numerically stable reconstruction of Jacobi matrices from spectral data
- Markov's inequality and zeros of orthogonal polynomials on fractal sets
- Recurrence coefficients of orthogonal polynomials with respect to some self-similar singular distributions
- On the sensitivity of orthogonal polynomials to perturbations in the moments
- Construction of polynomials that are orthogonal with respect to a discrete bilinear form
- On the condition of orthogonal polynomials via modified moments
- On Generating Orthogonal Polynomials
- Algorithm 726: ORTHPOL–a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules
- Approximation von Funktionen und ihre numerische Behandlung
