default search action
Jean Claude Miellou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
- [j10]Pierre Spitéri, Jean Claude Miellou, Didier El Baz
:
Parallel Asynchronous Schwarz and Multisplitting Methods for a Nonlinear Diffusion Problem. Numer. Algorithms 33(1-4): 461-474 (2003) - 2002
- [j9]Jean Claude Miellou, Pierre Spitéri:
Optimization of the Relaxation Parameter for S.S.O.R. and A.D.I. Preconditioning. Numer. Algorithms 29(1-3): 153-195 (2002) - [j8]Pierre Spitéri, Jean Claude Miellou, Jacques M. Bahi:
Evaluations of Parameters for the Optimization of S.S.O.R. and A.D.I. Preconditioning. Numer. Algorithms 29(1-3): 249-265 (2002)
1990 – 1999
- 1998
- [j7]Jean Claude Miellou, Didier El Baz
A new class of asynchronous iterative algorithms with order intervals. Math. Comput. 67(221): 237-255 (1998) - 1997
- [j6]Jacques M. Bahi, Jean Claude Miellou, K. Rhofir:
Asynchronous multisplitting methods for nonlinear fixed point problems. Numer. Algorithms 15(3-4): 315-345 (1997) - [j5]Ronan Guivarch, Pierre Spitéri, H. C. Boisson, Jean Claude Miellou:
Schwarz Alternating Parallel Algorithm Applied to Incompressible Flow Computation in Vorticity Stream Function Formulation. Parallel Algorithms Appl. 11(3-4): 205-225 (1997) - [c2]Didier El Baz, Didier Gazen, Mohamed Jarraya, Pierre Spitéri, Jean Claude Miellou:
Flexible Communication for Parallel Asynchronous Methods with Application to a Nonlinear Optimization Problem. PARCO 1997: 429-436 - 1996
- [j4]Didier El Baz, Pierre Spitéri, Jean Claude Miellou, Didier Gazen:
Asynchronous Iterative Algorithms with Flexible Communication for Nonlinear Network Flow Problems. J. Parallel Distributed Comput. 38(1): 1-15 (1996) - 1993
- [j3]M. Bahi, Jean Claude Miellou:
Contractive Mappings with Maximum Norms: Comparison of Constants of Contraction and Application to Asynchronous Iterations. Parallel Comput. 19(5): 511-523 (1993) - 1992
- [j2]Jean Claude Miellou, Pierre Spitéri, David J. Evans:
Préconditionnement S.S.O.R.: Optimisation du conditionnement obtenu en fonction du parametre de relaxation. Int. J. Comput. Math. 41(3-4): 189-200 (1992)
1980 – 1989
- 1986
- [j1]Jean Claude Miellou, Guy-René Perrin, Pierre Spitéri:
An inexpensive method of performance evaluation for subdomain decomposition parallel algorithms of three-dimensional elliptical problems. J. Syst. Softw. 6(1-2): 169-173 (1986)
1970 – 1979
- 1975
- [c1]Jean Claude Miellou:
A Mixt Relaxation Algorithm Applied to Quasi-Variational. Optimization Techniques 1975: 192-199 - 1970
- [b2]Jean Claude Miellou:
Sur une notion de monotonie conduisant à une extension de l'application de la méthode variationnelle dans l'étude des systèmes d'équations et d'inéquations aux dérivées partielles : opérateurs paramonotones. Joseph Fourier University, Grenoble, France, 1970
1960 – 1969
- 1961
- [b1]Jean Claude Miellou:
Contribution à l'étude de l'erreur dans l'approximation des intégrales multiples. Joseph Fourier University, Grenoble, France, 1961
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:57 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: