Computing recursive orthogonal polynomial with Schur complements
From MaRDI portal
Recommendations
- Computing orthogonal polynomials
- Computing recurrence coefficients of multiple orthogonal polynomials
- scientific article; zbMATH DE number 4142744
- Computer algebra method for orthogonal polynomials
- Orthogonal matrix polynomials and higher-order recurrence relations
- scientific article; zbMATH DE number 1453130
- Orthogonal polynomials and computer algebra
- On the computation of recurrence coefficients for univariate orthogonal polynomials
- The recursive quasi-orthogonal polynomial algorithm
- Symbolic computation of recurrence coefficients for polynomials orthogonal with respect to the Szegő-Bernstein weights
Cites work
- scientific article; zbMATH DE number 592547 (Why is no real title available?)
- A general extrapolation algorithm
- Ein infinitesimales Analogon zum Quotienten-Differenzen-Algorithmus
- From qd to LR, or, how were the qd and LR algorithms discovered?
- Generalized Schur complements
- New algorithm for computing the Hermite interpolation polynomial
- Other manifestations of the Schur complement
- Padé-type approximation and general orthogonal polynomials
- Polynômes orthogonaux formels - applications
- Recursive interpolation, extrapolation and projection
- Recursive polynomial interpolation algorithm (RPIA)
- Schur complements and statistics
- Some Schur complement identities and applications to matrix extrapolation methods
- Vector sequence transformations: Methodology and applications to linear systems
Cited in
(4)
This page was built for publication: Computing recursive orthogonal polynomial with Schur complements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1989196)