Formal vector orthogonal polynomials (Q1127005)

From MaRDI portal
Revision as of 11:01, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Formal vector orthogonal polynomials
scientific article

    Statements

    Formal vector orthogonal polynomials (English)
    0 references
    25 January 1999
    0 references
    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.
    0 references
    designants
    0 references
    vector orthogonal polynomials
    0 references
    Padé approximation
    0 references
    Clifford algebra
    0 references
    Clifford group
    0 references
    qd-algorithm
    0 references
    0 references

    Identifiers