On a vector q-d algorithm

DOI10.1023/A:1018944213562MaRDI QIDQ1127002zbMATH OpenFDO

Authors D. E. Roberts

Publication date 25 October 1998

Published in Advances in Computational Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Clifford algebraquotient-difference algorithmvector continued fraction

Mathematics Subject Classification ID

Quadratic spaces; Clifford algebras (11E88) Clifford algebras, spinors (15A66) Numerical summation of series (65B10)

Review text

[Shortened review; the full version is available at Zbl.] Twenty seven years ago in a survey lecture [Rocky Mountain J. Math. 4, No. 2, 297-323 (1974; Zbl 0302.65002)], the reviewer stated the laws of an algorithm for determining the coefficients of a vector continued fraction, leaving the proof to the interested conference participant or reader of the preceedings. In the paper under review, the author gets half way there and then into some trouble.

Recommendations

• Vector Stieltjes continued fraction and vector QD algorithm
• The vector QD algorithm for smooth functions \((f,f')\)
• Stieltjes continued fraction and QD algorithm: scalar, vector, and matrix cases
• Singular rules for a multivariate quotient-difference algorithm

Cited in

(7)

• On a representation of vector continued fractions
• The epsilon algorithm and related topics
• The vector QD algorithm for smooth functions \((f,f')\)
• An improved dqds type algorithm
• Problems and progress in vector Padé approximation
• Applications of quasideterminants to non-commutative multistep -algorithm
• A vector generalisation of de Montessus' theorem for the case of polar singularities on the boundary

This page was built for publication: On a vector q-d algorithm

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