Papers › Implicit bulk-surface filtering method for node-based shape optimization and...
Implicit bulk-surface filtering method for node-based shape optimization and comparison of explicit and implicit filtering techniques
Reza Najian Asl, Kai-Uwe Bletzinger
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This work studies shape filtering techniques, namely the convolution-based (explicit) and the PDE-based (implicit), and introduces an implicit bulk-surface filtering method to control the boundary smoothness and preserve the internal mesh quality simultaneously in the course of bulk (solid) shape optimization. To that end, volumetric mesh is filtered by the solution of pseudo-solid governing equations which are stiffened by the mesh-Jacobian and endowed with the Robin boundary condition which involves the Laplace-Beltrami operator on the mesh boundaries. Its superior performance from the non-simultaneous (sequential) treatment of boundary and internal meshes is demonstrated for the shape optimization of a complex solid structure. Well-established explicit filters, namely Gaussian and linear, and the Helmholtz/Sobolev-based (implicit) filter are critically examined in terms of consistency (rigid-body-movement production), geometric characteristics and the computational cost. It is shown that the implicit filtering is numerically more efficient and unconditionally consistent, compared to the explicit one. Supported by numerical experiments, a regularized Green's function is introduced as an equivalent explicit form of the Helmholtz/Sobolev filter. Furthermore, we give special attention to derive mesh-independent filtered sensitivities for node-based shape optimization with non-uniform meshes. It is shown that the mesh independent filtering can be achieved by scaling discrete sensitivities with the inverse of the mesh mass matrix.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections