
doi: 10.1007/bf02242025
If on computers with multiprocessors individual processors are allowed to proceed without waiting for each other it is natural to consider so- called chaotic iterations for computations on such computers. The author proves a theorem giving conditions for superlinear convergence of chaotic iterations in an appropriate setting. The theorem also contains a statement on the \(R\)-order of the sequence generated. The author remarks that the new theorem can be regarded as giving a relationship between the speed of convergence of the total step or Gauss- Jacobi method for a given (in general nonlinear) mapping and chaotic iteration methods.
ddc:510, Numerical solutions to equations with nonlinear operators, multiprocessors, Parallel numerical computation, chaotic iterations, Gauss-Jacobi method, 510, Iterative procedures involving nonlinear operators, superlinear convergence, \(R\)-order, Mathematics, info:eu-repo/classification/ddc/510
ddc:510, Numerical solutions to equations with nonlinear operators, multiprocessors, Parallel numerical computation, chaotic iterations, Gauss-Jacobi method, 510, Iterative procedures involving nonlinear operators, superlinear convergence, \(R\)-order, Mathematics, info:eu-repo/classification/ddc/510
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
