Matrix equations in Markov modulated Brownian motion: theoretical properties and numerical solution

Soohan Ahn, Beatrice Meini

Research output: Contribution to journalArticlepeer-review

Abstract

A Markov modulated Brownian motion (MMBM) is a substantial generalization of the classical Brownian motion and is obtained by allowing the Brownian parameters to be modulated by an underlying Markov chain of environments. As in Brownian motion, the stationary analysis of the MMBM becomes easy once the distributions of the first passage time between levels are determined. Asmussen (Stochastic Models, 1995) proved that such distributions can be obtained by solving a suitable quadratic matrix equation (QME), while, more recently, Ahn and Ramaswami (Stochastic Models, 2017) derived the distributions from the solution of a suitable algebraic Riccati equation (NARE). In this paper we provide an explicit algebraic relation between the QME and the NARE, based on a linearization of a matrix polynomial. Moreover, we discuss the doubling algorithms such as the structure-preserving doubling algorithm (SDA) and alternating-directional doubling algorithm (ADDA), with shifting technique, which are used for finding the sought of the NARE.

Original languageEnglish
Pages (from-to)251-284
Number of pages34
JournalStochastic Models
Volume36
Issue number2
DOIs
StatePublished - 2 Apr 2020

Keywords

  • Doubling algorithm
  • Markov modulated Brownian motion
  • first passage time distribution
  • matrix polynomials
  • nonsymmetric algebraic Riccati equation
  • quadratic convergence
  • quadratic matrix equation

Fingerprint

Dive into the research topics of 'Matrix equations in Markov modulated Brownian motion: theoretical properties and numerical solution'. Together they form a unique fingerprint.

Cite this