LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Error analysis for quadtree-type mesh coarsening algorithms adapted to pixelized heterogeneous microstructures

Photo from wikipedia

For pixel-based microstructure representations we propose two different variants of adaptive, quadtree-based mesh coarsening algorithms that serve the purpose of a preprocessor for finite element analyses in the context of… Click to show full abstract

For pixel-based microstructure representations we propose two different variants of adaptive, quadtree-based mesh coarsening algorithms that serve the purpose of a preprocessor for finite element analyses in the context of numerical homogenization. High resolution is preserved at interfaces for accuracy, coarse-graining in the defect-free interior of phases for efficiency. Error analysis is carried out on the micro scale by error estimation which itself is assessed by true error computation. Modified stress recovery schemes for an error indicator are proposed which overcome the deficits of the standard superconvergent recovery scheme for nodal stress computation in cases of interfaces with stiffness jump. By virtue of error analysis the improved efficiency by the reduction of unknowns is put into relation to the increase of the discretization error and thereby sets a rational basis for decisions on favorable meshes having the best trade-off between accuracy and efficiency as underpinned by various examples.

Keywords: analysis quadtree; error; error analysis; mesh coarsening; coarsening algorithms

Journal Title: Computational Mechanics
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.