Complexity of Bezout's Theorem I: Geometric Aspects
From MaRDI portal
Publication:4039362
DOI10.2307/2152805zbMATH Open0821.65035OpenAlexW4231932295WikidataQ56697971 ScholiaQ56697971MaRDI QIDQ4039362FDOQ4039362
Publication date: 27 September 1995
Published in: Journal of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2152805
convergencecomplexityill-posed problemsNewton's methodhomotopy methodsBezout's theoremsystems of polynomial equations
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) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Real polynomials: location of zeros (26C10)
Cited In (only showing first 100 items - show all)
- A subdivision method for computing nearest gcd with certification
- Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds
- Smale's fundamental theorem of algebra reconsidered
- Fast computation of zeros of polynomial systems with bounded degree under finite-precision
- A universality property of Gaussian analytic functions
- A continuation method to solve polynomial systems and its complexity
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
- Minimizing the discrete logarithmic energy on the sphere: The role of random polynomials
- Kantorovich's theorem on Newton's method in Riemannian manifolds
- An adaptive version of a fourth-order iterative method for quadratic equations
- Galois groups of Schubert problems via homotopy computation
- On the Solvability Complexity Index, the đ-pseudospectrum and approximations of spectra of operators
- Multihomogeneous Newton methods
- Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian
- Lower bounds for diophantine approximations
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
- Mixed discriminants
- A numerical algorithm for zero counting. III: Randomization and condition
- High order iterative schemes for quadratic equations
- On a problem posed by Steve Smale
- Local convergence of Newton-like methods for generalized equations
- Polar varieties, real equation solving, and data structures: the hypersurface case
- Finding zeros of analytic functions: \(\alpha\)-theory for secant type methods
- On the probability distribution of data at points in real complete intersection varieties
- A numerical algorithm for zero counting. I: Complexity and accuracy
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- High probability analysis of the condition number of sparse polynomial systems
- A property of the nearly optimal root-bound
- Convergence criterion of Newton's method for singular systems with constant rank derivatives
- A complex analogue of Toda's theorem
- Smoothed analysis of complex conic condition numbers
- The probability that a slightly perturbed numerical analysis problem is difficult
- Kronecker's and Newton's approaches to solving: a first comparison
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant
- Deformation techniques for efficient polynomial equation solving.
- Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
- Complexity of Bezout's theorem. VII: Distance estimates in the condition metric
- A note on the finite variance of the averaging function for polynomial system solving
- Newton's method for analytic systems of equations with constant rank derivatives
- Fast linear homotopy to find approximate zeros of polynomial systems
- A condition number theorem for underdetermined polynomial systems
- Perturbation theory for homogeneous polynomial eigenvalue problems
- A primal-dual formulation for certifiable computations in Schubert calculus
- Complexity of path-following methods for the eigenvalue problem
- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions
- Counting problems over the reals
- On the geometry and topology of the solution variety for polynomial system solving
- The constrained Newton method on a Lie group and the symmetric eigenvalue problem
- Complexity of Bezout's theorem. V: Polynomial time
- Perturbation results on the zero-locus of a polynomial
- Linear programming, complexity theory and elementary functional analysis
- A few problems on monodromy and discriminants
- Globally convergent, iterative path-following for algebraic equations
- Deformation techniques to solve generalised Pham systems
- Smaleâs 17th problem: Average polynomial time to compute affine and projective solutions
- Extending the applicability of Newton's method on Lie groups
- Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
- Condition length and complexity for the solution of polynomial systems
- Certifying solutions to square systems of polynomial-exponential equations
- Foreword. What is numerical algebraic geometry?
- On a condition number of general random polynomial systems
- Adaptive strategies for solving parameterized systems using homotopy continuation
- Robust certified numerical homotopy tracking
- Local convergence of some iterative methods for generalized equations.
- An arithmetic Poisson formula for the multi-variate resultant
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- On the probability distribution of singular varieties of given corank
- Certification for polynomial systems via square subsystems
- The unavoidable condition\dots A report on the book. Book review of: P. BĂźrgisser and F. Cucker, Condition. The geometry of numerical algorithms
- Certified predictor-corrector tracking for Newton homotopies
- Distributing many points on spheres: minimal energy and designs
- Numerical computation of the genus of an irreducible curve within an algebraic set
- Real computations with fake numbers
- A sequence of polynomials with optimal condition number
- Solving determinantal systems using homotopy techniques
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
- Smale 17th Problem: Advances and Open Directions
- Exact solutions in log-concave maximum likelihood estimation
- Systems of rational polynomial equations have polynomial size approximate zeros on the average
- The forbidden region for random zeros: Appearance of quadrature domains
- Title not available (Why is that?)
- Smoothed analysis for the condition number of structured real polynomial systems
- Condition of Intersecting a Projective Variety with a Varying Linear Subspace
- Some lower bounds for the complexity of continuation methods
- Complexity analysis for certain convex programming problems
- Which constraints of a numerical problem cause ill-conditioning?
- Mysteries of mathematics and computation
- A sharp Bombieri inequality, logarithmic energy and well conditioned polynomials
- Grid methods in computational real algebraic (and semialgebraic) geometry
- A universal constant for the convergence of Newton's method and an application to the classical homotopy method
- Expectation of a random submanifold: the zonoid section
- On the geometry of the set of symmetric matrices with repeated eigenvalues
- Geometry of polynomials and root-finding via path-lifting
- The real polynomial eigenvalue problem is well conditioned on the average
- A fast Chebyshev's method for quadratic equations.
- 96120 : The degree of the linear orbit of a cubic surface
- General equilibrium models and homotopy methods
- 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
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)
