Un algorithme de Gradient Conjugué Projeté préconditionné pour la résolution de problèmes unilatéraux
- Other title
- A preconditioned Projected Conjugate Gradient for the solution of unilateral problems (en)
- Author
- TARDIEU, Nicolas1 ; YOUBISSI, Fabien2 ; CHAMBERLAND, Eric2
[1] LaMSID -UMR EDF/CNRS 2832, EDF-R&D, 1, avenue du Général-de-Gaulle, 92140 Clamart, France
[2] GIREF, Université Laval, Québec, G1K7P4, Canada - Source
Comptes rendus. Mécanique. 2008, Vol 336, Num 11-12, pp 840-845, 6 p ; ref : 10 ref
- ISSN
- 1631-0721
- Scientific domain
- Mechanics acoustics
- Publisher
- Elsevier, Paris
- Publication country
- France
- Document type
- Article
- Language
- French
- Author keyword
- Conjugate Gradient Contact Preconditioner
- Keyword (fr)
- Contact mécanique Minimisation Méthode gradient conjugué Méthode gradient projeté Méthode gradient Optimisation Problème Dirichlet Problème valeur limite Programmation convexe Préconditionnement Unilatéral
- Keyword (en)
- Mechanical contact Minimization Conjugate gradient method Projected gradient method Gradient method Optimization Dirichlet problem Boundary value problem Convex programming Preconditioning Unilateral
- Keyword (es)
- Contacto mecánico Minimización Método gradiente conjugado Método gradiente proyecto Método gradiente Optimización Problema Dirichlet Problema valor limite Programación convexa Precondicionamiento Unilateral
- Classification
- Pascal
- 001 Exact sciences and technology / 001B Physics / 001B40 Fundamental areas of phenomenology (including applications) / 001B40F Solid mechanics / 001B40F30 Structural and continuum mechanics / 001B40F30P Mechanical contact (friction...)
- Discipline
- Physics : solid mechanics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 20904997
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1016/j.crme.2008.10.007 
https://dx.doi.org/10.1016/j.crme.2008.10.007
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:26:\"10.1016\/j.crme.2008.10.007\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:108:\"Un algorithme de Gradient Conjugu\u00e9 Projet\u00e9 pr\u00e9conditionn\u00e9 pour la r\u00e9solution de probl\u00e8mes unilat\u00e9raux\";s:9:\"\u0000*\u0000jtitle\";s:26:\"Comptes rendus. M\u00e9canique\";s:9:\"\u0000*\u0000stitle\";s:11:\"C. r., M\u00e9c\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:3:\"336\";s:8:\"\u0000*\u0000issue\";s:5:\"11-12\";s:8:\"\u0000*\u0000spage\";s:3:\"840\";s:8:\"\u0000*\u0000epage\";s:3:\"845\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1631-0721\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"TARDIEU\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Nicolas\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:16:\"YOUBISSI, Fabien\";i:1;s:17:\"CHAMBERLAND, Eric\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:108:\"Un algorithme de Gradient Conjugu\u00e9 Projet\u00e9 pr\u00e9conditionn\u00e9 pour la r\u00e9solution de probl\u00e8mes unilat\u00e9raux\";s:8:\"\u0000*\u0000place\";s:5:\"Paris\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"6\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:26:\"10.1016\/j.crme.2008.10.007\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:108:\"Un algorithme de Gradient Conjugu\u00e9 Projet\u00e9 pr\u00e9conditionn\u00e9 pour la r\u00e9solution de probl\u00e8mes unilat\u00e9raux\";s:9:\"\u0000*\u0000jtitle\";s:26:\"Comptes rendus. M\u00e9canique\";s:9:\"\u0000*\u0000stitle\";s:11:\"C. r., M\u00e9c\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:3:\"336\";s:8:\"\u0000*\u0000issue\";s:5:\"11-12\";s:8:\"\u0000*\u0000spage\";s:3:\"840\";s:8:\"\u0000*\u0000epage\";s:3:\"845\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1631-0721\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"TARDIEU\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Nicolas\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:16:\"YOUBISSI, Fabien\";i:1;s:17:\"CHAMBERLAND, Eric\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:108:\"Un algorithme de Gradient Conjugu\u00e9 Projet\u00e9 pr\u00e9conditionn\u00e9 pour la r\u00e9solution de probl\u00e8mes unilat\u00e9raux\";s:8:\"\u0000*\u0000place\";s:5:\"Paris\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"6\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:26:\"10.1016\/j.crme.2008.10.007\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:26:\"10.1016\/j.crme.2008.10.007\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:108:\"Un algorithme de Gradient Conjugu\u00e9 Projet\u00e9 pr\u00e9conditionn\u00e9 pour la r\u00e9solution de probl\u00e8mes unilat\u00e9raux\";s:9:\"\u0000*\u0000jtitle\";s:26:\"Comptes rendus. M\u00e9canique\";s:9:\"\u0000*\u0000stitle\";s:11:\"C. r., M\u00e9c\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:3:\"336\";s:8:\"\u0000*\u0000issue\";s:5:\"11-12\";s:8:\"\u0000*\u0000spage\";s:3:\"840\";s:8:\"\u0000*\u0000epage\";s:3:\"845\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1631-0721\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"TARDIEU\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Nicolas\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:16:\"YOUBISSI, Fabien\";i:1;s:17:\"CHAMBERLAND, Eric\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:108:\"Un algorithme de Gradient Conjugu\u00e9 Projet\u00e9 pr\u00e9conditionn\u00e9 pour la r\u00e9solution de probl\u00e8mes unilat\u00e9raux\";s:8:\"\u0000*\u0000place\";s:5:\"Paris\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"6\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:26:\"10.1016\/j.crme.2008.10.007\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:108:\"Un algorithme de Gradient Conjugu\u00e9 Projet\u00e9 pr\u00e9conditionn\u00e9 pour la r\u00e9solution de probl\u00e8mes unilat\u00e9raux\";s:9:\"\u0000*\u0000jtitle\";s:26:\"Comptes rendus. M\u00e9canique\";s:9:\"\u0000*\u0000stitle\";s:11:\"C. r., M\u00e9c\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:3:\"336\";s:8:\"\u0000*\u0000issue\";s:5:\"11-12\";s:8:\"\u0000*\u0000spage\";s:3:\"840\";s:8:\"\u0000*\u0000epage\";s:3:\"845\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1631-0721\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"TARDIEU\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Nicolas\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:16:\"YOUBISSI, Fabien\";i:1;s:17:\"CHAMBERLAND, Eric\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:108:\"Un algorithme de Gradient Conjugu\u00e9 Projet\u00e9 pr\u00e9conditionn\u00e9 pour la r\u00e9solution de probl\u00e8mes unilat\u00e9raux\";s:8:\"\u0000*\u0000place\";s:5:\"Paris\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"6\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:26:\"10.1016\/j.crme.2008.10.007\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:108:\"Un algorithme de Gradient Conjugu\u00e9 Projet\u00e9 pr\u00e9conditionn\u00e9 pour la r\u00e9solution de probl\u00e8mes unilat\u00e9raux\";s:9:\"\u0000*\u0000jtitle\";s:26:\"Comptes rendus. M\u00e9canique\";s:9:\"\u0000*\u0000stitle\";s:11:\"C. r., M\u00e9c\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:3:\"336\";s:8:\"\u0000*\u0000issue\";s:5:\"11-12\";s:8:\"\u0000*\u0000spage\";s:3:\"840\";s:8:\"\u0000*\u0000epage\";s:3:\"845\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1631-0721\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"TARDIEU\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Nicolas\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:16:\"YOUBISSI, Fabien\";i:1;s:17:\"CHAMBERLAND, Eric\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:108:\"Un algorithme de Gradient Conjugu\u00e9 Projet\u00e9 pr\u00e9conditionn\u00e9 pour la r\u00e9solution de probl\u00e8mes unilat\u00e9raux\";s:8:\"\u0000*\u0000place\";s:5:\"Paris\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"6\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
