Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. II: numerical stability
DOI10.1016/J.CAM.2004.12.004zbMATH Open1073.65018OpenAlexW2021693293MaRDI QIDQ557693FDOQ557693
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.004
Recommendations
- Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. I: Algorithms
- Computing orthogonal polynomials in Sobolev spaces
- On Generating Polynomials which are Orthogonal over Several Intervals
- On generating orthogonal polynomials for discrete measures
- scientific article; zbMATH DE number 1083140
Computation of special functions and constants, construction of tables (65D20) Numerical methods for trigonometric approximation and interpolation (65T40) Roundoff error (65G50) Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05)
Cites Work
- Algorithm 726: ORTHPOL–a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules
- Algorithm 719: Multiprecision translation and execution of FORTRAN programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Fortran 90-based multiprecision system
- On Recurrence Relations for Sobolev Orthogonal Polynomials
- Title not available (Why is that?)
- Orthogonal polynomials on Sobolev spaces: Old and new directions
- On Generating Orthogonal Polynomials
- On polynomials orthogonal with respect to certain Sobolev inner products
- Stable and Efficient Spectral Methods in Unbounded Domains Using Laguerre Functions
- Computational aspects of pseudospectral Laguerre approximations
- On Orthogonal Polynomials of Sobolev Type: Algebraic Properties and Zeros
- Title not available (Why is that?)
- Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. I: Algorithms
- Computing orthogonal polynomials in Sobolev spaces
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
- Numerical evaluation of the \(p\)th derivative of Jacobi series
- On the numerical evaluation of linear recurrences
- An Algorithm for Summing Orthogonal Polynomial Series and their Derivatives with Applications to Curve-Fitting and Interpolation
Cited In (4)
Uses Software
This page was built for publication: Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. II: numerical stability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557693)