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 条
  • [41] 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
  • [42] A NOTE ON DIVIDE-AND-CONQUER ALGORITHMS FOR THE SYMMETRICAL TRIDIAGONAL EIGENVALUE PROBLEM
    ARBENZ, P
    GATES, K
    ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1994, 74 (06): : T529 - T531
  • [43] DIVIDE-AND-CONQUER IN PLANAR GEOMETRY
    GUTING, RH
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1986, 18 (3-4) : 247 - 263
  • [44] ON THE BALANCED DIVIDE-AND-CONQUER EQUATION
    BATAGELJ, V
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1986, 19 (3-4) : 259 - 266
  • [45] PIPELINES FOR DIVIDE-AND-CONQUER FUNCTIONS
    DEGUZMAN, IP
    HARRISON, PG
    MEDINA, E
    COMPUTER JOURNAL, 1993, 36 (03): : 254 - 268
  • [46] DIVIDE-AND-CONQUER YOUR DATABASE
    LIVINGSTON, D
    SYSTEMS INTEGRATION BUSINESS, 1991, 24 (05): : 43 - 45
  • [47] DIVIDE-AND-CONQUER FOR PARALLEL PROCESSING
    HOROWITZ, E
    ZORAT, A
    IEEE TRANSACTIONS ON COMPUTERS, 1983, 32 (06) : 582 - 585
  • [48] A divide-and-conquer discretization algorithm
    Min, F
    Xie, LJ
    Liu, QH
    Cai, HB
    FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, PT 1, PROCEEDINGS, 2005, 3613 : 1277 - 1286
  • [49] PRUNING DIVIDE-AND-CONQUER NETWORKS
    ROMANIUK, SG
    NETWORK-COMPUTATION IN NEURAL SYSTEMS, 1993, 4 (04) : 481 - 494
  • [50] DIVIDE-AND-CONQUER NEURAL NETWORKS
    ROMANIUK, SG
    HALL, LO
    NEURAL NETWORKS, 1993, 6 (08) : 1105 - 1116
12345