Abstract
The main difficulty in parallelization and synchronization of computations for speeding up the convergence of iterative procedures is the optimal guaranteed convergence rate estimation. A theorem is formulated concerning the guaranteed convergence rate estimates for certain procedures, in which resources are primarily allotted to the computation of nonlinearity components. Its proof is based on the use of new estimates for the spectral radii of the products of matrix sequences of asynchronous component computations.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
