On a condition number of general random polynomial systems
From MaRDI portal
Publication:2792338
DOI10.1090/mcom/2993zbMath1331.12003arXiv1403.4293MaRDI QIDQ2792338
Publication date: 9 March 2016
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.4293
65H10: Numerical computation of solutions to systems of equations
12D10: Polynomials in real and complex fields: location of zeros (algebraic theorems)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A numerical algorithm for zero counting. III: Randomization and condition
- A numerical algorithm for zero counting. I: Complexity and accuracy
- Random matrices: The distribution of the smallest singular values
- Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds
- Complexity of Bezout's theorem. V: Polynomial time
- Smoothed analysis of \(\kappa(A)\)
- Complexity of Bezout's theorem. III: Condition number and packing
- Invertibility of random matrices: norm of the inverse
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis
- The Littlewood-Offord problem and invertibility of random matrices
- On the number of real roots of random polynomials
- Condition
- Smooth analysis of the condition number and the least singular value
- Smoothed analysis of algorithms
- Smallest singular value of a random rectangular matrix
- Eigenvalues and Condition Numbers of Random Matrices
- Complexity of Bezout's Theorem I: Geometric Aspects
- On the Probability That a Random ± 1-Matrix Is Singular
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Small Ball Probability, Inverse Theorems, and Applications
- Numerical inverting of matrices of high order
