Computing the coefficients of a recurrence formula for numerical integration by moments and modified moments

DOI10.1016/0377-0427(93)90152-2zbMath0807.65016OpenAlexW1971757387MaRDI QIDQ1318409

Maria Morandi Cecchi, Michela Redivo-Zaglia

Publication date: 27 April 1994

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(93)90152-2

zbMATH Keywords

momentscomparisonnumerical resultsorthogonal polynomialsthree-term recurrence relationGaussian quadrature formulaMathematica program

Mathematics Subject Classification ID

Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32)

Related Items

A recursive algorithm by the moments method to evaluate a class of numerical integrals over an infinite interval, Multilayered neural architectures evolution for computing sequences of orthogonal polynomials, Gauss rules associated with nearly singular weights, How to choose modified moments?

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Padé-type approximation and general orthogonal polynomials
• A new presentation of orthogonal polynomials with applications to their computation
• Modified moments and Gaussian quadratures
• Extrapolation methods
• On the sensitivity of orthogonal polynomials to perturbations in the moments
• Modified moments for indefinite weight functions
• L'integrazione numerica di una classe di integralie utili nei calcoli quantomeccanici
• An algorithm for Gaussian quadrature given modified moments
• On Generating Orthogonal Polynomials
• An Algorithm for the Inversion of Finite Hankel Matrices
• Construction of Gauss-Christoffel Quadrature Formulas
• On the Construction of Gaussian Quadrature Rules from Modified Moments