A vector Chebyshev algorithm

DOI10.1023/A:1011633327892MaRDI QIDQ1127053zbMATH OpenFDO

Authors D. E. Roberts

Publication date 9 August 1998

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1011633327892

zbMATH Keywords

algorithmsClifford algebradesignantsPadé approximationrational approximationvector Chebyshev algorithm

Mathematics Subject Classification ID

Approximation by rational functions (41A20) Algorithms for approximation of functions (65D15)

Review text

Rational approximation to power series whose coefficients are vectors, is discussed in the framework of the Clifford algebra generated by vector in \(\mathbb{R}^d\). The emphasis is on algorithms which do not require general elements from the algebra and refer to vectors as much as possible. Padé approximation looks very different from the common theory. For example designants enter into terms in which usually determinants are found.

Recommendations

• Publication:4889138
• On a representation of vector continued fractions
• Vector Padé-type approximants and vector Padé approximants
• From matrix to vector Padé approximants

Cited in

(4)

• Formal vector orthogonal polynomials
• The epsilon algorithm and related topics
• scientific article; zbMATH DE number 915617 (Why is no real title available?)
• Chebyshev center based column generation

This page was built for publication: A vector Chebyshev algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127053)