A domain decomposition method for generating orthogonal polynomials for a Gaussian weight on a finite interval

DOI10.1016/0021-9991(92)90211-GzbMath0752.65012OpenAlexW2023947160MaRDI QIDQ1186206

Raymond C. Y. Chin

Publication date: 28 June 1992

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9991(92)90211-g

zbMATH Keywords

algorithmorthogonal polynomialsnumerical examplesdomain decomposition methodGaussian weightmodified moments methodpreconditioning polynomial subspace

Mathematics Subject Classification ID

Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Computation of special functions and constants, construction of tables (65D20)

Related Items (6)

Painlevé-type differential equations for the recurrence coefficients of semi-classical orthogonal polynomials ⋮ Iterative solution of elliptic problems by approximate factorization ⋮ Truncated Hermite polynomials ⋮ Coherent pairs of moment functionals of the second kind and associated orthogonal polynomials and Sobolev orthogonal polynomials ⋮ Moments in quadrature problems ⋮ How to generate unknown orthogonal polynomials out of known orthogonal polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Numerical integration using Rys polynomials
• A reformulation of Olver's algorithm for the numerical solution of second-order difference-equations
• Orthogonal polynomials
• Bounds for the solutions of second-order linear difference equations
• Calculation of Gauss Quadrature Rules

This page was built for publication: A domain decomposition method for generating orthogonal polynomials for a Gaussian weight on a finite interval