{"id":42,"date":"2012-04-16T11:44:09","date_gmt":"2012-04-16T10:44:09","guid":{"rendered":"http:\/\/pageperso.math.univ-toulouse.fr\/reference\/?page_id=42"},"modified":"2023-09-05T17:55:21","modified_gmt":"2023-09-05T16:55:21","slug":"curriculum-vitae","status":"publish","type":"page","link":"https:\/\/perso.math.univ-toulouse.fr\/yak\/curriculum-vitae\/","title":{"rendered":"Publications"},"content":{"rendered":"<ol>\n<li><a href=\"http:\/\/www.cmat.edu.uy\/~diego\/\">Diego Armentano, <\/a> <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn.<\/a> High Order Numerical Methods To Approximate The Singular Value Decomposition. 2023. <em> <a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2023\/09\/High-order-method-for-svd-09-232.pdf\">High-order-method-for-svd-09-23.pdf<\/a> <\/em><br \/>\nCode Maple : <a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2023\/09\/high-order-methods-for-svd-aided-proofs-with-Maple-09-23.mw\">high-order-methods-for-svd-aided-proofs-with-Maple-09-23.mw<\/a><\/em> <\/li>\n<li><a href=\"https:\/\/rima-khouja.netlify.app\/\">Rima Khouja, <\/a> <a href=\"https:\/\/www-sop.inria.fr\/members\/Bernard.Mourrain\/\">Bernard Mourrain, <\/a> <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn.<\/a>. Newton\u2011type methods for simultaneous matrix diagonalization. 2022. <em> <a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2023\/09\/Newton-type-methods-for-simultaneous-matrix-diagonalization.pdf\">newton-type-methods-for-simultaneous-matrix-diagonalization.pdf <\/a> <\/em> <\/li>\n<li><a href=\"http:\/\/www.lix.polytechnique.fr\/~giusti\/\">Marc Giusti, <\/a> <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn.<\/a> Approximation num\u00e9riques de racines isol\u00e9es multiples de syst\u00e8mes analytiques. 2018. <em> <a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/Giusti-Yakoubsohn-2018-09-08.pdf\">Giusti-Yakoubsohn-2018-09-08.pdf<\/a> <\/em><br \/>\nCode Maple : <a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/M\u00e9thode-de-d\u00e9flation-Exemple-num\u00e9rique.mw\">M\u00e9thode-de-d\u00e9flation-Exemple-num\u00e9rique.mw<\/a><\/em><\/li>\n<li> <a href=\"http:\/\/www.lix.polytechnique.fr\/~giusti\/\">Marc Giusti, <\/a> <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn.<\/a> Numerical Approximation of Multiple Isolated roots of Analytic Systems. 2017. <em> <a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2012\/04\/Giusti-Yakoubsohn-19-07-2017.pdf\">Giusti-Yakoubsohn-19-07-2017.pdf<\/a> <\/em><\/li>\n<li>  <a href=\"http:\/\/www.lix.polytechnique.fr\/~giusti\/\">Marc Giusti, <\/a> <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn.<\/a> <a style=\"color: #e68a13\" href=\"http:\/\/www.ams.org\/books\/conm\/604\/\"> Multiplicity hunting and approximating multiple roots of polynomial systems <\/a> <em> Recent advances in real complexity and computation, <\/em> 105\u2013128, Contemporary Mathematics 604, <em> AMS, 2013. <a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2012\/04\/conm604.pdf\">conm604<\/a> <\/em> <\/li>\n<li>  <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn.<\/a> <a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2012\/04\/yak_05_bissection_analysis.pdf\"> Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions <\/a> <em> Journal of Complexity 21 (2005) 652 \u2013 690. <\/em> <\/li>\n<li> <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn, <\/a><a href=\"https:\/\/www.unirioja.es\/cu\/jmguti\/EnglishVersion.html\">Jos\u00e9 Miguel Guti\u00e9rrez, <\/a><a href=\"https:\/\/scholar.google.es\/citations?user=S9u6pJwAAAAJ&amp;hl=es\/\">\u00c1ngel Alberto Magre\u00f1\u00e1n. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/SEMA-2016.pdf\"> Complexity of an homotopy method at the neighbourhood of a zero <\/a> <em> Advances in iterative methods for nonlinear equations,<\/em> 147\u2013171, SEMA SIMAI Springer Ser., 10, Springer, 2016. <\/em> <\/li>\n<li>  <a href=\"http:\/\/www.math.univ-toulouse.fr\/~cheze\/\">Guillaume Ch\u00e8ze, <\/a><a href=\"https:\/\/math.unice.fr\/~galligo\/\">Andr\u00e9 Galligo, <\/a><a href=\"https:\/\/www-sop.inria.fr\/teams\/galaad-static\/index.php\/members-mainmenu-100\/15-membres\/11-bernard-mourrain.html\">Bernard Mourrain, <\/a><a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/TCS-2011.pdf\">  A subdivision method for computing nearest gcd with certification. <\/a> <em>  Theoretical Computer Science. 412 (2011), no. 35, 4493\u20134503. <\/em>\n<li>  <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn, <\/a><a href=\"https:\/\/www.math.univ-toulouse.fr\/~masmoudi\/index.html\">Mohamed Masmoudi, <\/a><a href=\"http:\/\/www.math.univ-toulouse.fr\/~cheze\/\">Guillaume Ch\u00e8ze, <\/a><a href=\"https:\/\/math.unice.fr\/~auroux\/\">Didier Auroux. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/ymca_amen-2011.pdf\">  Approximate GCD a la Dedieu. <\/a> <em>  Applied Mathematics E-notes 11 (2011), 244\u2013248.   <\/em>\n<li>  <a href=\"http:\/\/www.lix.polytechnique.fr\/~giusti\/\">Marc Giusti, <\/a><a href=\"https:\/\/www.lix.polytechnique.fr\/~lecerf\/index.en.html\">Gr\u00e9goireLecerf, <\/a><a href=\"http:\/\/perso.ens-lyon.fr\/bruno.salvy\/\">Bruno Salvy, <\/a><a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/FOCM-2007.pdf\">On location and approximation of clusters of zeros: case of embedding dimension one.  <\/a> <em> Foundation of Computational Mathematics, 7 (2007), no. 1, 1\u201349.   <\/em> <\/li>\n<li>  <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/JoC-2005.pdf\">Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions.  <\/a> <em> Journal of Complexity 21 (2005), no. 5, 652\u2013690. <\/em> <\/li>\n<li> <a href=\"http:\/\/www.lix.polytechnique.fr\/~giusti\/\">Marc Giusti, <\/a><a href=\"https:\/\/www.lix.polytechnique.fr\/~lecerf\/index.en.html\">Gr\u00e9goireLecerf, <\/a><a href=\"http:\/\/perso.ens-lyon.fr\/bruno.salvy\/\">Bruno Salvy, <\/a><a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/FOCM-2005.pdf\">On location and approximation of clusters of zeros of analytic functions.  <\/a> <em> Foundation of Computational Mathematics,  5 (2005), no. 3, 257\u2013311. <\/em> <\/li>\n<li> <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/FOCM-HK-2002.pdf\">Simultaneous computation of all the zero-clusters of a univariate polynomial<br \/>\n<\/a> <em>  in Foundations of computational mathematics (Hong Kong, 2000), 433\u2013455, World Sci. Publ., River Edge, NJ, 2002.  <\/em> <\/li>\n<li> <a href=\"https:\/\/www-sop.inria.fr\/teams\/galaad-static\/index.php\/members-mainmenu-100\/15-membres\/11-bernard-mourrain.html\">Bernard Mourrain, <\/a><a href=\"http:\/\/www.math.upatras.gr\/~vrahatis\/\">Michael N. Vrahatis, <\/a><a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/JoC-2002.pdf\">  On the complexity of isolating real roots and computing with certainty the topological degree.  <\/a> <em>  Journal of   Complexity 18 (2002), no. 2, 612\u2013640. <\/em> <\/li>\n<li> <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/JoC-2000-2.pdf\"> Finding a cluster of zeros of univariate polynomials.<\/a> <em> Journal of Complexity 16 (2000), no. 3, 603\u2013638.  <\/em> <\/li>\n<li> <a href=\"http:\/\/perso.ens-lyon.fr\/nathalie.revol\/\">Nathalie Revol <\/a><a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/RC-2000.pdf\"> Accelerated shift-and-add algorithms.<\/a> <em> Reliable Computing 6 (2000), no. 2, 193\u2013205. <\/em> <\/li>\n<li> <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/JoC-2000-1.pdf\"> Contraction, robustness, and numerical path-following using secant maps<\/a> <em> Journal of Complexity  16 (2000), no. 1, 286\u2013310.<\/em> <\/li>\n<li> <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/JoC-1999.pdf\"> Finding zeros of analytic functions: \u03b1 theory for secant type methods.<\/a> <em> Journal of Complexity   15 (1999), no. 2, 239\u2013281. <\/em> <\/li>\n<li> <a href=\"https:\/\/perso.math.univ-toulouse.fr\/dedieu\/\">Jean-Pierre Dedieu, <\/a><a href=\"http:\/\/xavier.gourdon.free.fr\/\">Xavier Gourdon, <\/a><a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/LAM-1996.pdf\">Computing the distance from a point to an algebraic hypersurface in <\/a> <em> The mathematics of numerical analysis (Park City, UT, 1995), 285\u2013293, Lectures in Appl. Math., 32, Amer. Math. Soc., Providence, RI, 1996.<\/em> <\/li>\n<li> <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/NA-1995.pdf\"> A universal constant for the convergence of Newton&#8217;s method and an application to the classical homotopy method. <\/a> <em>  Numerical Algorithms 9 (1995), no. 3-4, 223\u2013244.<\/em> <\/li>\n<li> <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/CRAS-1995.pdf\"> Une constante universelle pour la convergence de la m\u00e9thode de Newton. <\/a> <em> Comptes Rendus de l&#8217;Acad\u00e9mie des Sciences Paris S\u00e9r. I Math. 320 (1995), no. 3, 385\u2013390.<\/em> <\/li>\n<li> <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/NA-94.pdf\">  Approximating the zeros of analytic functions by the exclusion algorithm.<\/a><em>  Numerical Algorithms 6 (1994), no. 1-2, 63\u201388. <\/em> <\/li>\n<li> <a href=\"https:\/\/perso.math.univ-toulouse.fr\/dedieu\/\">Jean-Pierre Dedieu, <\/a><a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/NA-93.pdf\"> Computing the real roots of a polynomial by the exclusion algorithm. <\/a><em>  Numerical Algorithms 4 (1993), no. 1-2, 1\u201324. <\/em>  <\/li>\n<li> <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/JPAA-1993.pdf\"> The Sturm method in the complex case. <\/a><em>  Journal of Pure and Applied Algebra 84 (1993), no. 1, 95\u2013105.<\/em> <\/li>\n<li> <a href=\"https:\/\/perso.math.univ-toulouse.fr\/dedieu\/\">Jean-Pierre Dedieu, <\/a><a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/AAEECC-92.pdf\"> Localization of an algebraic hypersurface by the exclusion algorithm. <\/a><em> Applicable Algebra in Engineering, Communication and Computing, 2 (1992), no. 4, 239\u2013256. <\/em> <\/li>\n<li> <a href=\"\">Anne Bellido, <\/a><a href=\"https:\/\/perso.math.univ-toulouse.fr\/dedieu\/\">Jean-Pierre Dedieu, <\/a><a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/AUF-1991.pdf\">Combien existe-t-il d&#8217;octa\u00e8dres dont les longueurs des ar\u00eates sont donn\u00e9es? <\/a><em>  Annali dell&#8217;Universit\u00e0 di Ferrara. Sezione 7: Scienze matematiche, 37 (1991), 65\u201383.  <\/em> <\/li>\n<li> <a href=\"https:\/\/perso.math.univ-toulouse.fr\/dedieu\/\">Jean-Pierre Dedieu, <\/a><a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/CRAS-91.pdf\"> Localisation d&#8217;une vari\u00e9t\u00e9 alg\u00e9brique r\u00e9elle par l&#8217;algorithme d&#8217;exclusion.<\/a> <em> Comptes Rendus de l&#8217;Acad\u00e9mie des Sciences Paris S\u00e9r. I Math.  312 (1991), no. 13, 1013\u20131016. <\/em>  <\/li>\n<li> <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/JPAA-1990.pdf\">On Newton&#8217;s rule and Sylvester&#8217;s theorems.<\/a> <em>  Journal of Pure and Applied Algebra 65 (1990), no. 3, 293\u2013309.  <\/em> <\/li>\n<li> <a href=\"http:\/\/www.math.univ-toulouse.fr\/~yak\/\">Jean-Claude Yakoubsohn. <\/a><a style=\"color: #e68a13\" href=\"http:\/\/perso.math.univ-toulouse.fr\/yak\/files\/2018\/09\/CRAS-89.pdf\">  Sur un proc\u00e9d\u00e9 de construction d&#8217;algorithmes de calcul approch\u00e9 des racines d&#8217;une \u00e9quation du type f(x)=0. <\/a> <em> Comptes Rendus de l&#8217;Acad\u00e9mie des Sciences Paris S\u00e9r. I Math.   308 (1989), no. 13, 433\u2013436. <\/em> <\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"<p>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 Rima Khouja, Bernard Mourrain, Jean-Claude Yakoubsohn.. Newton\u2011type methods for simultaneous matrix diagonalization. 2022. newton-type-methods-for-simultaneous-matrix-diagonalization.pdf Marc Giusti, Jean-Claude Yakoubsohn. Approximation num\u00e9riques de racines isol\u00e9es multiples de syst\u00e8mes analytiques. 2018. Giusti-Yakoubsohn-2018-09-08.pdf Code Maple : M\u00e9thode-de-d\u00e9flation-Exemple-num\u00e9rique.mw Marc Giusti, [&hellip;]<\/p>\n","protected":false},"author":153,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-42","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/yak\/wp-json\/wp\/v2\/pages\/42","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/yak\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/yak\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/perso.math.univ-toulouse.fr\/yak\/wp-json\/wp\/v2\/users\/153"}],"replies":[{"embeddable":true,"href":"https:\/\/perso.math.univ-toulouse.fr\/yak\/wp-json\/wp\/v2\/comments?post=42"}],"version-history":[{"count":99,"href":"https:\/\/perso.math.univ-toulouse.fr\/yak\/wp-json\/wp\/v2\/pages\/42\/revisions"}],"predecessor-version":[{"id":423,"href":"https:\/\/perso.math.univ-toulouse.fr\/yak\/wp-json\/wp\/v2\/pages\/42\/revisions\/423"}],"wp:attachment":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/yak\/wp-json\/wp\/v2\/media?parent=42"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}