Algorithm for computing the truncation of the discriminant of a polynomial

DOI10.1134/S0361768823010061MaRDI QIDQ6043784zbMATH OpenFDO

Authors A. P. Lyapin, Evgeny Mikhalkin

Publication date 24 May 2023

Published in Programming and Computer Software (Search for Journal in Brave)

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Computational methods for problems pertaining to convex and discrete geometry (52-08)

Recommendations

• An algorithm for computing the roots of a complex polynomial
• A fast algorithm for computing the truncated resultant
• On Computing Discriminants
• Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain
• scientific article; zbMATH DE number 4154575
• Algorithmic polynomials
• Algorithmic Polynomials
• A numerical elimination method for polynomial computations
• Computing the real roots of a polynomial by the exclusion algorithm
• Algorithms related to the decomposition of polynomials

Cites work

• scientific article; zbMATH DE number 575960 (Why is no real title available?)
• scientific article; zbMATH DE number 2157076 (Why is no real title available?)
• Blow-ups for the Horn-Kapranov parametrization of the classical discriminant
• Detailed Factorization Identities for Classical Discriminant
• Geometry of factorization identities for discriminants
• Hispanic Heritage Month
• On facets of the Newton polytope for the discriminant of the polynomial system
• On the analytic complexity of discriminants
• Tropical discriminants

Cited in

(1)

• On sums of Newton polytopes for discriminants of polynomials

This page was built for publication: Algorithm for computing the truncation of the discriminant of a polynomial

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