A condition number theorem for underdetermined polynomial systems
From MaRDI portal
Publication:4517526
DOI10.1090/S0025-5718-00-00934-0zbMATH Open0958.65059MaRDI QIDQ4517526FDOQ4517526
Publication date: 22 November 2000
Published in: Mathematics of Computation (Search for Journal in Brave)
Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10)
Cites Work
Cited In (4)
- Which constraints of a numerical problem cause ill-conditioning?
- On the probability distribution of data at points in real complete intersection varieties
- On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case
- Perturbation results on the zero-locus of a polynomial
Recommendations
- On condition numbers of polynomial eigenvalue problems ๐ ๐
- Condition Number Analysis for Sparse Polynomial Systems ๐ ๐
- A general condition number for polynomials ๐ ๐
- Condition length and complexity for the solution of polynomial systems ๐ ๐
- Condition number based complexity estimate for solving polynomial systems ๐ ๐
- On a condition number of general random polynomial systems ๐ ๐
- On the minimum value of the condition number of polynomials ๐ ๐
- Bounds for the Condition Number of Polynomials Systems with Integer Coefficients ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
This page was built for publication: A condition number theorem for underdetermined polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517526)