A new proof of the cross-rule for the \(\epsilon\)-algorithm based on Schur-complements
From MaRDI portal
Publication:1095594
DOI10.1016/0377-0427(88)90387-1zbMath0632.65045OpenAlexW1985287401MaRDI QIDQ1095594
Publication date: 1988
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(88)90387-1
Extrapolation to the limit, deferred corrections (65B05) Canonical forms, reductions, classification (15A21)
Related Items
The genesis and early developments of Aitken's process, Shanks' transformation, the \(\varepsilon\)-algorithm, and related fixed point methods ⋮ Shanks's transformation revisited ⋮ On a general \(\rho\)-algorithm
Cites Work
- Recursive interpolation, extrapolation and projection
- Determinantal identities: Gauss, Schur, Cauchy, Sylvester, Kronecker, Jacobi, Binet, Laplace, Muir, and Cayley
- Sequence transformations and their applications
- Manifestations of the Schur complement
- Determination of the inertia of a partitioned Hermitian matrix
- Über zwei Algorithmen zur Interpolation mit rationalen Funktionen
- Some Techniques for Rational Interpolation
- An Identity for the Schur Complement of a Matrix
- Singular rules for certain non-linear algorithms
- On a Device for Computing the e m (S n ) Transformation
- Unnamed Item
- Unnamed Item
