Abstract
In this paper we describe iterative methods for finding the null vectors of large sparse unsymmetric singular matrices which arise while modeling queuing networks. We find that these matrices often have some useful algebraic structure, and that classical methods often applied to solving nonsingular problems arising in the study of differential equations can be used for these types of problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
L. Kaufman, J. B. Seery, and J. A. Morrison, "Overflow Models for Dimension PBX Feature Packages", Bell System Technical Journal, Vol 60, No. 5, May–June 1981.
L. Kaufman, B. Gopinath, and E. F. Wunderlich, "Sparse Matrix Algorithms for a Packet Network Control Analysis", Bell Labs Computer Science Technical Report #82, 1980.
R. Bank and D. Rose, "Marching Algorithms for Elliptic Boundary Value Problems. I. The Constant Coefficient Case", SIAM J. Numer Anal., Vol 14, No. 5, October 1977, pp. 792–829.
R. Varga, "Matrix Iterative Analysis", Prentice Hall, Inc., Englewood Cliffs, New Jersey, 1962.
B. L. Buzbee, G. H. Golub and C. W. Nielson, "On Direct Methods for Solving Poisson's Equation," SIAM J. Numer Anal., Vol 7, 1970, pp. 627–656.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag
About this paper
Cite this paper
Kaufman, L. (1982). Solving large sparse linear systems arising in queuing problems. In: Hinze, J. (eds) Numerical Integration of Differential Equations and Large Linear Systems. Lecture Notes in Mathematics, vol 968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0064901
Download citation
DOI: https://doi.org/10.1007/BFb0064901
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11970-8
Online ISBN: 978-3-540-39374-0
eBook Packages: Springer Book Archive