Random-walk interpretations of classical iteration methods (Q1805214): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jonathan B. Goodman / rank
Normal rank
 
Property / author
 
Property / author: Jonathan B. Goodman / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(93)00101-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982863946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is SOR Color-Blind? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Optimal Tests for Finite Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large deviations for a general class of random vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: RANDOM EVOLUTIONS, MARKOV CHAINS, AND SYSTEMS OF PARTIAL DIFFERENTIAL EQUATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential theory for infinitely divisible processes on Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342712 / rank
 
Normal rank

Latest revision as of 13:21, 23 May 2024

scientific article
Language Label Description Also known as
English
Random-walk interpretations of classical iteration methods
scientific article

    Statements

    Random-walk interpretations of classical iteration methods (English)
    0 references
    0 references
    0 references
    12 June 1995
    0 references
    Simple probabilistic interpretations of classical Jacobi and Gauss-Seidel iteration methods for discrete Laplacian operators are given. The probability background is illustrated on three examples. The random-walk interpretation is discussed to compare convergence rates of different relaxation methods (Gauss-Seidel standard ordering, Gauss-Seidel red- black ordering, \(2 \times 2\) block Jacobi, \(2 \times 2\) block Gauss- Seidel standard ordering) for the five-point Laplacian. The procedure is extended for the nine-point Laplacian. The underrelaxation technique is discussed.
    0 references
    0 references
    0 references
    0 references
    0 references
    random-walk interpretations
    0 references
    Jacobi method
    0 references
    Gauss-Seidel standard ordering
    0 references
    probabilistic interpretations
    0 references
    Gauss-Seidel iteration methods
    0 references
    discrete Laplacian operators
    0 references
    convergence rates
    0 references
    relaxation methods
    0 references
    Gauss-Seidel red-black ordering
    0 references
    five-point Laplacian
    0 references
    nine-point Laplacian
    0 references
    underrelaxation
    0 references
    0 references