1993
DOI: 10.1007/bf02108462
|View full text |Cite
|
Sign up to set email alerts
|

The rise and fall of the vector epsilon algorithm

Abstract: Summary. The performance of the vector epsilon is governed by two important mathematical theorems which are briefly reviewed in context. We note that the performance of the vector epsilon algorithm is inevitably qualitatively incorrect for sequences whose generating functions have poles near unity. This difficulty is avoided by the use of hybrid vector Pade approximants.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1994
1994
2018
2018

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 13 publications
(2 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…Finally, let us mention that a confluent form of the vector ε-algorithm exists and that a confluent form of the topological ε-algorithm was given in [27]; see also [79] where a functional ε-algorithm is discussed.…”
Section: The Confluent Casementioning
confidence: 99%
See 1 more Smart Citation
“…Finally, let us mention that a confluent form of the vector ε-algorithm exists and that a confluent form of the topological ε-algorithm was given in [27]; see also [79] where a functional ε-algorithm is discussed.…”
Section: The Confluent Casementioning
confidence: 99%
“…Their kernel is that of Shanks' transformation but, now, the condition is again necessary and sufficient as in the scalar case [295, Thm III.1]; see [64] for a survey. The vector valued rational approximants of Graves-Morris are related to the vector ε-algorithm [117,118,121,122]; see also [79].…”
Section: Successorsmentioning
confidence: 99%