1975
DOI: 10.1007/bf02575753
|View full text |Cite
|
Sign up to set email alerts
|

Generalisations de la transformation de shanks, de la table de Pade et de l'ε-algorithme

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
99
0
5

Year Published

1989
1989
2020
2020

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 108 publications
(105 citation statements)
references
References 19 publications
1
99
0
5
Order By: Relevance
“…Vector extrapolation methods can be classified into two families. The first family contains the minimal polynomial extrapolation (MPE) method [31], the reduced rank extrapolation (RRE) method [58,133] and the modified minimal polynomial extrapolation (MMPE) method [21,157,174]. The second class includes the topological -algorithm (TEA) [21] and the scalar and vector -algorithm (SEA and VEA) [202].…”
Section: Implicit Couplingmentioning
confidence: 99%
“…Vector extrapolation methods can be classified into two families. The first family contains the minimal polynomial extrapolation (MPE) method [31], the reduced rank extrapolation (RRE) method [58,133] and the modified minimal polynomial extrapolation (MMPE) method [21,157,174]. The second class includes the topological -algorithm (TEA) [21] and the scalar and vector -algorithm (SEA and VEA) [202].…”
Section: Implicit Couplingmentioning
confidence: 99%
“…As far as we know, various kinds of vector extrapolation methods have been discussed in SIAM Review [33]. For example, the polynomial-type vector extrapolation methods which include the minimal polynomial extrapolation (MPE) of Cabay and Jackson [34], and the epsilon vector extrapolation methods which utilize the scalar and vector epsilon methods of Wynn [35,36], and the topological epsilon method of Brezinski [37].…”
Section: Accelerated Two-level Multigrid Methodsmentioning
confidence: 99%
“…As the previous example indicates, most interest arising from practical applications centres may be accelerated by the use of the functional s-algorithm [Brezinski, 1975]. For the case of The denominator polynomial q[n/ 2 kl(.A) is given by the same formula (2.5), but with …”
Section: A=d-l-umentioning
confidence: 99%