Generating Functions, Z-Transforms, Laplace Transforms and the Solution of Linear Differential and Difference Equations

2016 ◽  
pp. 63-111
Author(s):  
Leonard C. Maximon
Keyword(s):  
Difference Equations ◽  
Generating Functions ◽  
Laplace Transforms ◽  
Linear Differential

scholarly journals Consistent systems of linear differential and difference equations

2019 ◽  
Vol 21 (9) ◽  
pp. 2751-2792
Author(s):  
Reinhard Schäfke ◽  
Michael Singer
Keyword(s):  
Difference Equations ◽  
Linear Differential

Analysis of Feedback Retrial Queue with Starting Failure and Server Vacation

2016 ◽  
pp. 71-96
Author(s):  
K. Sathiya Thiyagarajan ◽  
G. Ayyappan
Keyword(s):  
Steady State ◽  
Performance Measures ◽  
Generating Functions ◽  
Retrial Queue ◽  
Laplace Transforms ◽  
Time Dependent ◽  
Steady State Analysis ◽  
Starting Failure ◽  
Dependent Probability ◽  
Bernoulli Vacation

In this chapter we discusses a batch arrival feedback retrial queue with Bernoulli vacation, where the server is subjected to starting failure. Any arriving batch finding the server busy, breakdown or on vacation enters an orbit. Otherwise one customer from the arriving batch enters a service immediately while the rest join the orbit. After the completion of each service, the server either goes for a vacation with probability or may wait for serving the next customer. Repair times, service times and vacation times are assumed to be arbitrarily distributed. The time dependent probability generating functions have been obtained in terms of their Laplace transforms. The steady state analysis and key performance measures of the system are also studied. Finally, some numerical illustrations are presented.

Transition probability matrices for correlated random walks

1980 ◽  
Vol 17 (01) ◽  
pp. 253-258 ◽  
Author(s):  
R. B. Nain ◽  
Kanwar Sen
Keyword(s):  
Random Walk ◽  
Random Walks ◽  
Difference Equations ◽  
Generating Functions ◽  
Transition Probability ◽  
Correlated Random Walk ◽  
One Dimensional ◽  
Correlated Random Walks ◽  
Transition Probability Matrices ◽  
Probability Matrices

For correlated random walks a method of transition probability matrices as an alternative to the much-used methods of probability generating functions and difference equations has been investigated in this paper. To illustrate the use of transition probability matrices for computing the various probabilities for correlated random walks, the transition probability matrices for restricted/unrestricted one-dimensional correlated random walk have been defined and used to obtain some of the probabilities.

scholarly journals Finiteness Properties of Affine Difference Algebraic Groups

2020 ◽  
Author(s):  
Michael Wibmer
Keyword(s):  
Differential Equation ◽  
Linear Differential Equation ◽  
Difference Equations ◽  
General Linear Group ◽  
Algebraic Groups ◽  
The Matrix ◽  
Algebraic Difference ◽  
The Difference ◽  
Linear Differential ◽  
Finiteness Properties

Abstract We establish several finiteness properties of groups defined by algebraic difference equations. One of our main results is that a subgroup of the general linear group defined by possibly infinitely many algebraic difference equations in the matrix entries can indeed be defined by finitely many such equations. As an application, we show that the difference ideal of all difference algebraic relations among the solutions of a linear differential equation is finitely generated.

A sample path analysis of the M/M/1 queue

1989 ◽  
Vol 26 (02) ◽  
pp. 418-422 ◽  
Author(s):  
Francois Baccelli ◽  
William A. Massey
Keyword(s):  
Generating Functions ◽  
Queueing Networks ◽  
Transient Analysis ◽  
Bessel Functions ◽  
Sample Path ◽  
Laplace Transforms ◽  
Sample Path Analysis ◽  
Transient Distribution ◽  
The Past ◽  
Novel Approach

The exact solution for the transient distribution of the queue length and busy period of the M/M/1 queue in terms of modified Bessel functions has been proved in a variety of ways. Methods of the past range from spectral analysis (Lederman and Reuter (1954)), combinatorial arguments (Champernowne (1956)), to generating functions coupled with Laplace transforms (Clarke (1956)). In this paper, we present a novel approach that ties the computation of these transient distributions directly to the random sample path behavior of the M/M/1 queue. The use of Laplace transforms is minimized, and the use of generating functions is eliminated completely. This is a method that could prove to be useful in developing a similar transient analysis for queueing networks.

Sign in / Sign up

Export Citation Format

Share Document