The Successive Over Relaxation Method (SOR) and Markov Chains

Wilhelm Niethammer ()

Annals of Operations Research, 2001, vol. 103, issue 1, 358 pages

Abstract: In the sixties SOR has been the working horse for the numerical solution of elliptic boundary problems; classical results for chosing the relaxation parameter have been derived by D. Young and R.S. Varga. In the last fifteen years SOR has been examined for the computation of the stationary distribution of Markov chains. In the paper there are pointed out similarities and differences compared with the application of SOR for elliptic boundary problems. Copyright Kluwer Academic Publishers 2001

Date: 2001
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1012936012660 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:103:y:2001:i:1:p:351-358:10.1023/a:1012936012660

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1012936012660

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().