Geometric approach to the parallel sum of vectors and application to the vector -algorithm

DOI10.1007/S11075-013-9714-YMaRDI QIDQ457039zbMATH OpenOpenAlexFDO

Authors Alain Berlinet

Publication date 26 September 2014

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11075-013-9714-y

zbMATH Keywords

Aitken's \(\Delta^2\) algorithmBézier parabolageometric interpolationparallel sumsprial similarityWynn's \(\varepsilon\)-algorithm

Mathematics Subject Classification ID

Extrapolation to the limit, deferred corrections (65B05) Acceleration of convergence in numerical analysis (65B99)

Review text

Geometric interpretations of Aitken's \(\Delta^2\) algorithm and Wynn's \(\varepsilon\)-algorithm are derived. The author begins by analyzing the geometry of the parallel sum of complex numbers, where the parallel sum \(a:b\) is defined by \[ a:b = \left( a^{-1} + b^{-1}\right)^{-1}. \] Since the parallel sum is prominent in the Aitken's \(\Delta^2\) algorithm and Wynn's \(\varepsilon\)-algorithm, the geometric interpretation of the parallel sum is then used to provide a geometric interpretation of these two algorithms. For Aitken's \(\Delta^2\), if \((x_n)\) is the original real-valued sequence and \(( (Tx)_n )\) is the sequence obtained from Aitken's \(\Delta^2\), then \((Tx)_n\) is the center of the homothety transforming simultaneously \(x_n\) into \(x_{n+1}\) and \(x_{n+1}\) into \(x_{n+2}\). A result is also presented for \(\Delta^2\) applied to vector-valued sequences. In the case of Wynn's \(\varepsilon\)-algorithm, it is shown that, for a initial sequence of vectors \((s_n)\) and transformed sequence \((\varepsilon_2^{(n)} )\), \(\varepsilon_2^{(n)}\) is the focus of the Bézier parabola controlled by \(s_n, s_{n+1}\), and \(s_{n+2}\).

Recommendations

• scientific article; zbMATH DE number 822882
• Extrapolation methods for vector sequences
• The rise and fall of the vector epsilon algorithm
• On Padé approximants and the -algorithms for vectors in 2 and 3 dimensions
• Convergence and acceleration properties for the vector \(\epsilon\)- algorithm

Cites work

• A note on the \(\epsilon\)-algorithm
• About Henrici's transformation for accelerating vector sequences
• Acceleration of the EM algorithm: P-EM versus epsilon algorithm
• Acceleration of vector sequences by multi-dimensional Δ2 methods
• Acceleration Techniques for Iterated Vector and Matrix Problems
• Extrapolation methods for vector sequences
• Generalizations of aitken's process for accelerating the convergence of sequences
• Geometric interpretation of some Cauchy related methods
• scientific article; zbMATH DE number 1452662 (Why is no real title available?)
• scientific article; zbMATH DE number 3240705 (Why is no real title available?)
• scientific article; zbMATH DE number 3289061 (Why is no real title available?)
• New vector sequence transformations
• Non-commutative extrapolation algorithms
• On the vector \(\varepsilon\)-algorithm for solving linear systems of equations
• The harmonic and geometric mean of vectors
• Une généralisation au cas vectoriel du procédé \Delta ^2 d’Aitken et les suites à comportement linéaire
• Vector valued rational interpolants. I

Cited in

(3)

• The genesis and early developments of Aitken's process, Shanks' transformation, the \(\varepsilon\)-algorithm, and related fixed point methods
• Perturbation estimation for the parallel sum of Hermitian positive semi-definite matrices
• Some properties of parallel sum of operators

This page was built for publication: Geometric approach to the parallel sum of vectors and application to the vector \(\varepsilon \)-algorithm

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