Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. I: Algorithms
From MaRDI portal
Publication:557692
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)
Recommendations
- Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. II: numerical stability
- Computing orthogonal polynomials in Sobolev spaces
- On computational aspects of discrete Sobolev inner products on the unit circle
- scientific article; zbMATH DE number 19414
- scientific article; zbMATH DE number 1083140
Cites work
- scientific article; zbMATH DE number 3814037 (Why is no real title available?)
- scientific article; zbMATH DE number 108071 (Why is no real title available?)
- scientific article; zbMATH DE number 1083140 (Why is no real title available?)
- scientific article; zbMATH DE number 2107939 (Why is no real title available?)
- scientific article; zbMATH DE number 3230499 (Why is no real title available?)
- scientific article; zbMATH DE number 3110365 (Why is no real title available?)
- Algorithm 726: ORTHPOL–a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules
- An Algorithm for Summing Orthogonal Polynomial Series and their Derivatives with Applications to Curve-Fitting and Interpolation
- Best polynomial approximation in Sobolev-Laguerre and Sobolev-Legendre spaces.
- Characterization of low degree A-stable symmetric RK collocation methods
- Computing orthogonal polynomials in Sobolev spaces
- Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. II: numerical stability
- Global properties of zeros for Sobolev-type orthogonal polynomials
- High-order recurrences satisfied by classical orthogonal polynomials.
- Numerical evaluation of the \(p\)th derivative of Jacobi series
- On Fourier series of a discrete Jacobi--Sobolev inner product
- On Generating Orthogonal Polynomials
- On Orthogonal Polynomials of Sobolev Type: Algebraic Properties and Zeros
- On Recurrence Relations for Sobolev 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 the A-Stability of Runge--Kutta Collocation Methods Based on Orthogonal Polynomials
- On the numerical evaluation of linear recurrences
- Orthogonal polynomials on Sobolev spaces: Old and new directions
- Parallel Algorithms to Evaluate Orthogonal Polynomial Series
- Relative asymptotics for polynomials orthogonal with respect to a discrete Sobolev inner product
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
- Zero distribution of orthogonal polynomials in a certain discrete Sobolev space
Cited in
(9)- High-precision computation: mathematical physics and dynamics
- A difference operator of infinite order with Sobolev-type Charlier polynomials as eigenfunctions
- Sobolev orthogonal polynomials on the Sierpinski gasket
- Polynomials orthogonal in the Sobolev sense, generated by Chebyshev polynomials orthogonal on a mesh
- Discrete orthogonal polynomials on Gauss-Lobatto Chebyshev nodes
- Sobolev orthogonal polynomials in computing of Hankel determinants
- On generating Sobolev orthogonal polynomials
- Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. II: numerical stability
- On the numerical evaluation of linear recurrences
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)
