Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open Problems

1988/06/01 by V. Ramaswami · 1 citation
Business, Management and Accounting · Mathematics · Decision Sciences · #Advanced Queuing Theory Analysis #Random Matrices and Applications #Probability and Risk Models

paper · doi:10.1137/1030046

Abstract

We draw attention to some important nonlinear equations commonly arising in applied probability, review some known techniques to compute their minimal nonnegative solutions, propose improved iterative techniques, and identify a number of open problems. Such equations arise ubiquitously in the numerical solution of many stochastic models in queueing, inventory, communications, and dam theories. The development of efficient algorithms and error analyses for these problems is, therefore, of substantial importance in enlarging the set of stochastic models that can be solved by algorithmic methods.

Cited by

• A fast Newton-Shamanskii iteration for M/G/1-type and GI/M/1-type Markov chains

Related

• On the Solution to a Countable System of Equations Arising in Stochastic Processes
• Stochastic solutions of nonlinear pde's: McKean versus superprocesses
• A family of fast fixed point iterations for M/G/1-type Markov chains
• Matrix-analytic methods for solving Poisson's equation with applications to Markov chains of GI/G/1-type
• A fast Newton-Shamanskii iteration for M/G/1-type and GI/M/1-type Markov chains