Fast arithmetic for triangular sets: from theory to practice

DOI10.1016/J.JSC.2008.04.019MaRDI QIDQ1025397zbMATH OpenOpenAlexFDO

Authors Xin Li, Marc Moreno Maza, Éric Schost

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 computingtriangular setfast polynomial arithmetic

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Recommendations

• Fast arithmetic for triangular sets: from theory to practice
• Homotopy techniques for multiplication modulo triangular sets
• Algorithms for computing triangular decompositions of polynomial systems
• The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
• On the complexity of computing with zero-dimensional triangular sets

Cites work

• scientific article; zbMATH DE number 16654 (Why is no real title available?)
• scientific article; zbMATH DE number 2151224 (Why is no real title available?)
• A new method for solving algebraic systems of positive dimension
• A new polynomial factorization algorithm and its implementation
• An algorithm for division of powerseries
• Approximate Solutions for the Bilinear Form Computational Problem
• Architecture-aware classical Taylor shift by 1
• Efficient implementation of polynomial arithmetic in a multiple-level programming environment
• Fast arithmetic for triangular sets: from theory to practice
• Fast multiplication of large numbers
• Fast multiplication of polynomials over fields of characteristic 2
• Lifting techniques for triangular decompositions
• Modern computer algebra
• Modular Multiplication Without Trial Division
• Multivariate power series multiplication
• On computing reciprocals of power series
• On fast multiplication of polynomials over arbitrary algebras
• On the complexities of multipoint evaluation and interpolation
• On the theories of triangular sets
• Relations between exact and approximate bilinear algorithms. Applications
• Simple multivariate polynomial multiplication
• The Magma algebra system. I: The user language
• The RegularChains library in Maple 10
• The truncated fourier transform and applications
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication

Cited in

(14)

• Inversion modulo zero-dimensional regular chains
• Accelerated tower arithmetic
• On the complexity of the D5 principle
• Complexity results for triangular sets
• Modular composition modulo triangular sets and applications
• Fast arithmetic for triangular sets: from theory to practice
• Subquadratic-time algorithms for normal bases
• Fast vector arithmetic over \(\mathbb{F}_3\)
• Relaxed Hensel lifting of triangular sets
• The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
• Efficient arithmetic in successive algebraic extension fields using symmetries
• Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions
• On the Complexity of Linear Algebra Operations over Algebraic Extension Fields
• Homotopy techniques for multiplication modulo triangular sets

Describes a project that uses

Uses Software

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

This page was built for publication: Fast arithmetic for triangular sets: from theory to practice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025397)