skip to main content
research-article

Parallel Software to Offset the Cost of Higher Precision

Published:27 April 2021Publication History
Skip Abstract Section

Abstract

Hardware double precision is often insufficient to solve large scientific problems accurately. Computing in higher precision defined by software causes significant computational overhead. The application of parallel algorithms compensates for this overhead. Newton's method to develop power series expansions of algebraic space curves is the use case for this application.

References

  1. G. A. Baker and P. Graves-Morris. Padé Approximants, volume 59 of Encyclopedia of Mathematics and its Applications. Second edition, Cambridge University Press, 1996.Google ScholarGoogle ScholarCross RefCross Ref
  2. A. Burns and A. Wellings. Concurrent and Real-Time Programming in Ada. Cambridge University Press, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. N. Bliss and J. Verschelde. The method of Gauss-Newton to compute power series solutions of polynomial homotopies. Linear Algebra and Its Applications 542:569--588, 2018.Google ScholarGoogle ScholarCross RefCross Ref
  4. G. H. Golub and C. F. Van Loan. Matrix Computations. The Johns Hopkins University Press, 1983.Google ScholarGoogle Scholar
  5. A. Griewank and A. Walther. Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. SIAM, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Y. Hida, X. S. Li, and D. H. Bailey. Algorithms for quad-double precision floating point arithmetic. In the Proceedings of the 15th IEEE Symposium on Computer Arithmetic (Arith-15 2001), pages 155--162. IEEE Computer Society, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. Joldes, J.-M. Muller, V. Popescu, W. Tucker. CAMPARY: Cuda Multiple Precision Arithmetic Library and Applications. In Mathematical Software -- ICMS 2016, the 5th International Conference on Mathematical Software, pages 232--240, Springer-Verlag, 2016.Google ScholarGoogle ScholarCross RefCross Ref
  8. J. W. McCormick, F. Singhoff, and J. Hugues. Building Parallel, Embedded, and Real-Time Applications with Ada. Cambridge University Press, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A. Morgan. Solving Polynomial Systems using Continuation for Engineering and Scientific Problems, volume 57 of Classics in Applied Mathematics. SIAM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J.-M. Muller, N. Brunie, F. de Dinechin, C.-P. Jeannerod, M. Joldes, V. Lefevre, G. Melquiond, N. Revol, S. Torres. Handbook of Floating-Point Arithmetic. Second Edition, Springer-Verlag, 2018. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. S. M. Rump. Verification methods: Rigorous results using floating-point arithmetic. Acta Numerica 19:287--449, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  12. S. Telen, M. Van Barel, and J. Verschelde. A robust numerical path tracking algorithm for polynomial homotopy continuation. SIAM Journal on Scientific Computing 42(6):A3610--A3637, 2020.Google ScholarGoogle ScholarCross RefCross Ref
  13. S. Telen, M. Van Barel, and J. Verschelde. Robust numerical tracking of one path of a polynomial homotopy on parallel shared memory computers. In the Proceedings of the 22nd International Workshop on Computer Algebra in Scientific Computing (CASC 2020), volume 12291 of Lecture Notes in Computer Science, pages 563--582. Springer-Verlag, 2020.Google ScholarGoogle Scholar
  14. J. Verschelde. Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation. ACM Transactions on Mathematical Software 25(2):251--276, 1999. Runs online at www.phcpack.org. [15] R. J. Walker. Algebraic Curves. Princeton University Press, 1950. Google ScholarGoogle ScholarDigital LibraryDigital Library

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 ACM SIGAda Ada Letters
    ACM SIGAda Ada Letters  Volume 40, Issue 2
    December 2020
    55 pages
    ISSN:1094-3641
    DOI:10.1145/3463478
    • Editor:
    • Alok Srivastava
    Issue’s Table of Contents

    Copyright © 2021 Copyright is held by the owner/author(s)

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 27 April 2021

    Check for updates

    Qualifiers

    • research-article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader
About Cookies On This Site

We use cookies to ensure that we give you the best experience on our website.

Learn more

Got it!