Mapping LSE method on a grid: Software architecture and Performance gains - Université Grenoble Alpes Accéder directement au contenu
Chapitre D'ouvrage Année : 2006

Mapping LSE method on a grid: Software architecture and Performance gains

Résumé

The chapter explores how least square extrapolation (LSE) can perform on a commercial code, without having any knowledge on the source code. It emphasizes this approach by using a basic network of workstation to compute the weighted solutions and then solves the minimization problem over the produce results. In computational fluid dynamics (CFD), a Posteriori error estimators are widely produced using Richardson extrapolation (RE) and variations of it. All these methods rely on the a priori existence of an asymptotic expansion of the error—such as a Taylor formula—and make no direct use of the PDE formulation. As a consequence, RE methods are extremely simple to implement. But in practice, meshes might not be fine enough to satisfy accurately the a priori convergence estimates that are asymptotic in nature. RE is unreliable or fairly unstable and sensitive to noisy data.
Fichier non déposé

Dates et versions

hal-03263978 , version 1 (17-06-2021)

Identifiants

Citer

Christophe Picard, Marc Garbey, Venkat Subramaniam. Mapping LSE method on a grid: Software architecture and Performance gains. Parallel Computational Fluid Dynamics 2005, Elsevier, pp.149-156, 2006, ⟨10.1016/B978-044452206-1/50017-3⟩. ⟨hal-03263978⟩

Collections

UGA TDS-MACS
13 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More