Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
From MaRDI portal
(Redirected from Publication:4875494)
Bezout's theoremcomplexitycondition numberhomotopy methodsintegral geometrypath followingprojective Newton methodsystem of polynomial equationsunitary group
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Complexity and performance of numerical algorithms (65Y20)
Recommendations
Cited in
(89)- Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
- Complexity of Bezout's theorem. VII: Distance estimates in the condition metric
- Some lower bounds for the complexity of continuation methods
- On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
- Complexity of Bezout's theorem. V: Polynomial time
- Lower bounds for diophantine approximations
- Polar varieties, real equation solving, and data structures: the hypersurface case
- Condition operators, condition numbers, and condition number theorem for the generalized eigenvalue problem
- Real computations with fake numbers
- Newton's method for analytic systems of equations with constant rank derivatives
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
- A comparison of eigenvalue condition numbers for matrix polynomials
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
- 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
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- On the geometry and topology of the solution variety for polynomial system solving
- Computational complexity of kernel-based density-ratio estimation: a condition number analysis
- Deformation techniques for efficient polynomial equation solving.
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- Computing the homology of semialgebraic sets. II: General formulas
- Real lines on random cubic surfaces
- On semilocal convergence analysis for two-step Newton method under generalized Lipschitz conditions in Banach spaces
- Central limit theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- Computing the homology of semialgebraic sets. I: Lax formulas
- Whitney's theorem, triangular sets, and probabilistic descent on manifolds
- Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds
- 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
- On a condition number of general random polynomial systems
- Extended Newton methods for conic inequalities: approximate solutions and the extended Smale -theory
- Smale's 17th problem: average polynomial time to compute affine and projective solutions
- 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
- 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
- The probability that a slightly perturbed numerical analysis problem is difficult
- Complexity of Bezout's Theorem I: Geometric Aspects
- 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?)
- The implicit function theorem revisited
- Does optimality imply ill-posedness? some remarks about certain min-max optimization problems
- On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
- Geometry of polynomials and root-finding via path-lifting
- Quantitative analysis for perturbed abstract inequality systems in Banach spaces
- 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
- Newton's method for overdetermined systems of equations
- Local convergence analysis of inexact Gauss-Newton method for singular systems of equations under majorant and center-majorant condition
- Foreword. What is numerical algebraic geometry?
- Sampling and homology via bottlenecks
- A theory of complexity, condition, and roundoff
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
- Newton's Method for Underdetermined Systems of Equations Under the γ-Condition
- Numerical computation of the genus of an irreducible curve within an algebraic set
- Condition of intersecting a projective variety with a varying linear subspace
- Fast computation of zeros of polynomial systems with bounded degree under finite-precision
- On the solution of systems of equations with constant rank derivatives
- Structured total least squares approach for efficient frequency estimation
- Kronecker's and Newton's approaches to solving: a first comparison
- On the geometry of Graeffe iteration
- High probability analysis of the condition number of sparse polynomial systems
- Deformation techniques to solve generalised Pham systems
- Rigid continuation paths II. structured polynomial systems
- A continuation method to solve polynomial systems and its complexity
- Fast linear homotopy to find approximate zeros of polynomial systems
- Condition number based complexity estimate for solving polynomial systems
- Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions
- A numerical algorithm for zero counting. III: Randomization and condition
- Globally convergent, iterative path-following for algebraic equations
- On a problem posed by Steve Smale
- Computing the homology of real projective sets
- On the computation of the homology of semialgebraic sets
- The work of Steve Smale
- Numerical instability of algebraic rootfinders
- Branch points of homotopies: distribution and probability of failure
- Optimal transport between algebraic hypersurfaces
- Smoothed analysis of complex conic condition numbers
- Kantorovich's type theorems for systems of equations with constant rank derivatives
- On the probability distribution of data at points in real complete intersection varieties
- A numerical algorithm for zero counting. I: Complexity and accuracy
- Stochastic perturbations and smooth condition numbers
- Convergence behavior of Gauss-Newton's method and extensions of the Smale point estimate theory
This page was built for publication: Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875494)
