skip to main content
department
Free Access

A breakthrough in algorithm design

Published:01 September 2011Publication History
Skip Abstract Section

Abstract

Computer scientists at Carnegie Mellon University have devised an algorithm that might be able to solve a certain class of linear systems much more quickly than today's fastest solvers.

References

  1. Koutis, I., Miller, G.L., and Peng, R. Approaching optimality for solving SDD linear systems, Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, Las Vegas, NV, Oct. 23-26, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Spielman, D.A. and Teng, S-H. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, June 13-16, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Koutis, I., Miller, G.L., and Tolliver, D. Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing, Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I, Las Vegas, NV, Nov. 30-Dec. 2, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Blelloch, G.E., Koutis, I., Miller, G.L., and Tangwongsan, K. Hierarchical diagonal blocking and precision reduction applied to combinatorial multigrid, Proceedings of the 2010 ACM/ IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, New Orleans, LA, Nov. 13-19, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Teng, S.-H. The Laplacian paradigm: Emerging algorithms for massive graphs. Lecture Notes in Computer Science 6108, Kratochvíl, J., Li, A., Fiala, J., and Kolman, P. (Eds.), Springer-Verlag, Berlin, Germany, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A breakthrough in algorithm design

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image Communications of the ACM
          Communications of the ACM  Volume 54, Issue 9
          September 2011
          121 pages
          ISSN:0001-0782
          EISSN:1557-7317
          DOI:10.1145/1995376
          Issue’s Table of Contents

          Copyright © 2011 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 September 2011

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • department
          • Popular
          • Un-reviewed

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format .

        View HTML Format