A fast parallel algorithm to numerically compute the Markov renewal kernel via tight lower and upper bounds /

In this dissertation, a fast numerical algorithm for computing the Markov renewal kernel via tight lower and upper bounds is developed. The Markov renewal kernel can then used to solve the well-known Markov renewal equation. Error analysis shows the numerically obtained bounds to be tight. The algor...

Full description

Bibliographic Details

Main Author:	Elkins, Debra Ann
Format:	Thesis Book
Language:	English
Published:	[Place of publication not identified] : [publisher not identified] ; 2000.
Subjects:	Major industrial engineering.
Online Access:	http://proxy.library.tamu.edu/login?url=http://proquest.umi.com/pqdweb?did=731990051&sid=1&Fmt=2&clientId=2945&RQT=309&VName=PQD