Computing orthogonal polynomials in Sobolev spaces

DOI10.1007/s002110050140zbMath0830.65012OpenAlexW2058689772MaRDI QIDQ1899117

Walter Gautschi, Minda Zhang

Publication date: 4 October 1995

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002110050140

zbMATH Keywords

numerical experimentsrecurrence relationsStieltjes algorithmChebyshev algorithmorthogonal polynomials of Sobolev type

Mathematics Subject Classification ID

Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Computation of special functions and constants, construction of tables (65D20)

Related Items (12)

Hermite–Sobolev orthogonal functions and spectral methods for second- and fourth-order problems on unbounded domains ⋮ Sensitivity analysis for Szegő polynomials ⋮ Zeros and critical points of Sobolev orthogonal polynomials ⋮ On generating Sobolev orthogonal polynomials ⋮ On computational aspects of discrete Sobolev inner products on the unit circle ⋮ Ratio and Plancherel-Rotach asymptotics for Meixner-Sobolev orthogonal polynomials ⋮ On Sobolev orthogonal polynomials ⋮ Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. I: Algorithms ⋮ Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. II: numerical stability ⋮ Orthogonal polynomials (in Matlab) ⋮ Inner products involving \(q\)-differences: The little \(q\)-Laguerre-Sobolev polynomials ⋮ Inner products involving differences: the meixner—sobolev polynomials

Uses Software

• EISPACK

This page was built for publication: Computing orthogonal polynomials in Sobolev spaces