Bounds for the condition number of polynomials systems with integer coefficients. (invited talk)

DOI10.1007/978-3-319-24021-3_16MaRDI QIDQ3454544zbMATH OpenOpenAlexWikidataFDO

Authors Aaron Herman, Elias P. Tsigaridas

Publication date 25 November 2015

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

Full work available at URL https://doi.org/10.1007/978-3-319-24021-3_16

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Solving polynomial systems; resultants (13P15) Geometric aspects of numerical algebraic geometry (14Q65) Numerical algebraic geometry (65H14)

Recommendations

• Condition number bounds for problems with integer coefficients
• Complexity of Bezout's theorem. III: Condition number and packing
• A condition number analysis of an algorithm for solving a system of polynomial equations with one degree of freedom
• On the minimum value of the condition number of polynomials
• The distribution of condition numbers of rational data of bounded bit length

Cited in

(3)

• Condition number bounds for problems with integer coefficients
• A condition number theorem for underdetermined polynomial systems
• A 2-norm condition number for Bézier curve intersection

This page was built for publication: Bounds for the condition number of polynomials systems with integer coefficients. (invited talk)

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