Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. I: Algorithms
DOI10.1016/J.CAM.2004.12.003zbMATH Open1066.42017OpenAlexW2059941357MaRDI QIDQ557692FDOQ557692
Publication date: 30 June 2005
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2004.12.003
approximationrecurrence relationsSobolev orthogonal polynomialsnumerical evaluationFourier-Sobolev coefficients
Computation of special functions and constants, construction of tables (65D20) Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Other special orthogonal polynomials and functions (33C47) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithm 726: ORTHPOL–a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules
- On Fourier series of a discrete Jacobi--Sobolev inner product
- Relative asymptotics for polynomials orthogonal with respect to a discrete Sobolev inner product
- On Recurrence Relations for Sobolev Orthogonal Polynomials
- Orthogonal polynomials on Sobolev spaces: Old and new directions
- On Generating Orthogonal Polynomials
- On polynomials orthogonal with respect to certain Sobolev inner products
- On real and complex zeros of orthogonal polynomials in a discrete Sobolev space
- On Orthogonal Polynomials of Sobolev Type: Algebraic Properties and Zeros
- Global properties of zeros for Sobolev-type orthogonal polynomials
- Zero distribution of orthogonal polynomials in a certain discrete Sobolev space
- Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. II: numerical stability
- Computing orthogonal polynomials in Sobolev spaces
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
- High-order recurrences satisfied by classical orthogonal polynomials.
- Numerical evaluation of the \(p\)th derivative of Jacobi series
- Best polynomial approximation in Sobolev-Laguerre and Sobolev-Legendre spaces.
- On the numerical evaluation of linear recurrences
- Characterization of low degree A-stable symmetric RK collocation methods
- On the A-Stability of Runge--Kutta Collocation Methods Based on Orthogonal Polynomials
- Parallel Algorithms to Evaluate Orthogonal Polynomial Series
- An Algorithm for Summing Orthogonal Polynomial Series and their Derivatives with Applications to Curve-Fitting and Interpolation
Cited In (5)
- Sobolev orthogonal polynomials in computing of Hankel determinants
- A difference operator of infinite order with Sobolev-type Charlier polynomials as eigenfunctions
- Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. II: numerical stability
- On the numerical evaluation of linear recurrences
- High-precision computation: mathematical physics and dynamics
Uses Software
This page was built for publication: Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. I: Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557692)
