Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1908.09380

Error Analysis for Quadtree-Type Mesh-Coarsening Algorithms Adapted to Pixelized Heterogeneous Microstructures

Andreas Fischer·Bernhard Eidel
View original source ↗Read source document ↗Export metadata ↓

Abstract

Pixel- and voxel-based representations of microstructures obtained from tomographic imaging methods is an established standard in computational materials science. The corresponding highly resolved, uniform discretitization in numerical analysis is adequate to accurately describe the geometry of interfaces and defects in microstructures and, therefore, to capture the physical processes in these regions of interest. For the defect-free interior of phases and grains however, the high resolution is in view of only weakly varying field properties not necessary such that mesh-coarsening in these regions can improve efficiency without severe losses of accuracy in simulations. The present work proposes two different variants of adaptive, quadtree-based mesh-coarsening algorithms applied to pixelized images that serves the purpose of a preprocessor for consecutive finite element analyses, here, in the context of numerical homogenization. Error analysis is carried out on the microscale by error estimation which itself is assessed by true error computation. A modified stress recovery scheme for a superconvergent error estimator is proposed which overcomes the deficits of the standard 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. This quantitative analysis sets a rational basis for decisions on favorable meshes having the best trade-off between accuracy and efficiency as will be underpinned by various examples.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andreas Fischer, Bernhard Eidel. 2019-08-25. Error Analysis for Quadtree-Type Mesh-Coarsening Algorithms Adapted to Pixelized Heterogeneous Microstructures. https://arxiv.org/abs/1908.09380

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

$L^{p}$-convergence of Kantorovich-type Max-Min Neural Network Operators

In this work, we study the Kantorovich variant of max-min neural network operators, in which the operator kernel is defined in terms of sigmoidal functions. Our main aim is to demonstrate the $L^{p}$-convergence of these nonlinear operators for $1\leq p<\infty$, which makes it possible to obtain approximation results for functions that are not necessarily continuous. In addition, we will derive quantitative estimates for the rate of approximation in the $L^{p}$-norm. We will provide some explicit examples, studying the approximation of discontinuous functions with the max-min operator, and varying additionally the underlying sigmoidal function of the kernel. Further, we numerically compare the $L^{p}$-approximation error with the respective error of the Kantorovich variants of other popular neural network operators. As a final application, we show that the Kantorovich variant has advantages compared to the sampling variant of the max-min operator and Kantorovich variant of the max-product operator when it comes to approximate noisy functions as for instance biomedical ECG signals.

math.NA↗
arXiv2026

Quotient geometry of tensor ring decomposition

Differential geometries derived from tensor decompositions have been extensively studied and provided the foundations for a variety of efficient numerical methods. Despite the practical success of the tensor ring (TR) decomposition, its intrinsic geometry remains less understood, primarily due to the underlying ring structure and the resulting nontrivial gauge invariance. We establish the quotient geometry and immersed-submanifold structure of TR decomposition by imposing full-rank conditions on all unfolding matrices of the core tensors and capturing the gauge invariance. The intrinsic ring structure of TR leads to an analysis that is substantially different from other tensor formats. Additionally, for the uniform TR decomposition, where all core tensors are identical and the manifold structure is known, we derive explicit parameterizations for the vertical and horizontal spaces, which enable Riemannian optimization. Numerical experiments validate the developed geometries via tensor ring completion tasks.

math.NA↗
arXiv2026

Boundary elements for clamped Kirchhoff--Love plates

We present a Galerkin boundary element method for clamped Kirchhoff--Love plates with piecewise smooth boundary. It is a direct method based on the representation formula and requires the inversion of the single-layer operator, an application of the double-layer operator to the Dirichlet data, and, in the presence of a vertical load, an application of the Dirichlet trace of the Newton potential to that load. We present trace approximation spaces of arbitrary order, required for both the Dirichlet data and the unknown Neumann trace. Our boundary element method is quasi-optimal with respect to the natural trace norm and achieves optimal convergence order under minimal regularity assumptions. We provide explicit representations of all three integral operators and discuss the implementation of the appearing integrals. Numerical experiments for smooth and non-smooth domains confirm predicted convergence rates.

math.NA↗