A probabilistic analysis of asynchronous iteration

DOI10.1016/S0024-3795(02)00258-6zbMath1007.65017MaRDI QIDQ1611861

John C. Strikwerda

Publication date: 28 August 2002

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

convergenceparallel computingprobabilistic analysisasynchronous iteration

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items (5)

On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equations ⋮ On the convergence of asynchronous parallel iteration with unbounded delays ⋮ On Monte Carlo methods in distributed memory systems ⋮ Asynchronous iterations with flexible communication: contracting operators ⋮ Consensus‐based distributed sensor calibration and least‐square parameter identification in WSNs

Uses Software

• Unnamed Item

Cites Work

• A convergence theorem for chaotic asynchronous relaxation
• On asynchronous iterations
• Chaotic relaxation
• Asynchronous Iterative Methods for Multiprocessors
• Unnamed Item
• Unnamed Item

This page was built for publication: A probabilistic analysis of asynchronous iteration