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

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

Raymond C. Y. Chin

Publication date: 28 June 1992

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

zbMATH Keywords

algorithm; orthogonal polynomials; numerical examples; domain decomposition method; Gaussian weight; modified moments method; preconditioning polynomial subspace

Mathematics Subject Classification ID

33C45: Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.)

65D20: Computation of special functions and constants, construction of tables

Related Items

Moments in quadrature problems, How to generate unknown orthogonal polynomials out of known orthogonal polynomials, Iterative solution of elliptic problems by approximate factorization, Painlevé-type differential equations for the recurrence coefficients of semi-classical orthogonal polynomials

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item