Parallel degree computation for binomial systems. (March 2017)

• Record Type: Journal Article
• Authors: Chen, Tianran; Mehta, Dhagash
• Is Part Of: Journal of symbolic computation. Volume 79:Part 3(2017)
• Page Start: 535
• Page End: 558
• Publication Date: 2017-03
• Subjects: Binomial systems -- Homotopy continuation -- Algebraic geometry -- BKK root-count -- GPU computing -- Supersymmetric gauge theories; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2016.07.018
• Languages: English
• ISSNs: 0747-7171

Abstract

Abstract: Solution sets of systems of binomial equations are of great interest in applied mathematics. For both theoretic and applied purposes, the degree of a solution set (its maximum number of isolated intersections with an affine space of complementary dimension) often plays an important role in understanding its geometric structure. This paper proposes a specialized parallel algorithm for computing the degree on GPUs that takes advantage of the massively parallel nature of GPU devices. The preliminary implementation shows remarkable efficiency and scalability when compared to the closest CPU-based counterpart. As a case study, the algorithm is applied to the master space problem of N = 1 gauge theories. The GPU-based implementation achieves nearly 30 fold speedup over its CPU-only counterpart enabling the discovery of previously unknown results.