We stand with Ukraine  

Jean-Claude Yakoubsohn

According to our database1, Jean-Claude Yakoubsohn authored at least 17 papers between 1991 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
High Order Numerical Methods To Approximate The Singular Value Decomposition.
[BibTeX]
[DOI]
Diego Armentano
,
Jean-Claude Yakoubsohn
CoRR, 2023

2021
Newton-Type Methods For Simultaneous Matrix Diagonalization.
[BibTeX]
[DOI]
Rima Khouja
,
Bernard Mourrain
,
Jean-Claude Yakoubsohn
CoRR, 2021

2012
Jean-Pierre Dedieu 1949-2012.
[BibTeX]
[DOI]
Jean-Claude Yakoubsohn
J. Complex., 2012

2011
A subdivision method for computing nearest gcd with certification.
[BibTeX]
[DOI]
Guillaume Chèze
,
André Galligo
,
Bernard Mourrain
,
Jean-Claude Yakoubsohn
Theor. Comput. Sci., 2011

2009
Computing nearest Gcd with certification.
[BibTeX]
[DOI]
Guillaume Chèze
,
Jean-Claude Yakoubsohn
,
André Galligo
,
Bernard Mourrain
Proceedings of the Symbolic Numeric Computation, 2009

2007
On Location and Approximation of Clusters of Zeros: Case of Embedding Dimension One.
[BibTeX]
[DOI]
Marc Giusti
,
Grégoire Lecerf
,
Bruno Salvy
,
Jean-Claude Yakoubsohn
Found. Comput. Math., 2007

2005
Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions.
[BibTeX]
[DOI]
Jean-Claude Yakoubsohn
J. Complex., 2005

On Location and Approximation of Clusters of Zeros of Analytic Functions.
[BibTeX]
[DOI]
Marc Giusti
,
Grégoire Lecerf
,
Bruno Salvy
,
Jean-Claude Yakoubsohn
Found. Comput. Math., 2005

2002
On the Complexity of Isolating Real Roots and Computing with Certainty the Topological Degree.
[BibTeX]
[DOI]
Bernard Mourrain
,
Michael N. Vrahatis
,
Jean-Claude Yakoubsohn
J. Complex., 2002

2000
Accelerated Shift-and-Add Algorithms.
[BibTeX]
[DOI]
Nathalie Revol
,
Jean-Claude Yakoubsohn
Reliab. Comput., 2000

Finding a Cluster of Zeros of Univariate Polynomials.
[BibTeX]
[DOI]
Jean-Claude Yakoubsohn
J. Complex., 2000

Contraction, Robustness, and Numerical Path-Following Using Secant Maps.
[BibTeX]
[DOI]
Jean-Claude Yakoubsohn
J. Complex., 2000

1999
Finding Zeros of Analytic Functions: alpha Theory for Secant Type Methods.
[BibTeX]
[DOI]
Jean-Claude Yakoubsohn
J. Complex., 1999

1995
A universal constant for the convergence of Newton's method and an application to the classical homotopy method.
[BibTeX]
[DOI]
Jean-Claude Yakoubsohn
Numer. Algorithms, 1995

1994
Approximating the zeros of analytic functions by the exclusion algorithm.
[BibTeX]
[DOI]
Jean-Claude Yakoubsohn
Numer. Algorithms, 1994

1993
Computing the real roots of a polynomial by the exclusion algorithm.
[BibTeX]
[DOI]
Jean-Pierre Dedieu
,
Jean-Claude Yakoubsohn
Numer. Algorithms, 1993

1991
Localization of an Algebraic Hypersurface by the Exclusion Algorithm.
[BibTeX]
[DOI]
Jean-Pierre Dedieu
,
Jean-Claude Yakoubsohn
Appl. Algebra Eng. Commun. Comput., 1991


  Loading...