Skip to main content
Log in

Orders of convergence for superlineary convergent chaotic iterations

Konvergenzordnungen für überlinear konvergente chaotische Iterationsverfahren

  • Published:
Computing Aims and scope Submit manuscript

Abstract

We prove some relationships between the order of convergence of the total step method for a given operator and corresponding chaotic iterations. In particular we establish conditions under which superlinear convergence is preserved in the chaotic case.

Zusammenfassung

Wir beweisen Zusammenhänge zwischen der Konvergenzordnung des Gesamtschrittverfahrens für einen gegebenen Operator und zugehörigen chaotischen Iterationsverfahren. Insbesondere stellen wir Bedingungen auf, unter denen überlineare Konvergenz im chaotischen Fall erhalten bleibt.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Baudet, G.: Asynchronous iterative methods for multiprocessors. J. ACM25, 226–244 (1978).

    Google Scholar 

  2. Bertsekas, D.: Distributed asynchronous computation of fixed points. Math. Prog.27, 107–120 (1983).

    Google Scholar 

  3. Bertsekas, D., Tsitsiklis, J.: Parallel and distributed computation. Englewood Cliffis: Prentice Hall (1989).

    Google Scholar 

  4. Chazan D, Miranker, W.: Chaotic relaxation. Linear Algebra Appl.2, 199–222 (1969).

    Google Scholar 

  5. Cosnard, M., Fraigniaud, P.: Asynchronous Durand-Kerner and Aberth polynomial root finding methods on a distributed memory multicomputer, in: Evans, D., Joubert, G., Peters, F. (eds.) Parallel Computing 89, Amsterdam: North Holland (1990).

    Google Scholar 

  6. El Baz, D.:M-functions and parallel asynchronouse algorithms. SIAM J. Numer. Anal.27, 136–140 (1990).

    Google Scholar 

  7. El Tarazi, M.: Some convergence results for synchronous algorithms. Numer. Math.39, 325–340 (1982).

    Google Scholar 

  8. Fraigniaud, P.: Analytic and asynchronous root finding methods a disitributed memory multicomputer. Research Report LIP-IMAG, Ecole Normale Supérieure de Lyon (1989).

  9. Frommer, A.: Generalized nonlnear diagonal dominance and applications to asynchronous iterative methods, to appear in J. Computer. Appl. Math.

  10. Frommer, A.: On asynchronous iteirations in partially ordered spaces, to appear in J. Numer. Funct. Anal. Opt.

  11. Lei, L.: Convergence of asynchronous iteriatio with arbitrary splitting form. Linear Algebra Appl.113, 119–127 (1989).

    Google Scholar 

  12. Miellou, J.-C.: Itératious chaotiques à retards; études de la convergence dans le cas d'espaces partiellement ordonnés, Comptes Rendus de l'acad, Sci. Paris, Ser. A280, 233–236 (1975).

    Google Scholar 

  13. Ortega, J., Rheinboldt, W.: Iterative solution of nonlinear equations in several variables. New York: Academic Press 1970.

    Google Scholar 

  14. Robert, F., Charnay, M., Musy, F.: Itérations chaotiques série-paralléle pour des équations nonlinéaires de point fixe. Appl. Mat.20, 1–38 (1975).

    Google Scholar 

  15. Üresin, A., Dubois, M.: Sufficient conditions for the convergence of asynchronous iterations. Parallel Comput.10, 83–92 (1989).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Dedicated to W. L. Mirankev on the occasionof his 60th birthday

Rights and permissions

Reprints and permissions

About this article

Cite this article

Frommer, A. Orders of convergence for superlineary convergent chaotic iterations. Computing 47, 97–101 (1991). https://doi.org/10.1007/BF02242025

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02242025

AMS (MOS) subject Classifications

Key words

Navigation