Pages that link to "Item:Q4039362"
From MaRDI portal
The following pages link to Complexity of Bezout's Theorem I: Geometric Aspects (Q4039362):
Displayed 33 items.
- Local convergence of Newton-like methods for generalized equations (Q2479220) (← links)
- An adaptive version of a fourth-order iterative method for quadratic equations (Q2488890) (← links)
- Extending the applicability of Newton's method on Lie groups (Q2511708) (← links)
- The constrained Newton method on a Lie group and the symmetric eigenvalue problem (Q2564923) (← links)
- Low-degree approximation of random polynomials (Q2696569) (← links)
- On a condition number of general random polynomial systems (Q2792338) (← links)
- Minimizing the discrete logarithmic energy on the sphere: The role of random polynomials (Q3004359) (← links)
- Galois groups of Schubert problems via homotopy computation (Q3055169) (← links)
- On the Solvability Complexity Index, the 𝑛-pseudospectrum and approximations of spectra of operators (Q3074553) (← links)
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions (Q3079201) (← links)
- The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs (Q3119536) (← links)
- Smale 17th Problem: Advances and Open Directions (Q3380357) (← links)
- 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 (Q3433761) (← links)
- The probability that a slightly perturbed numerical analysis problem is difficult (Q3577011) (← links)
- On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables (Q4517525) (← links)
- A condition number theorem for underdetermined polynomial systems (Q4517526) (← links)
- Geometry of polynomials and root-finding via path-lifting (Q4606640) (← links)
- Computations in the neighbourhood of algebraic singularities (Q4844730) (← links)
- Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038) (← links)
- Multihomogeneous Newton methods (Q4955862) (← links)
- A sharp Bombieri inequality, logarithmic energy and well conditioned polynomials (Q4992385) (← links)
- Smoothed analysis for the condition number of structured real polynomial systems (Q4999472) (← links)
- A reverse Thomson problem on the unit circle (Q5049333) (← links)
- Functional norms, condition numbers and numerical algorithms in algebraic geometry (Q5056386) (← links)
- (Q5104106) (← links)
- 96120 : The degree of the linear orbit of a cubic surface (Q5140679) (← links)
- A sequence of polynomials with optimal condition number (Q5147325) (← links)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)
- Condition of Intersecting a Projective Variety with a Varying Linear Subspace (Q5347295) (← links)
- Fast computation of zeros of polynomial systems with bounded degree under finite-precision (Q5401702) (← links)
- On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture (Q5938580) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
- Rigid continuation paths II. structured polynomial systems (Q6103341) (← links)