Orders of convergence for superlinearly convergent chaotic iterations
From MaRDI portal
Publication:1179545
DOI10.1007/BF02242025zbMath0746.65050OpenAlexW402825597MaRDI QIDQ1179545
Publication date: 26 June 1992
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02242025
Iterative procedures involving nonlinear operators (47J25) Parallel numerical computation (65Y05) Numerical solutions to equations with nonlinear operators (65J15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the roots of a polynomial on an MIMD multicomputer
- Convergence of asynchronous iteration with arbitrary splitting form
- Sufficient conditions for the convergence of asynchronous iterations
- Some convergence results for asynchronous algorithms
- Generalized nonlinear diagonal dominance and applications to asynchronous iterative methods
- Chaotic relaxation
- On asynchronous iterations in partially ordered spaces
- M-Functions and Parallel Asynchronous Algorithms
- Distributed asynchronous computation of fixed points
- Asynchronous Iterative Methods for Multiprocessors
This page was built for publication: Orders of convergence for superlinearly convergent chaotic iterations