An adaptive local mesh refinement strategy for two-phase Stefan problems is discussed in light of its efficiency and computational complexity. Three local parameters are used to equidistribute interpolation errors in maximum norm for temperature and a fourth one, in the event of mushy regions, to equidistribute L1-interpolation errors for enthalpy within the mush. If certain quality mesh tests fail, then the current mesh is discarded and a new one completely regenerated by an efficient mesh generator, which in turn is briefly described. A typical triangulation is strongly graded to become very fine near computed interfaces and coarse away from them. Consecutive meshes are not compatible. The use of quadtree data structures is discussed as a means to reach a nearly optimal computational complexity in various tasks to be performed, mainly in generating a mesh and interpolating. Various implementation details are given so as to derive the computational complexity of each relevant subroutine. The approximation of both solutions and interfaces is drastically improved. The proposed method is robust in that it can handle the formation of cusps and mushy regions as well as the spontaneous appearance of phases. It is also superior in terms of computing time for a desired accuracy. Several numerical experiments illustrate these facts and provide quantitative information about each task complexity.

An adaptive finite element method for two-phase Stefan problems in two space dimensions. 2.: Implementation and numerical experiments / R.H. Nochetto, M. Paolini, C. Verdi. - In: SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING. - ISSN 0196-5204. - 12:5(1991), pp. 1207-1244. [10.1137/0912065]

An adaptive finite element method for two-phase Stefan problems in two space dimensions. 2.: Implementation and numerical experiments

C. Verdi
Ultimo
1991

Abstract

An adaptive local mesh refinement strategy for two-phase Stefan problems is discussed in light of its efficiency and computational complexity. Three local parameters are used to equidistribute interpolation errors in maximum norm for temperature and a fourth one, in the event of mushy regions, to equidistribute L1-interpolation errors for enthalpy within the mush. If certain quality mesh tests fail, then the current mesh is discarded and a new one completely regenerated by an efficient mesh generator, which in turn is briefly described. A typical triangulation is strongly graded to become very fine near computed interfaces and coarse away from them. Consecutive meshes are not compatible. The use of quadtree data structures is discussed as a means to reach a nearly optimal computational complexity in various tasks to be performed, mainly in generating a mesh and interpolating. Various implementation details are given so as to derive the computational complexity of each relevant subroutine. The approximation of both solutions and interfaces is drastically improved. The proposed method is robust in that it can handle the formation of cusps and mushy regions as well as the spontaneous appearance of phases. It is also superior in terms of computing time for a desired accuracy. Several numerical experiments illustrate these facts and provide quantitative information about each task complexity.
Settore MAT/08 - Analisi Numerica
Article (author)
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/177774
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 44
social impact