Fast arithmetic for triangular sets: from theory to practice

DOI10.1016/j.jsc.2008.04.019zbMath1183.68755MaRDI QIDQ1025397

Éric Schost, Marc Moreno Maza, Xin Li

Publication date: 18 June 2009

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2008.04.019

zbMATH Keywords

high-performance computing; fast polynomial arithmetic; triangular set

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)

Uses Software

• AXIOM
• Magma
• Maple
• RegularChains
• SPIRAL
• CUMODP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexities of multipoint evaluation and interpolation
• Relations between exact and approximate bilinear algorithms. Applications
• A new method for solving algebraic systems of positive dimension
• On fast multiplication of polynomials over arbitrary algebras
• Fast multiplication of polynomials over fields of characteristic 2
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Simple multivariate polynomial multiplication
• The Magma algebra system. I: The user language
• On the theories of triangular sets
• A new polynomial factorization algorithm and its implementation
• On computing reciprocals of power series
• Fast multiplication of large numbers
• An algorithm for division of powerseries
• Modular Multiplication Without Trial Division
• Approximate Solutions for the Bilinear Form Computational Problem
• The truncated fourier transform and applications
• Lifting techniques for triangular decompositions
• Architecture-aware classical Taylor shift by 1
• Multivariate power series multiplication
• Efficient Implementation of Polynomial Arithmetic in a Multiple-Level Programming Environment