A computer algebra approach to the discrete Dirichlet problem
type: Item
instance of: scholarly article
title: A computer algebra approach to the discrete Dirichlet problem
zbMATH Open document ID: 0832.65115
author: Craig R. Orr
author: Doron Zeilberger
published in: Journal of Symbolic Computation
publication date: 1996-03-11T00:00:00Z
review text: 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.
reviewed by: James R. Kuttler
Mathematics Subject Classification ID: 65N06
Mathematics Subject Classification ID: 65C99
Mathematics Subject Classification ID: 13P10
Mathematics Subject Classification ID: 60G50
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 710089
zbMATH Keywords: discrete Dirichlet problem
zbMATH Keywords: random walks
zbMATH Keywords: gambler ruin problem
zbMATH Keywords: generating functions
zbMATH Keywords: Gröbner basis
zbMATH Keywords: software package MAPLE
describes a project that uses: Maple
MaRDI profile type: Publication
OpenAlex ID: W2022292542
DOI: 10.1006/JSCO.1994.1038
description: scientific article; zbMATH DE number 710089