Structure theorems for partially asynchronous iterations of a nonnegative matrix with random delays | Zendy

Reza Gharavi | Zendy; Venkat Anantharam | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Structure theorems for partially asynchronous iterations of a nonnegative matrix with random delays

Author(s) -

Reza Gharavi,

Venkat Anantharam

Publication year - 1999

Publication title -

sadhana

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.268

H-Index - 49

eISSN - 0973-7677

pISSN - 0256-2499

DOI - 10.1007/bf02823148

Subject(s) - ergodic theory , asynchronous communication , convergence (economics) , invariant (physics) , mathematics , matrix (chemical analysis) , lyapunov exponent , graph , computer science , discrete mathematics , pure mathematics , economics , mathematical physics , economic growth , computer network , materials science , composite material , artificial intelligence , chaotic

We consider partially asynchronous parallel iteration of a fixed nonnegative matrixwith stationary ergodic interprocessor communication delays. We study theiteration via a random graph describing the interprocessor influences. Our majorresult is an invariant description of the rates of convergence of arbitrary sequencesof individual processor-time values. In the course of proving this result a numberof other invariant properties of the convergence of the iteration are described. The...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research