Abstract
We look for methods and conditions to make use of cyclicity in some matrix problems, not only for parallel computation but also to reduce the problem size and accelerate convergence. It has been shown that some form of reducibility, not necessarily cyclicity, is enough for such purposes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. Golub and C. Van Loan,Matrix computations, 3rd. ed., Johns Hopkins University Press, Baltimore, 1996.
L. Kaufman,Matrix methods for queuing problems, SIAM J. Sci. Comput.,4(1983), 525–552.
J. M. Ortega,Numerical analysis: A second course, Academic Press, New York, 1972.
P. Park,A domain decomposition method applied to queuing network problems, Comm. Korean Math. Soc.,10(1995), 735–750.
P. Park,Use of an orthogonal projector for accelerating a queuing problem solver, Korean J. Comp. & Appl. Math.,3(1996), 193–204.
S. Pissanetzky,Sparse matrix technology, Academic Press, London, 1984.
E. Seneta,Non-negative matrices and Markov chains, 2nd ed., Springer-Verlag, New York, 1981.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Park, P.S. Use of cyclicity for solving some matrix problems. Korean J. Comput. & Appl. Math. 5, 481–493 (1998). https://doi.org/10.1007/BF03008876
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03008876