Random Relaxation of Fixed-Point Iteration

DOI10.1137/0917058zbMATH Open0865.65107OpenAlexW2021871873MaRDI QIDQ4891741FDOQ4891741

Authors: Markku Verkama 

Publication date: 16 July 1997

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0917058

Recommendations

• A probabilistic analysis of asynchronous iteration
• scientific article; zbMATH DE number 1788242
• Asynchronous iterations with flexible communication: contracting operators
• A convergence theorem for chaotic asynchronous relaxation
• scientific article; zbMATH DE number 7733450

zbMATH Keywords

convergenceasynchronous fixed-point iterationsparallel distributed computationrandom relaxationstochastic fixed-point iteration

Mathematics Subject Classification ID

Probabilistic methods, stochastic differential equations (65C99) Parallel numerical computation (65Y05) Signal detection and filtering (aspects of stochastic processes) (60G35) Iterative numerical methods for linear systems (65F10)

Cited In (3)

• Further results on convergence of asynchronous linear iterations
• Title not available (Why is that?)
• Game theoretic best-response dynamics for evacuees' exit selection

This page was built for publication: Random Relaxation of Fixed-Point Iteration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4891741)