Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
An efficient adaptive algorithm is presented for a stationary regularized Stefan problem in 2D. The adaptive criteria relies upon a posteriori estimates based on the residual equation. Since the problem we are studying is a non-linear diffusion-convection problem, these error estimates are relatively crude in the sense that the constant relating the true error to the error indicator is unknown. Thus, instead of trying to build a mesh such that the true error is below a given tolerance, the local error indicator is equidistributed in a way such that the final number of triangles is close to a desired value. At each iteration of the adaptive algorithm, the new triangulation is obtained from the previous one by adding or deleting vertices according to the error indicator and a global mesh regeneration is performed using a Delaunay mesh generator. Numerical experiments for two practical situations show the efficiency and the robustness of our approach.