Advances in Computational Mathematics

, Volume 8, Issue 3, pp 193–219

On a vector q‐d algorithm

Authors

  • D.E. Roberts
    • Department of MathematicsNapier University
Article

DOI: 10.1023/A:1018944213562

Cite this article as:
Roberts, D. Advances in Computational Mathematics (1998) 8: 193. doi:10.1023/A:1018944213562

Abstract

Using the framework provided by Clifford algebras, we consider a non‐commutative quotient‐difference algorithm for obtaining the elements of a continued fraction corresponding to a given vector‐valued power series. We demonstrate that these elements are ratios of vectors, which may be calculated with the aid of a cross rule using only vector operations. For vector‐valued meromorphic functions we derive the asymptotic behaviour of these vectors, and hence of the continued fraction elements themselves. The behaviour of these elements is similar to that in the scalar case, while the vectors are linked with the residues of the given function. In the particular case of vector power series arising from matrix iteration the new algorithm amounts to a generalisation of the power method to sub‐dominant eigenvalues, and their eigenvectors.

vector continued fractionvector Padé approximantquotient‐difference algorithmClifford algebracross rulepower method

Copyright information

© Kluwer Academic Publishers 1998