Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic

被引：8

作者：

Hart, William ^{[1
]}

Novocin, Andrew ^{[2
]}

机构：

[1] Univ Warwick, Inst Math, Coventry CV4 7AL, W Midlands, England

[2] LIP, INRIA, ENS, F-69364 Lyon 07, France

来源：

COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING | 2011年 / 6885卷

基金：

英国工程与自然科学研究理事会;

关键词：

D O I：

10.1007/978-3-642-23568-9_16

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for composition of power series, showing that it can be applied practically to composition of polynomials in Z[x] given in the standard monomial basis. We offer a complexity analysis, showing that it is asymptotically fast, avoiding coefficient explosion in Z[x]. Secondly we provide an improvement to Mulders' polynomial division algorithm. We show that it is particularly efficient compared with the multimodular algorithm. The algorithms are straightforward to implement and available in the open source FLINT C library. We offer a practical comparison of our implementations with various computer algebra systems.

引用

页码：200 / +

页数：3

共 50 条

[31] Modeling and simulation of parallel adaptive divide-and-conquer algorithms
Fernando J. Barros
The Journal of Supercomputing, 2008, 43 : 241 - 255
[32] Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
Kazumasa Okumoto
Takuro Fukunaga
Hiroshi Nagamochi
Algorithmica, 2012, 62 : 787 - 806
[33] Divide-and-Conquer Fusion
Chan, Ryan S. Y.
Pollock, Murray
Johansen, Adam M.
Roberts, Gareth O.
JOURNAL OF MACHINE LEARNING RESEARCH, 2023, 24
[34] HEADINGS, OR DIVIDE-AND-CONQUER
DOLLE, R
JOURNAL OF ENVIRONMENTAL HEALTH, 1990, 53 (03) : 56 - 56
[35] MULTIDIMENSIONAL DIVIDE-AND-CONQUER
BENTLEY, JL
COMMUNICATIONS OF THE ACM, 1980, 23 (04) : 214 - 229
[36] Divide and Verify: Using a Divide-and-Conquer Strategy for Polynomial Formal Verification of Complex Circuits
Drechsler, Rolf
Mahzoon, Alireza
2023 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION, DATE, 2023,
[37] Provably Good Multicore Cache Performance for Divide-and-Conquer Algorithms
Blelloch, Guy E.
Chowdhury, Rezaul A.
Gibbons, Phillip B.
Ramachandran, Vijaya
Chen, Shimin
Kozuch, Michael
PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 501 - +
[38] Automated transformation of sequential divide-and-conquer algorithms into parallel programs
Freisleben, B
Kielmann, T
COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1995, 14 (06): : 579 - 596
[39] RANDOMIZED DIVIDE-AND-CONQUER: IMPROVED PATH, MATCHING, AND PACKING ALGORITHMS
Chen, Jianer
Kneis, Joachim
Lu, Songjian
Moelle, Daniel
Richter, Stefan
Rossmanith, Peter
Sze, Sing-Hoi
Zhang, Fenghui
SIAM JOURNAL ON COMPUTING, 2009, 38 (06) : 2526 - 2547
[40] Tree-Based Hardware Recursion for Divide-and-Conquer Algorithms
Morrison, Braeden
Lukowiak, Marcin
PROCEEDINGS OF THE 28TH INTERNATIONAL CONFERENCE MIXED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS (MIXDES 2021), 2021, : 147 - 152

← 1 2 3 4 5 →