On the minimum value of the condition number of polynomials
From MaRDI portal
Publication:5042883
DOI10.1093/IMANUM/DRAB070OpenAlexW3204526479MaRDI QIDQ5042883FDOQ5042883
Authors: Fátima Lizarte, Carlos Beltran
Publication date: 26 October 2022
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.05138
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 sequence of polynomials with optimal condition number
- Condition number bounds for problems with integer coefficients
- On condition numbers of polynomial eigenvalue problems
- Title not available (Why is that?)
- Bounds for the condition number of polynomials systems with integer coefficients. (invited talk)
- Are the coefficients of a polynomial well-conditioned functions of its roots?
- High Order Terms for Condition Estimation of Univariate Polynomials
- A lower bound for the logarithmic energy on \(\mathbb{S}^2\) and for the Green energy on \(\mathbb{S}^n\)
- Title not available (Why is that?)
- A condition number theorem for underdetermined polynomial systems
- Complexity of Bezout's theorem. III: Condition number and packing
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)