Solving linear systems by methods based on a probabilistic interpretation

DOI10.1007/BF02243479zbMath0444.65017OpenAlexW1917872047MaRDI QIDQ1144900

Jaap Wessels, J. A. E. E. Van Nunen

Publication date: 1981

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02243479

zbMATH Keywords

probabilistic approachoverrelaxation methodsfaster convergencepoint and block Gauss-Seidel methodspoint and block Jacobi methodsstopping time in a random process

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Iterative numerical methods for linear systems (65F10) Optimal stopping in statistics (62L15)

Related Items (2)

On using discrete random models within decision support systems ⋮ Quicker Convergence for Iterative Numerical Solutions to Stochastic Problems: Probabilistic Interpretations, Ordering Heuristics, and Parallel Processing

Cites Work

• Unnamed Item
• Unnamed Item
• Action-dependent stopping times and Markov decision process with unbounded rewards
• Markov programming by successive approximations with respect to weighted supremum norms
• A modified dynamic programming method for Markovian decision problems
• Iterative solution of the functional equations of undiscounted Markov renewal programming
• Bounds and Transformations for Discounted Finite Markov Decision Chains
• Discounting, Ergodicity and Convergence for Markov Decision Processes
• A set of successive approximation methods for discounted Markovian decision problems
• On strong ergodicity of inhomogeneous products of finite stochastic matrices

This page was built for publication: Solving linear systems by methods based on a probabilistic interpretation