2 resultados para coarsening

em Queensland University of Technology - ePrints Archive


Relevância:

10.00% 10.00%

Publicador:

Resumo:

A calorimetric study has shown that glasses along the albite-diopside join in the system albiteanorthite-diopside have positive enthalpies of mixing. Thermodynamic calculations based on these data describe a nearly symmetric, metastable, subliquidus irascibility gap along the join with a critical temperature at 910 K. The existence of the miscibility gap was tested experimentally by annealing an Ab50Di50 glass at 748 K and 823 K. Annealed glasses were examined by optical microscopy and by scanning and transmission electron microscopy. The glasses showed morphological and chemical features consistent with unmixing of two glass phases. The apparent mechanism of phase separation involves initial spinodal decomposition followed by coarsening to produce 0.1 μm–0.3 μm spherical glass phases.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A new mesh adaptivity algorithm that combines a posteriori error estimation with bubble-type local mesh generation (BLMG) strategy for elliptic differential equations is proposed. The size function used in the BLMG is defined on each vertex during the adaptive process based on the obtained error estimator. In order to avoid the excessive coarsening and refining in each iterative step, two factor thresholds are introduced in the size function. The advantages of the BLMG-based adaptive finite element method, compared with other known methods, are given as follows: the refining and coarsening are obtained fluently in the same framework; the local a posteriori error estimation is easy to implement through the adjacency list of the BLMG method; at all levels of refinement, the updated triangles remain very well shaped, even if the mesh size at any particular refinement level varies by several orders of magnitude. Several numerical examples with singularities for the elliptic problems, where the explicit error estimators are used, verify the efficiency of the algorithm. The analysis for the parameters introduced in the size function shows that the algorithm has good flexibility.