In multiprocessor systems, iterative algorithms can be implemented synchronously or asynchronously. Unfortunately, few guidelines exist to make a choice. In this paper, we compare the execution times of an asynchronous iterative algorithm and of its synchronous counterpart. Synchronization overhead
On Accelerating the Convergence of Nonlinear Iterative Algorithms
β Scribed by D.W. Black; A.P. Rothmayer
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 505 KB
- Volume
- 111
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
β¦ Synopsis
The underlying theory of vector sequence extrapolation methods for linear and nonlinear problems is examined. It is shown that nonlinearity limits savings in total number of iterations to (50 %) for strongly nonlinear problems when linear-based extrapolation methods are used. In support of this conclusion, convergence behaviors of solutions of Burgers' equation and an interacting boundary layer problem are examined. Supporting evidence from the work of previous researchers is also presemted. A possible means of circumventing this limitation by including nonlinear terms in the extrapolation is suggested. Results of this method for a scalar model problem and a solution to Burgers' equation are given, showing that the (50 %) limitation can be circumvented. c. 1994 Academic Press. Inc.
π SIMILAR VOLUMES
We discuss several methods for accelerating the convergence of the iterative solution of nonlinear equation systems commonly in tion they are solved by iteration (for a more detailed deuse and point to interrelations between them. In particular we invesscription see Ref. [9] and references therein)