On the minimum value of the condition number of polynomials
From MaRDI portal
Publication:5042883
Recommendations
- A sequence of polynomials with optimal condition number
- Complexity of Bezout's theorem. III: Condition number and packing
- A condition number theorem for underdetermined polynomial systems
- A general condition number for polynomials
- Are the coefficients of a polynomial well-conditioned functions of its roots?
Cited in
(11)- A lower bound for the logarithmic energy on \(\mathbb{S}^2\) and for the Green energy on \(\mathbb{S}^n\)
- Complexity of Bezout's theorem. III: Condition number and packing
- A sequence of polynomials with optimal condition number
- scientific article; zbMATH DE number 2109430 (Why is no real title available?)
- High Order Terms for Condition Estimation of Univariate Polynomials
- A condition number theorem for underdetermined polynomial systems
- Bounds for the condition number of polynomials systems with integer coefficients. (invited talk)
- On condition numbers of polynomial eigenvalue problems
- Are the coefficients of a polynomial well-conditioned functions of its roots?
- Condition number bounds for problems with integer coefficients
- scientific article; zbMATH DE number 4139888 (Why is no real title available?)
This page was built for publication: On the minimum value of the condition number of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5042883)