Skip to main content
SpringerLink
Log in

Local Convergence of (Exact and Inexact) Iterative Aggregation

  • Conference paper
Book cover Linear Algebra, Markov Chains, and Queueing Models

Part of the book series: The IMA Volumes in Mathematics and its Applications ((IMA,volume 48))

Abstract

Iterative aggregation methods are studied in two cases: the solution of linear systems of equaitons and finding stationary distributions of Markov Chains. Local convergence proofs are outlined for the exact method, as well as for the method were the system in the smaller space is solved only approximately.

This work was supported by the National Science Foundation grants DMS-8807338 and INT-9196077.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abraham Berman and Robert J. Plemmons. Nonnegative Matrices in the Mathematical Sciences. Academic Press, New York, 1979.

    MATH  Google Scholar 

  2. Wei-Lu Cao and William J. Stewart. Iterative aggregation/disaggregation techniques for nearly uncoupled Markov chains. Journal of the ACM, 32:702–719, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  3. Françoise Chatelin. Iterative aggregation/disaggregation methods. In G. Iazeolla, P. J. Courtois, and A. Hordijk, editors, Mathematical Computer Performance and Reliability, pages 199–207, Amsterdam — New York — Oxford, 1984. North-Holland.

    Google Scholar 

  4. Françoise Chatelin and Willard L. Miranker. Acceleration of successive approximations. Linear Algebra and its Applications, 43:17–47, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  5. Françoise Chatelin and Willard L. Miranker. Aggregation/disaggregation for eigenvalue problems. SIAM Journal on Numerical Analysis, 21:567–582, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  6. Andreas Frommer and Daniel B. Szyld. H-splittings and two-stage iterative methods. Research Report 91–71, Department of Mathematics, Temple University, July 1991. Numerische Mathematik, to appear.

    Google Scholar 

  7. Gene H. Golub and Michael L. Overton. The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems. Numerische Mathematik, 53:571–593, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  8. Moshe Haviv. Aggregation/disaggregation methods for computing the stationary distribution of a Markov chain. SIAM Journal on Numerical Analysis, 14:952–966, 1987.

    Article  MathSciNet  Google Scholar 

  9. Paul J. Lanzkron, Donald J. Rose, and Daniel B. Szyld. Convergence of nested classical iterative methods for linear systems. Numerische Mathematik, 58:685–702, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  10. Jan Mandel. A convergence analysis of the iterative aggregation method with one parameter. Linear Algebra and its Applications, 59:159–169, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  11. Jan Mandel and Bohuslav Sekerka. A local convergence proof for the iterative aggregation method. Linear Algebra and its Applications, 51:163–172, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  12. Ivo Marek. Aggregation and homogenization in reactor diffusion. In E. Adams, R. Ansoge, Ch. Grossman, and H. G. Ross, editors, Discretization in Differential Equations and Enclosures, Mathematical Research, Bd. 36, pages 145–154, Berlin, 1987. Akademie.

    Google Scholar 

  13. Ivo Marek. Aggregation methods of computing stationary distribution of Markov processes. In W. Velte, editor, Eigenvalue Problems and their Numerical Treatment, Proceedings of the Conference held at the Mathematisches Forschunginstitut Oberwolfach, February 26 — March 2, 1990, International Series in Numerical Mathematics (ISNM) Vol. 96, pages 155–169, Basel, 1991. Birkhäuser.

    Google Scholar 

  14. Ivo Marek and Daniel B. Szyld. Iterative aggregation with inexact correction. Research Report 91–52, Department of Mathematics, Temple University, May 1991.

    Google Scholar 

  15. Ivo Marek and Daniel B. Szyld. Iterative and semiiterative methods for computing stationary probability vectors of Markov operators. Research Report 91–101, Department of Mathematics, Temple University, October 1991.

    Google Scholar 

  16. Jorge J. More. Global convergence of Newton-Gauss-Seidel methods. SIAM Journal on Numerical Analysis, 8:325–336, 1971.

    Article  MathSciNet  MATH  Google Scholar 

  17. Paul J. Schweitzer. Aggregation methods for large Markov chains. In G. Iazeolla, P. J. Courtois, and A. Hordijk, editors, Mathematical Computer Performance and Reliability, pages 275–286, Amsterdam — New York — Oxford, 1984. North-Holland.

    Google Scholar 

  18. Paul J. Schweitzer. A survey of aggregation-disaggregation in large Markov chains. In William J. Stewart, editor, Numerical Solution of Markov Chains, pages 63–88, New Yrok — Basel — Hong Kong, 1991. Marcel Dekker.

    Google Scholar 

  19. G. W. Stewart, W. J. Stewart, and D. F. McAllister. A two-staged iteration for solving nearly uncoupled Markov chains. Technical Report TR-1384, Department of Computer Science, University of Maryland, College Park, Maryland 20742, April 1984.

    Google Scholar 

  20. Daniel B. Szyld and Mark T. Jones. Two-stage and multi-splitting methods for the parallel solution of linear systems. SIAM Journal on Matrix Analysis and Applications, 13:671–679, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  21. Kunio Tanabe. The conjugate gradient method for computing all extremal stationary probability vectors of a stochastic matrix. Ann. Inst. Stat. Math., Part B, 37:173–187, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  22. I. Y. Vakhutinsky, L. M. Dudkin, and A. A. Ryvkin. Iterative aggregation — a new approach to the solution of large-scale problems. Econometrica, 47:821–841, 1979.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Temple University, Philadelphia, Pennsylvania, 19122-2585, USA

    Daniel B. Szyld

Authors
  1. Daniel B. Szyld
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematics Department, North Carolina State University, 27695-8205, Raleigh, NC, USA

    Carl D. Meyer

  2. Department of Mathematics and Computer Science, Wake Forest University, 27109, Winston-Salem, NC, USA

    Robert J. Plemmons

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag New York, Inc.

About this paper

Cite this paper

Szyld, D.B. (1993). Local Convergence of (Exact and Inexact) Iterative Aggregation. In: Meyer, C.D., Plemmons, R.J. (eds) Linear Algebra, Markov Chains, and Queueing Models. The IMA Volumes in Mathematics and its Applications, vol 48. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8351-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-8351-2_10

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4613-8353-6

  • Online ISBN: 978-1-4613-8351-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation