ISSN:
1572-9265
Keywords:
queueing problems
;
M/G/1 type matrices
;
cyclic reduction
;
Toeplitz matrices
;
FFT
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract The cyclic reduction technique (Buzbee et al., 1970), rephrased in functional form (Bini and Meini, 1996), provides a numerically stable, quadratically convergent method for solving the matrix equation X = ∑+ ∞ i=0 Xi Ai, where the Ai's are nonnegative k × k matrices such that ∑+ ∞ i=0 Ai is column stochastic. In this paper we propose a further improvement of the above method, based on a point-wise evaluation/interpolation at a suitable set of Fourier points, of the functional relations defining each step of cyclic reduction (Bini and Meini,1996). This new technique allows us to devise an algorithm based on FFT having a lower computational cost and a higher numerical stability. Numerical results and comparisons are provided.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1019206402431
Permalink
