A computer algebra approach to the discrete Dirichlet problem

DOI10.1006/jsco.1994.1038zbMath0832.65115OpenAlexW2022292542MaRDI QIDQ1342137

Doron Zeilberger, Craig R. Orr

Publication date: 11 March 1996

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/54242e1d1bf425913d9246128548d502b4e50caf

zbMATH Keywords

generating functionsGröbner basisrandom walksdiscrete Dirichlet problemgambler ruin problemsoftware package MAPLE

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Sums of independent random variables; random walks (60G50) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Finite difference methods for boundary value problems involving PDEs (65N06) Probabilistic methods, stochastic differential equations (65C99)

Related Items (3)

The Two-Dimensional Asymmetric Gambler's Ruin Problem withnPlayers and Simulations ⋮ Variance of the asymmetric n-player gambler’s ruin problem with ties allowed ⋮ Gambler's ruin problem in several dimensions

Uses Software

• Maple

This page was built for publication: A computer algebra approach to the discrete Dirichlet problem