The following pages link to Jean-Claude Yakoubsohn (Q454819):
Displaying 30 items.
- Obituary: Jean-Pierre Dedieu, 1949-2012 (Q454820) (← links)
- The unavoidable condition\dots A report on the book. Book review of: P. Bürgisser and F. Cucker, Condition. The geometry of numerical algorithms (Q494615) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- (Q700183) (redirect page) (← links)
- On the complexity of isolating real roots and computing with certainty the topological degree (Q700184) (← links)
- (Q870480) (redirect page) (← links)
- On location and approximation of clusters of zeros: Case of embedding dimension one (Q870481) (← links)
- On Newton's rule and Sylvester's theorems (Q923140) (← links)
- Localization of an algebraic hypersurface by the exclusion algorithm (Q1191633) (← links)
- Computing the real roots of a polynomial by the exclusion algorithm (Q1208054) (← links)
- The Sturm method in the complex case (Q1208221) (← links)
- Approximating the zeros of analytic functions by the exclusion algorithm (Q1316070) (← links)
- Accelerated shift-and-add algorithms (Q1577440) (← links)
- Finding a cluster of zeros of univariate polynomials (Q1594831) (← links)
- A universal constant for the convergence of Newton's method and an application to the classical homotopy method (Q1895870) (← links)
- Finding zeros of analytic functions: \(\alpha\)-theory for secant type methods (Q1974566) (← links)
- Contraction, robustness, and numerical path-following using secant maps. (Q1977149) (← links)
- Newton-type methods for simultaneous matrix diagonalization (Q2089086) (← links)
- Numerical approximation of multiple isolated roots of analytical systems (Q2211505) (← links)
- On location and approximation of clusters of zeros of analytic functions (Q2505645) (← links)
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions (Q2576275) (← links)
- Complexity of an Homotopy Method at the Neighbourhood of a Zero (Q2832953) (← links)
- Computing nearest Gcd with certification (Q2959015) (← links)
- (Q3809130) (← links)
- (Q3986701) (← links)
- (Q4693237) (← links)
- (Q4717939) (← links)
- (Q4789207) (← links)
- (Q4852341) (← links)
- Multiplicity hunting and approximating multiple roots of polynomial systems (Q5501605) (← links)
