Page 1

Displaying 1 – 2 of 2

Showing per page

Directed forests with application to algorithms related to Markov chains

Piotr Pokarowski (1999)

Applicationes Mathematicae

This paper is devoted to computational problems related to Markov chains (MC) on a finite state space. We present formulas and bounds for characteristics of MCs using directed forest expansions given by the Matrix Tree Theorem. These results are applied to analysis of direct methods for solving systems of linear equations, aggregation algorithms for nearly completely decomposable MCs and the Markov chain Monte Carlo procedures.

Dynamical systems method for solving linear finite-rank operator equations

N. S. Hoang, A. G. Ramm (2009)

Annales Polonici Mathematici

A version of the dynamical systems method (DSM) for solving ill-conditioned linear algebraic systems is studied. An a priori and an a posteriori stopping rules are justified. An iterative scheme is constructed for solving ill-conditioned linear algebraic systems.

Currently displaying 1 – 2 of 2

Page 1