| HAL : hal-00609212, version 1 |
| Fiche détaillée | Récupérer au format |
|
|
|
|
| A successive constraint method with minimal offline constraints for lower bounds of parametric coercivity constant |
|
|
| Sylvain Vallaghé 1Michel Fouquembergh 2 |
|
|
| Feel++ Collaboration(s) |
|
|
| (30/06/2011) |
|
|
| A posteriori error estimates are a key ingredient for the certified reduced basis method. Sharp error bounds rely on the construction of lower bounds for the coercivity or inf-sup stability constant. The Successive Constraint Method (SCM) has been previously proposed to compute such lower bounds, using an efficient Offline-Online strategy. We present in this article some modifications to the SCM to get rid of user-dependent parameters, which also improve convergence and reduce the computational cost of the method. |
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire Jean Kuntzmann (LJK) |
| CNRS : UMR5224 – Université Joseph Fourier - Grenoble I – Université Pierre-Mendès-France - Grenoble II – Institut Polytechnique de Grenoble - Grenoble Institute of Technology | |
| 2 : | EADS Innovation Works [Suresnes] (EADS IW) |
| EADS | |
| 3 : | Institut de Recherche Mathématique Avancée (IRMA) |
| CNRS : UMR7501 – Université de Strasbourg | |
|
|
|
|
|
|
|
|
| Domaine | : | Mathématiques/Analyse numérique Sciences de l'ingénieur/Mécanique/Thermique Physique/Mécanique/Thermique Mathématiques/Equations aux dérivées partielles Mathématiques/Optimisation et contrôle |
|
|
| certified reduced basis – successive constraints methods – linear programming – generalized eigenvalue problems |
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|
|
| hal-00609212, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00609212 | |
| oai:hal.archives-ouvertes.fr:hal-00609212 | |
| Contributeur : Christophe Prud'Homme | |
| Soumis le : Lundi 18 Juillet 2011, 22:16:21 | |
| Dernière modification le : Mercredi 12 Décembre 2012, 08:18:26 | |