Publications

  1. Diego Armentano, Jean-Claude Yakoubsohn. High Order Numerical Methods To Approximate The Singular Value Decomposition. 2023. High-order-method-for-svd-09-23.pdf
    Code Maple : high-order-methods-for-svd-aided-proofs-with-Maple-09-23.mw
  2. Rima Khouja, Bernard Mourrain, Jean-Claude Yakoubsohn.. Newton‑type methods for simultaneous matrix diagonalization. 2022. newton-type-methods-for-simultaneous-matrix-diagonalization.pdf
  3. Marc Giusti, Jean-Claude Yakoubsohn. Approximation numériques de racines isolées multiples de systèmes analytiques. 2018. Giusti-Yakoubsohn-2018-09-08.pdf
    Code Maple : Méthode-de-déflation-Exemple-numérique.mw
  4. Marc Giusti, Jean-Claude Yakoubsohn. Numerical Approximation of Multiple Isolated roots of Analytic Systems. 2017. Giusti-Yakoubsohn-19-07-2017.pdf
  5. Marc Giusti, Jean-Claude Yakoubsohn. Multiplicity hunting and approximating multiple roots of polynomial systems Recent advances in real complexity and computation, 105–128, Contemporary Mathematics 604, AMS, 2013. conm604
  6. Jean-Claude Yakoubsohn. Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions Journal of Complexity 21 (2005) 652 – 690.
  7. Jean-Claude Yakoubsohn, José Miguel Gutiérrez, Ángel Alberto Magreñán. Complexity of an homotopy method at the neighbourhood of a zero Advances in iterative methods for nonlinear equations, 147–171, SEMA SIMAI Springer Ser., 10, Springer, 2016.
  8. Guillaume Chèze, André Galligo, Bernard Mourrain, Jean-Claude Yakoubsohn. A subdivision method for computing nearest gcd with certification. Theoretical Computer Science. 412 (2011), no. 35, 4493–4503.
  9. Jean-Claude Yakoubsohn, Mohamed Masmoudi, Guillaume Chèze, Didier Auroux. Approximate GCD a la Dedieu. Applied Mathematics E-notes 11 (2011), 244–248.
  10. Marc Giusti, GrégoireLecerf, Bruno Salvy, Jean-Claude Yakoubsohn. On location and approximation of clusters of zeros: case of embedding dimension one. Foundation of Computational Mathematics, 7 (2007), no. 1, 1–49.
  11. Jean-Claude Yakoubsohn. Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions. Journal of Complexity 21 (2005), no. 5, 652–690.
  12. Marc Giusti, GrégoireLecerf, Bruno Salvy, Jean-Claude Yakoubsohn. On location and approximation of clusters of zeros of analytic functions. Foundation of Computational Mathematics, 5 (2005), no. 3, 257–311.
  13. Jean-Claude Yakoubsohn. Simultaneous computation of all the zero-clusters of a univariate polynomial
     in Foundations of computational mathematics (Hong Kong, 2000), 433–455, World Sci. Publ., River Edge, NJ, 2002.
  14. Bernard Mourrain, Michael N. Vrahatis, Jean-Claude Yakoubsohn. On the complexity of isolating real roots and computing with certainty the topological degree. Journal of Complexity 18 (2002), no. 2, 612–640.
  15. Jean-Claude Yakoubsohn. Finding a cluster of zeros of univariate polynomials. Journal of Complexity 16 (2000), no. 3, 603–638.
  16. Nathalie Revol Jean-Claude Yakoubsohn. Accelerated shift-and-add algorithms. Reliable Computing 6 (2000), no. 2, 193–205.
  17. Jean-Claude Yakoubsohn. Contraction, robustness, and numerical path-following using secant maps Journal of Complexity 16 (2000), no. 1, 286–310.
  18. Jean-Claude Yakoubsohn. Finding zeros of analytic functions: α theory for secant type methods. Journal of Complexity 15 (1999), no. 2, 239–281.
  19. Jean-Pierre Dedieu, Xavier Gourdon, Jean-Claude Yakoubsohn. Computing the distance from a point to an algebraic hypersurface in The mathematics of numerical analysis (Park City, UT, 1995), 285–293, Lectures in Appl. Math., 32, Amer. Math. Soc., Providence, RI, 1996.
  20. Jean-Claude Yakoubsohn. A universal constant for the convergence of Newton’s method and an application to the classical homotopy method. Numerical Algorithms 9 (1995), no. 3-4, 223–244.
  21. Jean-Claude Yakoubsohn. Une constante universelle pour la convergence de la méthode de Newton. Comptes Rendus de l’Académie des Sciences Paris Sér. I Math. 320 (1995), no. 3, 385–390.
  22. Jean-Claude Yakoubsohn. Approximating the zeros of analytic functions by the exclusion algorithm. Numerical Algorithms 6 (1994), no. 1-2, 63–88.
  23. Jean-Pierre Dedieu, Jean-Claude Yakoubsohn. Computing the real roots of a polynomial by the exclusion algorithm. Numerical Algorithms 4 (1993), no. 1-2, 1–24.
  24. Jean-Claude Yakoubsohn. The Sturm method in the complex case. Journal of Pure and Applied Algebra 84 (1993), no. 1, 95–105.
  25. Jean-Pierre Dedieu, Jean-Claude Yakoubsohn. Localization of an algebraic hypersurface by the exclusion algorithm. Applicable Algebra in Engineering, Communication and Computing, 2 (1992), no. 4, 239–256.
  26. Anne Bellido, Jean-Pierre Dedieu, Jean-Claude Yakoubsohn. Combien existe-t-il d’octaèdres dont les longueurs des arêtes sont données? Annali dell’Università di Ferrara. Sezione 7: Scienze matematiche, 37 (1991), 65–83.
  27. Jean-Pierre Dedieu, Jean-Claude Yakoubsohn. Localisation d’une variété algébrique réelle par l’algorithme d’exclusion. Comptes Rendus de l’Académie des Sciences Paris Sér. I Math. 312 (1991), no. 13, 1013–1016.
  28. Jean-Claude Yakoubsohn. On Newton’s rule and Sylvester’s theorems. Journal of Pure and Applied Algebra 65 (1990), no. 3, 293–309.
  29. Jean-Claude Yakoubsohn. Sur un procédé de construction d’algorithmes de calcul approché des racines d’une équation du type f(x)=0. Comptes Rendus de l’Académie des Sciences Paris Sér. I Math. 308 (1989), no. 13, 433–436.
Mentions Légales