Practical divide-and-conquer algorithms for polynomial arithmetic

DOI10.1007/978-3-642-23568-9_16MaRDI QIDQ3090902zbMATH OpenOpenAlexFDO

Authors

Publication date 2 September 2011

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23568-9_16

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 3856407
• Fast polynomial factorization and modular composition
• Composition modulo powers of polynomials
• On short multiplications and divisions
• In-place arithmetic for univariate polynomials over an algebraic number field

Cited in

(9)

• Univariate real root isolation in an extension field and applications
• scientific article; zbMATH DE number 4114766 (Why is no real title available?)
• scientific article; zbMATH DE number 3856407 (Why is no real title available?)
• scientific article; zbMATH DE number 1254004 (Why is no real title available?)
• In-place arithmetic for univariate polynomials over an algebraic number field
• Composition modulo powers of polynomials
• Modular composition via factorization
• Nearly optimal refinement of real roots of a univariate polynomial
• Separating linear forms and rational univariate representations of bivariate systems

Describes a project that uses

Uses Software

• FLINT
• Magma
• NTL

This page was built for publication: Practical divide-and-conquer algorithms for polynomial arithmetic

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