Computing recursive orthogonal polynomial with Schur complements
From MaRDI portal
Publication:1989196
DOI10.1016/j.cam.2019.112406OpenAlexW2967436206WikidataQ127356909 ScholiaQ127356909MaRDI QIDQ1989196
Publication date: 24 April 2020
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.2019.112406
orthogonal polynomialsSchur complementSylvester's identityqd algorithmrecursive orthogonal polynomial algorithm
Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Computation of special functions and constants, construction of tables (65D20)
Related Items (1)
Cites Work
- Unnamed Item
- Recursive interpolation, extrapolation and projection
- Padé-type approximation and general orthogonal polynomials
- Other manifestations of the Schur complement
- A general extrapolation algorithm
- Schur complements and statistics
- Generalized Schur complements
- Vector sequence transformations: Methodology and applications to linear systems
- Recursive polynomial interpolation algorithm (RPIA)
- New algorithm for computing the Hermite interpolation polynomial
- Polynômes orthogonaux formels - applications
- Some Schur complement identities and applications to matrix extrapolation methods
- Ein infinitesimales Analogon zum Quotienten-Differenzen-Algorithmus
- From qd to LR, or, how were the qd and LR algorithms discovered?
This page was built for publication: Computing recursive orthogonal polynomial with Schur complements