LOWER BOUNDS AND FAST ALGORITHMS FOR SEQUENCE ACCELERATION

被引：1

作者：

TROJAN, GM

机构：

[1] Univ of Western Ontario, Dep of, Physics, London, Ont, Can, Univ of Western Ontario, Dep of Physics, London, Ont, Can

来源：

JOURNAL OF THE ACM | 1984年 / 31卷 / 02期

关键词：

D O I：

10.1145/62.66

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Tight upper and lower bounds are obtained for sequence accelerating. The lower bounds follow from a powerful asymptotic adversary principle. Algorithms are presented and shown to be almost optimal.

引用

页码：329 / 335

页数：7