scientific article

From MaRDI portal
Revision as of 21:52, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3135179

zbMath0851.65031MaRDI QIDQ3135179

Michael Shub, Stephen Smale

Publication date: 17 June 1996


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

On generalized Newton algorithms: Quadratic convergence, path-following and error analysisComplexity of Bezout's theorem. V: Polynomial timeNonnegative forms with sublevel sets of minimal volumeEquidistribution of the conormal cycle of random nodal setsA reverse Thomson problem on the unit circleThe Kostlan-Shub-Smale random polynomials in the case of growing number of variablesOn the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminantCentral limit theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systemsLower bounds for diophantine approximationsPolar varieties, real equation solving, and data structures: the hypersurface caseSmoothed analysis of complex conic condition numbersExpected number and distribution of critical points of real Lefschetz pencilsHigh probability analysis of the condition number of sparse polynomial systemsDeformation techniques to solve generalised Pham systemsOptimal and nearly optimal algorithms for approximating polynomial zerosRandom systems of polynomial equations. The expected number of roots under smooth analysisA deterministic algorithm to compute approximate roots of polynomial systems in polynomial average timeRANDOM REAL BRANCHED COVERINGS OF THE PROJECTIVE LINEReal zeros of mixed random fewnomial systemsSmale's fundamental theorem of algebra reconsideredA continuation method to solve polynomial systems and its complexityHow many zeros of a random polynomial are real?Unnamed ItemFast linear homotopy to find approximate zeros of polynomial systemsSpherical Radon transform and the average of the condition number on certain Schubert subvarieties of a GrassmannianComputing monodromy via continuation methods on random Riemann surfacesAround the circular lawOn the expected number of real roots of polynomials and exponential sumsGeometry of polynomials and root-finding via path-liftingLow-degree approximation of random polynomialsThe average condition number of most tensor rank decomposition problems is infiniteRobust certified numerical homotopy trackingOn the expected number of zeros of nonlinear equationsAn arithmetic Poisson formula for the multi-variate resultantMathematics of gravitational lensing: Multiple imaging and magnificationApproximation to uniform distribution in \(\mathrm{SO}(3)\)A numerical algorithm for zero counting. III: Randomization and conditionMean conservation of nodal volume and connectivity measures for Gaussian ensemblesComplexity of sparse polynomial solving: homotopy on toric varieties and the condition metricOn a problem posed by Steve SmaleOn the probability distribution of singular varieties of given corankDeformation techniques for efficient polynomial equation solving.Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.A sequence of polynomials with optimal condition numberComputing the homology of real projective sets$p$-Adic Integral GeometryMinimizing the discrete logarithmic energy on the sphere: The role of random polynomialsThe unavoidable condition\dots A report on the book. Book review of: P. Bürgisser and F. Cucker, Condition. The geometry of numerical algorithmsConvergence of random zeros on complex manifoldsHow Many Eigenvalues of a Random Matrix are Real?Average Euler characteristic of random real algebraic varietiesFast computation of zeros of polynomial systems with bounded degree under finite-precisionOn the probability distribution of data at points in real complete intersection varietiesCondition length and complexity for the solution of polynomial systemsForeword. What is numerical algebraic geometry?A fast and stable algorithm for splitting polynomialsPercolation of random nodal linesGrid methods in computational real algebraic (and semialgebraic) geometryThe probability that a slightly perturbed numerical analysis problem is difficultNumerical computation of the genus of an irreducible curve within an algebraic setOn the number of minima of a random polynomialCounting complex points of surfaces in \(\mathbb C^2\)Multidimensional residues and polynomial equationsKronecker's and Newton's approaches to solving: a first comparisonOn random surface areaA note about the average number of real roots of a Bernstein polynomial systemOn the geometry of Graeffe iterationOn a condition number of general random polynomial systemsDecomposition of the Kostlan–Shub–Smale model for random polynomialsOn the geometry of the set of symmetric matrices with repeated eigenvaluesAsymptotic variance of the number of real roots of random polynomial systemsMultihomogeneous Newton methodsNewton's method for overdetermined systems of equationsUnnamed ItemAsymptotic variance and CLT for the number of zeros of Kostlan Shub Smale random polynomialsComputing the homology of semialgebraic sets. I: Lax formulasOn the Number of Real Zeros of Random FewnomialsSmale’s 17th problem: Average polynomial time to compute affine and projective solutionsSmale 17th Problem: Advances and Open DirectionsProbabilistic Schubert calculusRigid continuation paths I. Quasilinear average complexity for solving polynomial systemsComplexity of Bezout's theorem. VI: Geodesics in the condition (number) metricComplexity of Bezout's theorem. VII: Distance estimates in the condition metricThe real polynomial eigenvalue problem is well conditioned on the averageReal lines on random cubic surfacesRandom fields and the enumerative geometry of lines on real and complex hypersurfacesPhase singularities in complex arithmetic random wavesCorrelation between zeros of a random polynomialVariance of the volume of random real algebraic submanifoldsRandom matrices and the average topology of the intersection of two quadricsOn the Kostlan-Shub-Smale model for random polynomial systems. Variance of the number of rootsOn the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined caseReal computations with fake numbersOn the topology of random real complete intersectionsExpected volume and Euler characteristic of random submanifoldsMysteries of mathematics and computationKac-Rice formula for transverse intersectionsSystems of rational polynomial equations have polynomial size approximate zeros on the averageOn simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variablesRigid continuation paths II. structured polynomial systems







This page was built for publication: