Skip to main content

An Algebraic Multigrid Method Based on Matching in Graphs

  • Conference paper
  • First Online:
Domain Decomposition Methods in Science and Engineering XX

Part of the book series: Lecture Notes in Computational Science and Engineering ((LNCSE,volume 91))

Abstract

We present an Algebraic Multigrid (AMG) method for graph Laplacian problems. The coarse graphs are constructed recursively by pair-wise aggregation, or matching as in [3] and we use an Algebraic Multilevel Iterations (AMLI) [1, 6] for the solution phase.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Bibliography

  1. O. Axelsson and P. S. Vassilevski. Algebraic multilevel preconditioning methods. II. SIAM J. Numer. Anal., 27(6):1569–1590, 1990.

    Google Scholar 

  2. R. D. Falgout, P.S. Vassilevski, and L.T. Zikatanov. On two-grid convergence estimates. Numer. Linear Algebra Appl., 12(5–6):471–494, 2005.

    Article  MathSciNet  MATH  Google Scholar 

  3. H. Kim, J. Xu, and L. Zikatanov. A multigrid method based on graph matching for convection-diffusion equations. Numer. Linear Algebra Appl., 10(1–2):181–195, 2003.

    Article  MathSciNet  MATH  Google Scholar 

  4. Yousef Saad. Iterative methods for sparse linear systems. SIAM, Philadelphia, PA, 2nd edition, 2003.

    Google Scholar 

  5. U. Trottenberg, C. W. Oosterlee, and A. Schüller. Multigrid. Academic Press Inc., San Diego, CA, 2001.

    MATH  Google Scholar 

  6. P. S. Vassilevski. Multilevel block factorization preconditioners. Springer, New York, 2008.

    MATH  Google Scholar 

Download references

Acknowledgements

The authors gratefully acknowledge the support by the Austrian Academy of Sciences and by the Austrian Science Fund (FWF), Project No. P19170-N18 and the support from the National Science Foundation under grants NSF-DMS 0810982 and NSF-OCI 0749202.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to James Brannick .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brannick, J., Chen, Y., Kraus, J., Zikatanov, L. (2013). An Algebraic Multigrid Method Based on Matching in Graphs. In: Bank, R., Holst, M., Widlund, O., Xu, J. (eds) Domain Decomposition Methods in Science and Engineering XX. Lecture Notes in Computational Science and Engineering, vol 91. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35275-1_15

Download citation

Publish with us

Policies and ethics