Ebook: Sequence Transformations

The book gives a very clear and concise summary of the important fields of sequence transformations and convergence acceleration methods. Some of the outstanding features are: - precise definitions of algorithmic sequence transformations, - a study of the power of sequence transformations, - proof of negative results on acceleration methods (namely, that some sequence families are not accelerable), - new algorithms for convergence acceleration (in particular automatic selection procedures). For researchers and graduate students working in or with convergence acceleration methods and sequence transformations, this book is sure to become an important tool. This book is a contribution to the theory and practice of convergence acceleration methods. It gives a new survey point of view on the subject, with positive results (new method of acceleration) and negative results (proofs that some sequence families are not accelerable).

---

The book gives a very clear and concise summary of the important fields of sequence transformations and convergence acceleration methods. Some of the outstanding features are: - precise definitions of algorithmic sequence transformations, - a study of the power of sequence transformations, - proof of negative results on acceleration methods (namely, that some sequence families are not accelerable), - new algorithms for convergence acceleration (in particular automatic selection procedures). For researchers and graduate students working in or with convergence acceleration methods and sequence transformations, this book is sure to become an important tool. This book is a contribution to the theory and practice of convergence acceleration methods. It gives a new survey point of view on the subject, with positive results (new method of acceleration) and negative results (proofs that some sequence families are not accelerable).
Content:
Front Matter....Pages I-XXI
The Various Kinds of Algorithmic Sequence Transformations....Pages 1-30
Decidability and Undecidability in the Limit....Pages 31-91
Algorithms for Extracting Convergent Subsequences....Pages 93-124
The Partially Ordered Systems of Accelerable Families....Pages 125-149
Non-Accelerable Families of Sequences....Pages 151-189
Accelerating The Convergence of Linear Sequences....Pages 191-221
Automatic Selection of Sequence Transformations....Pages 223-248
Back Matter....Pages 249-254

---

The book gives a very clear and concise summary of the important fields of sequence transformations and convergence acceleration methods. Some of the outstanding features are: - precise definitions of algorithmic sequence transformations, - a study of the power of sequence transformations, - proof of negative results on acceleration methods (namely, that some sequence families are not accelerable), - new algorithms for convergence acceleration (in particular automatic selection procedures). For researchers and graduate students working in or with convergence acceleration methods and sequence transformations, this book is sure to become an important tool. This book is a contribution to the theory and practice of convergence acceleration methods. It gives a new survey point of view on the subject, with positive results (new method of acceleration) and negative results (proofs that some sequence families are not accelerable).
Content:
Front Matter....Pages I-XXI
The Various Kinds of Algorithmic Sequence Transformations....Pages 1-30
Decidability and Undecidability in the Limit....Pages 31-91
Algorithms for Extracting Convergent Subsequences....Pages 93-124
The Partially Ordered Systems of Accelerable Families....Pages 125-149
Non-Accelerable Families of Sequences....Pages 151-189
Accelerating The Convergence of Linear Sequences....Pages 191-221
Automatic Selection of Sequence Transformations....Pages 223-248
Back Matter....Pages 249-254
....