Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
From MaRDI portal
Publication:4875494
DOI10.1137/0733008zbMATH Open0843.65035OpenAlexW1965654736MaRDI QIDQ4875494FDOQ4875494
Publication date: 15 August 1996
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5ddb95ebb309d4ab69ceea9217e9b3574a8db51e
complexitycondition numberunitary groupintegral geometrysystem of polynomial equationshomotopy methodsBezout's theorempath followingprojective Newton method
General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Complexity and performance of numerical algorithms (65Y20) 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)
Cited In (82)
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
- Smale 17th Problem: Advances and Open Directions
- Systems of rational polynomial equations have polynomial size approximate zeros on the average
- Condition of Intersecting a Projective Variety with a Varying Linear Subspace
- Grid methods in computational real algebraic (and semialgebraic) geometry
- On semilocal convergence analysis for two-step Newton method under generalized Lipschitz conditions in Banach spaces
- Sampling and homology via bottlenecks
- Computing the homology of semialgebraic sets. II: General formulas
- Quantitative Analysis for Perturbed Abstract Inequality Systems in Banach Spaces
- Computing the homology of semialgebraic sets. I: Lax formulas
- Real lines on random cubic surfaces
- Central limit theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems
- On the expected number of zeros of nonlinear equations
- A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF
- The implicit function theorem revisited
- Title not available (Why is that?)
- 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 continuation method to solve polynomial systems and its complexity
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
- Multihomogeneous Newton methods
- Newton's method for overdetermined systems of equations
- Complexity of Bezout's Theorem I: Geometric Aspects
- Does optimality imply ill-posedness? some remarks about certain min-max optimization problems
- Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian
- Some lower bounds for the complexity of continuation methods
- On the geometry of Graeffe iteration
- Lower bounds for diophantine approximations
- A numerical algorithm for zero counting. III: Randomization and condition
- Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions
- Extended Newton methods for conic inequalities: approximate solutions and the extended Smale \(\alpha\)-theory
- On a problem posed by Steve Smale
- Newton's Method for Underdetermined Systems of Equations Under the γ-Condition
- Polar varieties, real equation solving, and data structures: the hypersurface case
- Geometry of polynomials and root-finding via path-lifting
- On the probability distribution of data at points in real complete intersection varieties
- A numerical algorithm for zero counting. I: Complexity and accuracy
- Convergence behavior of Gauss-Newton's method and extensions of the Smale point estimate theory
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- On the solution of systems of equations with constant rank derivatives
- High probability analysis of the condition number of sparse polynomial systems
- 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
- A comparison of eigenvalue condition numbers for matrix polynomials
- 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
- Newton's method for analytic systems of equations with constant rank derivatives
- 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
- Computational complexity of kernel-based density-ratio estimation: a condition number analysis
- Structured total least squares approach for efficient frequency estimation
- Fast linear homotopy to find approximate zeros of polynomial systems
- Perturbation theory for homogeneous polynomial eigenvalue problems
- Condition operators, condition numbers, and condition number theorem for the generalized eigenvalue problem
- Complexity of path-following methods for the eigenvalue problem
- On the geometry and topology of the solution variety for polynomial system solving
- Complexity of Bezout's theorem. V: Polynomial time
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- Kantorovich's type theorems for systems of equations with constant rank derivatives
- On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
- Local convergence analysis of inexact Gauss-Newton method for singular systems of equations under majorant and center-majorant condition
- 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
- Rigid continuation paths II. structured polynomial systems
- Foreword. What is numerical algebraic geometry?
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- On a condition number of general random polynomial systems
- Condition number based complexity estimate for solving polynomial systems
- Computing the homology of real projective sets
- 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
- The unavoidable condition\dots A report on the book. Book review of: P. Bürgisser and F. Cucker, Condition. The geometry of numerical algorithms
- On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
- Stochastic perturbations and smooth condition numbers
- Numerical computation of the genus of an irreducible curve within an algebraic set
- Real computations with fake numbers
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)
