Complexity of Bezout's Theorem I: Geometric Aspects
From MaRDI portal
Bezout's theoremcomplexityconvergencehomotopy methodsill-posed problemsNewton's methodsystems of polynomial equations
Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)
Recommendations
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- A homotopy for solving polynomial systems
- Complexity of Bezout's theorem. VII: Distance estimates in the condition metric
- Numerically determining solutions of systems of polynomial equations
- scientific article; zbMATH DE number 421657
Cited in
(only showing first 100 items - show all)- Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
- Complexity of Bezout's theorem. VII: Distance estimates in the condition metric
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- Some lower bounds for the complexity of continuation methods
- Mysteries of mathematics and computation
- On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
- Complexity of Bezout's theorem. V: Polynomial time
- Homotopies for solving polynomial systems within a bounded domain
- Lower bounds for diophantine approximations
- Polar varieties, real equation solving, and data structures: the hypersurface case
- Polynomial root finding by means of continuation
- A fast Chebyshev's method for quadratic equations.
- Local convergence of some iterative methods for generalized equations.
- Counting problems over the reals
- Real computations with fake numbers
- Newton's method for analytic systems of equations with constant rank derivatives
- Kantorovich's theorem on Newton's method in Riemannian manifolds
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions
- Grid methods in computational real algebraic (and semialgebraic) geometry
- Perturbation theory for homogeneous polynomial eigenvalue problems
- Systems of rational polynomial equations have polynomial size approximate zeros on the average
- A universal constant for the convergence of Newton's method and an application to the classical homotopy method
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- Linear programming, complexity theory and elementary functional analysis
- On the geometry and topology of the solution variety for polynomial system solving
- Robust certified numerical homotopy tracking
- General equilibrium models and homotopy methods
- Finding zeros of analytic functions: -theory for secant type methods
- Complexity analysis for certain convex programming problems
- Deformation techniques for efficient polynomial equation solving.
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- Exact solutions in log-concave maximum likelihood estimation
- Central limit theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems
- Solving determinantal systems using homotopy techniques
- A note on the finite variance of the averaging function for polynomial system solving
- On the geometry of the set of symmetric matrices with repeated eigenvalues
- Computing the homology of semialgebraic sets. I: Lax formulas
- The real polynomial eigenvalue problem is well conditioned on the average
- Random fields and the enumerative geometry of lines on real and complex hypersurfaces
- Adaptive strategies for solving parameterized systems using homotopy continuation
- A facility location formulation for stable polynomials and elliptic Fekete points
- A randomized homotopy for the Hermitian eigenpair problem
- Distributing many points on spheres: minimal energy and designs
- Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds
- On the condition of the zeros of characteristic polynomials
- On the expected number of zeros of nonlinear equations
- An arithmetic Poisson formula for the multi-variate resultant
- On the probability distribution of singular varieties of given corank
- Local convergence of Newton-like methods for generalized equations
- An adaptive version of a fourth-order iterative method for quadratic equations
- Extending the applicability of Newton's method on Lie groups
- The constrained Newton method on a Lie group and the symmetric eigenvalue problem
- Low-degree approximation of random polynomials
- On a condition number of general random polynomial systems
- Minimizing the discrete logarithmic energy on the sphere: the role of random polynomials
- Galois groups of Schubert problems via homotopy computation
- On the solvability complexity index, the n-pseudospectrum and approximations of spectra of operators
- Smale's 17th problem: average polynomial time to compute affine and projective solutions
- A condition number analysis of an algorithm for solving a system of polynomial equations with one degree of freedom
- Nonlinear equations. Paper from the 28th Brazilian mathematics colloquium -- 28\(^{\text o}\) Colóquio Brasileiro de Matemática, Rio de Janeiro, Brazil, July 2011
- The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs
- scientific article; zbMATH DE number 421657 (Why is no real title available?)
- On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant
- A primal-dual formulation for certifiable computations in Schubert calculus
- Smale 17th Problem: Advances and Open Directions
- 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
- The probability that a slightly perturbed numerical analysis problem is difficult
- Mixed discriminants
- Finding All Solutions to a System of Polynomial Equations
- scientific article; zbMATH DE number 1382447 (Why is no real title available?)
- Smale's fundamental theorem of algebra reconsidered
- Complexity of path-following methods for the eigenvalue problem
- Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian
- scientific article; zbMATH DE number 503395 (Why is no real title available?)
- A universality property of Gaussian analytic functions
- scientific article; zbMATH DE number 710644 (Why is no real title available?)
- The implicit function theorem revisited
- scientific article; zbMATH DE number 741502 (Why is no real title available?)
- scientific article; zbMATH DE number 1982611 (Why is no real title available?)
- On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
- A condition number theorem for underdetermined polynomial systems
- A complex analogue of Toda's theorem
- Geometry of polynomials and root-finding via path-lifting
- Computations in the neighbourhood of algebraic singularities
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Newton's method and the computational complexity of the fundamental theorem of algebra
- A few problems on monodromy and discriminants
- The unavoidable condition\dots A report on the book. Book review of: P. Bürgisser and F. Cucker, Condition. The geometry of numerical algorithms
- Multihomogeneous Newton methods
- A sharp Bombieri inequality, logarithmic energy and well conditioned polynomials
- Smoothed analysis for the condition number of structured real polynomial systems
- A reverse Thomson problem on the unit circle
- Functional norms, condition numbers and numerical algorithms in algebraic geometry
- Condition length and complexity for the solution of polynomial systems
- Foreword. What is numerical algebraic geometry?
- Certifying solutions to square systems of polynomial-exponential equations
This page was built for publication: Complexity of Bezout's Theorem I: Geometric Aspects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4039362)
