default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Claude Yakoubsohn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i2]Diego Armentano, Jean-Claude Yakoubsohn:
High Order Numerical Methods To Approximate The Singular Value Decomposition. CoRR abs/2309.06201 (2023)- 2021
- [i1]Rima Khouja, Bernard Mourrain, Jean-Claude Yakoubsohn:
Newton-Type Methods For Simultaneous Matrix Diagonalization. CoRR abs/2110.11133 (2021)
2010 – 2019
- 2012
- [j14]Jean-Claude Yakoubsohn:
Jean-Pierre Dedieu 1949-2012. J. Complex. 28(5-6): 521-523 (2012) - 2011
- [j13]Guillaume Chèze, André Galligo, Bernard Mourrain, Jean-Claude Yakoubsohn:
A subdivision method for computing nearest gcd with certification. Theor. Comput. Sci. 412(35): 4493-4503 (2011)
2000 – 2009
- 2009
- [c1]Guillaume Chèze, Jean-Claude Yakoubsohn, André Galligo, Bernard Mourrain:
Computing nearest Gcd with certification. SNC 2009: 29-34 - 2007
- [j12]Marc Giusti, Grégoire Lecerf, Bruno Salvy
, Jean-Claude Yakoubsohn:
On Location and Approximation of Clusters of Zeros: Case of Embedding Dimension One. Found. Comput. Math. 7(1): 1-58 (2007) - 2005
- [j11]Marc Giusti, Grégoire Lecerf, Bruno Salvy, Jean-Claude Yakoubsohn:
On Location and Approximation of Clusters of Zeros of Analytic Functions. Found. Comput. Math. 5(3): 257-311 (2005) - [j10]Jean-Claude Yakoubsohn:
Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions. J. Complex. 21(5): 652-690 (2005) - 2002
- [j9]Bernard Mourrain, Michael N. Vrahatis, Jean-Claude Yakoubsohn:
On the Complexity of Isolating Real Roots and Computing with Certainty the Topological Degree. J. Complex. 18(2): 612-640 (2002) - 2000
- [j8]Jean-Claude Yakoubsohn:
Contraction, Robustness, and Numerical Path-Following Using Secant Maps. J. Complex. 16(1): 286-310 (2000) - [j7]Jean-Claude Yakoubsohn:
Finding a Cluster of Zeros of Univariate Polynomials. J. Complex. 16(3): 603-638 (2000) - [j6]Nathalie Revol, Jean-Claude Yakoubsohn:
Accelerated Shift-and-Add Algorithms. Reliab. Comput. 6(2): 193-205 (2000)
1990 – 1999
- 1999
- [j5]Jean-Claude Yakoubsohn:
Finding Zeros of Analytic Functions: alpha Theory for Secant Type Methods. J. Complex. 15(2): 239-281 (1999) - 1995
- [j4]Jean-Claude Yakoubsohn:
A universal constant for the convergence of Newton's method and an application to the classical homotopy method. Numer. Algorithms 9(2): 223-244 (1995) - 1994
- [j3]Jean-Claude Yakoubsohn:
Approximating the zeros of analytic functions by the exclusion algorithm. Numer. Algorithms 6(1): 63-88 (1994) - 1993
- [j2]Jean-Pierre Dedieu, Jean-Claude Yakoubsohn:
Computing the real roots of a polynomial by the exclusion algorithm. Numer. Algorithms 4(1): 1-24 (1993) - 1991
- [j1]Jean-Pierre Dedieu, Jean-Claude Yakoubsohn:
Localization of an Algebraic Hypersurface by the Exclusion Algorithm. Appl. Algebra Eng. Commun. Comput. 2: 239-256 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
