A computer algebra approach to the discrete Dirichlet problem (Q1342137)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A computer algebra approach to the discrete Dirichlet problem
scientific article

    Statements

    A computer algebra approach to the discrete Dirichlet problem (English)
    0 references
    0 references
    0 references
    11 March 1996
    0 references
    The authors consider random walks on regular lattices, in particular the classical gambler ruin problem and a two-dimensional analogue. To find the expected duration, they use generating functions, which they analyze using the method of Gröbner basis taking the normal form of a polynomial. This key implement using the symbolic software package MAPLE. The particular examples are worked out in detail.
    0 references
    discrete Dirichlet problem
    0 references
    random walks
    0 references
    gambler ruin problem
    0 references
    generating functions
    0 references
    Gröbner basis
    0 references
    software package MAPLE
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references