Searcharxiv⌕ Search

arXiv · 2611.20722

Scaled boundary finite elements for FFT-based computational micromechanics

Abstract

We introduce a matrix-free FFT-based solver for three-dimensional linear elastic homogenization problems discretized by the scaled boundary finite element method (SBFEM) on a voxel grid. Owing to its analytical solution in the radial direction, the SBFEM discretization is inherently softer than fully integrated voxel finite elements, whereas its displacement-based formulation remains symmetric, conforming, and supports arbitrary stiffness anisotropy. These properties make SBFEM an attractive candidate for porous and highly heterogeneous microstructures, where existing voxel-based FFT discretizations offer no generally reliable choice: Reduced-integration hexahedral elements, equivalently the rotated staggered grid discretization, may suffer from hourglass instabilities in the presence of voids, whereas fully integrated hexahedral elements are often too stiff. The proposed discretization uses hexahedral SBFEM cells on the full voxel mesh of a regular periodic grid, retaining the simplicity of a fixed-resolution voxel representation without requiring adaptive mesh coarsening. The main contribution is a preconditioner based on the homogeneous SBFEM stiffness operator. We show that this preconditioner may be applied locally in Fourier space and that the condition number of the preconditioned system is bounded by the material contrast, independently of the grid resolution. This result enables a fully matrix-free implementation of the SBFEM-discretized problem, without assembling or storing the global stiffness matrix. Numerical experiments on a short-fibre reinforced composite, a polyurethane foam and a sand-based binder jet microstructure demonstrate robust convergence and competitive accuracy compared with established voxel discretizations. In particular, SBFEM remains stable for porous microstructures, for which reduced-integration hexahedral elements become unstable.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Flavia Gehrig, Carolin Birk, Matti Schneider. 2026-11-16. Scaled boundary finite elements for FFT-based computational micromechanics. https://searcharxiv.com/abs/2611.20722

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Adaptive Finite State Projection with Quantile-Based Pruning for Solving the Chemical Master Equation

We present an adaptive Finite State Projection (FSP) method for efficiently solving the Chemical Master Equation (CME) with rigorous error control. Our approach integrates time-stepping with dynamic state-space truncation, balancing accuracy and computational cost. Krylov subspace methods approximate the matrix exponential, while quantile-based pruning controls state-space growth by removing low-probability states. Theoretical error bounds ensure that the truncation error remains bounded by the pruned mass at each step, which is user-controlled, and does not propagate forward in time. Numerical experiments on biochemical systems, including the Lotka-Volterra and Michaelis-Menten and bi-stable toggle switch models.

cs.CE↗

SoK: Market Microstructure for Decentralized Prediction Markets (DePMs)

Decentralized prediction markets (DePMs) allow open participation in event-based wagering without fully relying on centralized intermediaries. We review the history of DePMs which date back to 2011 and includes hundreds of proposals. Perhaps surprising, modern DePMs like Polymarket deviate materially from earlier designs like Truthcoin and Augur v1. We use our review to present a modular workflow comprising eight stages: underlying infrastructure, market topic, share structure and pricing, market initialization, trading, market resolution, settlement, and archiving. For each module, we enumerate the design variants, analyzing trade-offs around decentralization, expressiveness, and manipulation resistance. We also identify open problems for researchers interested in this ecosystem.

cs.CE↗

A Multigrid Finite State Projection Algorithm For The Solution Of The Reaction-Diffusion Master Equation

We develop a multigrid method for the finite state projection of the reaction-diffusion master equation (RDME). The RDME evolves the joint probabilities of molecular count configurations across well-mixed voxels coupled by local reactions and diffusive jumps. When fast diffusion or large reaction rates make this evolution stiff over long time horizons, implicit time stepping requires solving a large shifted linear system at every step. Grouping neighboring voxels and summing their molecular counts produces a hierarchy of coarser state spaces terminating at a one-voxel chemical master equation. Restriction sums residual entries with the same coarse counts, while multinomial prolongation preserves the RDME generator form on every level with explicit coarse reaction and diffusion rates. For reversible diffusion, the error omitted by coarsening is bounded by the graph Dirichlet energy of jumps inside the aggregates, with a constant independent of population. Numerical tests with standard multigrid cycles and point or block Gauss-Seidel smoothing reach 7.16 million states and resolve rare probabilities of order $10^{-7}$.

cs.CE↗