Transient solutions of Markov processes by Krylov subspaces

Bernard Philippe 1 Roger Sidje 1
1 ALADIN - Algorithms Adapted to Intensive Numerical Computing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : In this note we exploit the knowledge embodied in infinitesimal generators of Markov processes to compute efficiently and economically the transient solution of continuous time Markov processes. We consider the Krylov subspace approximation method which has been analysed by Y. Saad for solving linear differential equations. We place special emphasis on error bounds and stepsize control. We discuss the computation of the exponential of the Hessenberg matrix involved in the approximation and an economic evaluation of the Pade method is presented. We illustrate the usefulness of the approach by providing some application examples.
Type de document :
[Research Report] RR-1989, INRIA. 1993
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 16:05:12
Dernière modification le : vendredi 16 novembre 2018 - 01:23:50
Document(s) archivé(s) le : lundi 5 avril 2010 - 00:12:51



  • HAL Id : inria-00074683, version 1


Bernard Philippe, Roger Sidje. Transient solutions of Markov processes by Krylov subspaces. [Research Report] RR-1989, INRIA. 1993. 〈inria-00074683〉



Consultations de la notice


Téléchargements de fichiers