1. Shanks transformation, epsilon Wynn algorithm

Or $(s_{n})$ a convergent sequence of real numbers whose limit is denoted by $s$ . If convergence is slow, the sequence can be transformed into another sequence, say ( $T_{n}$ ), which under certain conditions converges faster to the same limit, i.e. such that ${lim}_{n \to ∞} ‖ T_{n} – s ‖ / ‖ s_{n} – s ‖ = 0$ ...

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed? Log in!

Ongoing reading
Shanks transformation, epsilon Wynn algorithm

Previous
page Clifford's Algebra and Applications

Concrete problem

Article included in this offer

"Mathematics"

( 166 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details

Bibliography

(1) - SHANKS (D.) - Non linear transformations of divergent and slowly convergent sequences. - J. Math. Phys., 34 : 1–42 (1955).
(2) - AITKEN (A.C.) - On Bernoulli's numerical solution of algebraic equations. - Proc. R. Soc. Edinb., 46 : 289–305...

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed? Log in!