Articles in this Volume

Research Article Open Access
Topology optimization of plate based on the Reissner-Mindlin theory
Article thumbnail
Current topology optimization of Reissner-Mindlin plates faces dual challenges: the inaccuracy of global stress aggregation in capturing peak stresses and the numerical instability caused by shear locking. This study proposes a rigorous framework that bypasses stress aggregation by enforcing local stress constraints directly via an Augmented Lagrangian (AL) method. To ensure physical fidelity across varying plate thicknesses, we introduce a locking-free polygonal finite element formulation. This approach constructs an assumed shear strain field along element edges, effectively eliminating locking phenomena without relying on reduced integration. The optimization scheme further integrates a vanishing constraint treatment to resolve singularity in low-density regions, with sensitivities computed efficiently via adjoint analysis. Numerical benchmarks demonstrate that the proposed method delivers superior accuracy in peak stress control and robust convergence for both thin and thick plates, offering a scalable solution for stress-critical engineering designs.
Show more
Read Article PDF
Cite
Research Article Open Access
A gentle introduction to approximation fork-core/coreness: a mathematically-oriented survey of algorithms and error bounds
The survey presents an overview of several algorithms associated with the approximation ofk-core decomposition, and this survey aims to serve as a gentle introduction for students majoring in mathematics to gain an understanding of hypergraph. Due to their unique mathematical structure, hypergraphs have become good modeling tools for capturing multi-way relationships in sophisticated systems. Mathematical techniques play an important role in thek-core approximation by offering theoretical foundations and guaranty. Many of them are utilized —– such as probabilistic bounds, structural constraints, inequations, and invariants —– in order to design scalable and stable approximation algorithms. This survey reviews three recent algorithms, each of them representing various mathematical thought and different methodological paradigms, including parallel, stream computation, and dynamic approximation. In addition, the survey highlights that algorithms can still be improved and it is meaningful to find a deeper understanding of the stability and limiting behaviors ofk-core structures.
Show more
Read Article PDF
Cite