Formal vector orthogonal polynomials
Vector orthogonal polynomials are usually studied in connection with vector Padé approximation. \textit{D. E. Roberts} [Proc. R. Soc. Lond., Ser. A 431, No. 1882, 285-300 (1990; Zbl 0745.41017); Numer. Algorithms 3, No. 1-4, 371-381 (1992; Zbl 0782.41022)] has used Clifford algebra techniques to study these approximants. In this paper a similar, yet different approach based on Clifford algebra and Clifford group techniques is used to generalize several classical results for scalar formal orthogonal polynomials: necessary and sufficient conditions for existence, three-term recurrence relation, explicit determinant expression, and qd-algorithm. The vector valued Padé aspect of this approach will be published in a separate paper.
- Vector Padé-type approximants and vector Padé approximants
- On vector Hankel determinants
- The epsilon algorithm and related topics
- Vector orthogonal polynomials with Bochner's property
- Formal orthogonal polynomials revisited. Applications
- Three-term recurrence relations for systems of Clifford algebra-valued orthogonal polynomials
- Clifford algebras and vector-valued rational forms. I
- scientific article; zbMATH DE number 671990 (Why is no real title available?)
- Computation of matrix-valued formally orthogonal polynomials and applications
- Clifford algebras and vector-valued rational forms. II
- Vector orthogonal polynomials
This page was built for publication: Formal vector orthogonal polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127005)