Sequence Transformations
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Sequence Transformations: (11 Springer Series in Computational Mathematics)
Sequence Transformations: (11 Springer Series in Computational Mathematics)

Sequence Transformations: (11 Springer Series in Computational Mathematics)


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

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).

Table of Contents:
1 The Various Kinds of Algorithmic Sequence Transformations.- 1 - Sequence Transformations.- 2 - Algorithms for Sequences and Algorithmic Transformations.- 3 - k-Normal Algorithms and k-Normal Transformations.- 4 - k-Memories Algorithms and k-Memories Transformations.- 5 - k-Stationary Algorithms and k-Stationary Transformations.- 6 - Rational Transformations and Linear Transformations.- 7 - Diagram of Inclusions.- References.- 2 Decidability and Undecidability in the Limit.- 1 - Definitions and the Normalisation Theorem.- 2 - Problems Concerning Convergence, Turbulence and Periodicity of Sequences.- 3 - Algorithms for Counting the Number of Accumulation Points.- 4 - Algorithms for Determining the Period of an Asymptotically Periodic Sequence.- (a) Methods of Detector Coefficients.- (b) Methods Using Barycenters.- (c) Limitation Results.- 5 - Families of Sequences of Iterations.- 6 - Two General Results Concerning the Decidability in the Limit.- Appendix 1 - Strength of an Accumulation Point and Quickness of a Sequence.- (a) Strength of an Accumulation Point.- (b) Quickness of a Sequence.- Appendix 2 - Decidability in the Limit and Recursivity..- Appendix 3 - Decidability of the Convergence, Turbulence and Asymptotic Periodicity of a Continuous Function.- References.- 3 Algorithms for Extracting Convergent Subsequences.- 1 - T-Algorithms.- 2 - S-Algorithms.- 3 - U-Algorithms.- 4 - Limitation Results.- References.- 4 The Partially Ordered Systems of Accelerable Families.- 1 - Acceleration Velocity, Acceleration, Prediction.- 2 - Transformations for Convergence Acceleration, Accelerable Families.- 3 - Examples of Accelerable Families of Sequences.- 4 - Relationships Between the Ordered Systems of Accelerable Families.- 5 - Maximal Accelerable Families.- References.- 5 Non-Accelerable Families of Sequences.- 1 - Remanence and First Applications.- 2 - Families of Monotones Sequences.- 3 - Alternating and Oscillating Sequences.- 4 - Families of Linearly Convergent Sequences.- 5 - Families of Logarithmically Convergent Sequences.- 6 - Table of Results.- References.- 6 Accelerating the Convergence of Linear Sequences.- 1 - Linearly Convergent and Periodico-Linearly Convergent Sequences.- (a) Problems on Convergence.- (b) Problems on Pseudo-Periodicity.- (c) Applications.- 2 - Acceleration of Periodico-Linear Sequences.- 3 - Optimality of the ?2 of Aitken.- (a) Algebraical Optimality.- (b) The Impossibility of Enlarging Lin.- (c) Acceleration of Degree 1+s on Lin.- References.- 7 Automatic Selection of Sequence Transformations.- 1 - General Methods.- (a) General Definitions for Selection Methods.- (b) Two Results on Selection Methods.- (c) Numerical Experiments.- 2 - Automatic Choice of Sequences of Parameters in the Richardson Extrapolation.- (a) Exactness Properties of the Transformations Obtained from the Richardson Process.- (b) Selection Among k-th Column Transformations.- (c) Selection Among k-th Diagonal Transformations.- (d) Selection Among Fast Diagonal Transformations.- References.


Best Sellers


Product Details
  • ISBN-13: 9783540152835
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Language: English
  • Series Title: 11 Springer Series in Computational Mathematics
  • ISBN-10: 3540152830
  • Publisher Date: 17 Aug 1988
  • Binding: Hardback
  • Returnable: N
  • Weight: 550 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Sequence Transformations: (11 Springer Series in Computational Mathematics)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Sequence Transformations: (11 Springer Series in Computational Mathematics)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Sequence Transformations: (11 Springer Series in Computational Mathematics)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!