Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

USE OF CYCLICITY FOR SOLVING SOME MATRIX PROBLEMS

  • Published : 1998.09.01

⟨ Previous Next ⟩

Abstract

We look for methods and conditions to make use of cyclicity in come matrix problems not only for parallel computa-tion 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.

Keywords

References

  1. Matrix computations(3rd. ed.) G.Golub;C. Van Loan
  2. SIAM J. Sci. Comput. v.4 Matrix methods for queuing problems L.Kaufman
  3. Numerical analysis : A second course J.M.Ortega
  4. Comm. Korean Math. Soc. v.10 A domain decomposition method applied to queuing network problems P.Park
  5. Korean J. Comp. & Appl. Math. v.3 Use of an orthogonal projector for accelerating a queuing problem solver P.Park
  6. Sparse matrix technology S.Pissanetzky
  7. Non-negative matrices and Markov chains(2nd ed.) E.Seneta