Some questions on the effectiveness of composite sequence transformations, first introduced by \textit{C. Brezinski} [Numer. Math. 46, 311-321 (1985; Zbl 0568.65001)], are studied. Properties of automatic selection of sequences transformations are proved. A section of this article is devoted to rank-two composite transformations. A natural generalization given by Brezinski to define the \(rank\)-(k\(+1)\) composite transformation is also considered.
Recommendations
Cites work
Cited in
(3)
This page was built for publication: On composite sequence transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804208)