Efficient sparse polynomial factoring using the Funnel heap

12/16/2016
by   Fatima K. Abu Salem, et al.
0

This work is a comprehensive extension of Abu-Salem et al. (2015) that investigates the prowess of the Funnel Heap for implementing sums of products in the polytope method for factoring polynomials, when the polynomials are in sparse distributed representation. We exploit that the work and cache complexity of an Insert operation using Funnel Heap can be refined to de- pend on the rank of the inserted monomial product, where rank corresponds to its lifetime in Funnel Heap. By optimising on the pattern by which insertions and extractions occur during the Hensel lifting phase of the polytope method, we are able to obtain an adaptive Funnel Heap that minimises all of the work, cache, and space complexity of this phase. Additionally, we conduct a detailed empirical study confirming the superiority of Funnel Heap over the generic Binary Heap once swaps to external memory begin to take place. We demonstrate that Funnel Heap is a more efficient merger than the cache oblivious k-merger, which fails to achieve its optimal (and amortised) cache complexity when used for performing sums of products. This provides an empirical proof of concept that the overlapping approach for perform- ing sums of products using one global Funnel Heap is more suited than the serialised approach, even when the latter uses the best merging structures available.

READ FULL TEXT
research
05/17/2023

Cache-Oblivious Parallel Convex Hull in the Binary Forking Model

We present two cache-oblivious sorting-based convex hull algorithms in t...
research
07/02/2019

Cache-Friendly Search Trees; or, In Which Everything Beats std::set

While a lot of work in theoretical computer science has gone into optimi...
research
11/20/2017

Quantum Query Algorithms are Completely Bounded Forms

We prove a characterization of t-query quantum algorithms in terms of th...
research
03/21/2023

Blow-up Algorithm for Sum-of-Products Polynomials and Real Log Canonical Thresholds

When considering a real log canonical threshold (RLCT) that gives a Baye...
research
11/03/2020

Balanced Partitioning of Several Cache-Oblivious Algorithms

Frigo et al. proposed an ideal cache model and a recursive technique to ...
research
02/01/2018

PCOT: Cache Oblivious Tiling of Polyhedral Programs

This paper studies two variants of tiling: iteration space tiling (or lo...
research
09/05/2023

Algebraic Temporal Blocking for Sparse Iterative Solvers on Multi-Core CPUs

Sparse linear iterative solvers are essential for many large-scale simul...

Please sign up or login with your details

Forgot password? Click here to reset