Search NASA⌕ Search

DOE OSTI · 22769393

Boundary node Petrov–Galerkin method in solid structures

Abstract

Based on the interpolation of the Lagrange series and the Finite Block Method (FBM), the formulations of the Boundary Node Petrov–Galerkin Method (BNPGM) are presented in the weak form in this paper and their applications are demonstrated to the elasticity of functionally graded materials, subjected to static and dynamic loads. By introducing the mapping technique, a block of quadratic type is transformed from the Cartesian coordinate to the normalized coordinate with 8 seeds for two-dimensional problems. The first-order partial differential matrices of boundary nodes are obtained in terms of the nodal values of the boundary node, which can be utilized to determine the tractions on the boundary. Time-dependent partial differential equations are analyzed in the Laplace transformed domain and the Durbin’s inversion method is applied to determine the physical values in the time domain. Illustrative numerical examples are given and comparison has been made with the analytical solutions, the Boundary Element Method (BEM) and the Finite Element Method (FEM).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dou, F. F., Korakianitis, T., Shi, C.. 2018-03-15. Boundary node Petrov–Galerkin method in solid structures. https://doi.org/10.1007/s40314-016-0335-7

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

KEEP EXPLORING

Related reports

TANTE: Time-adaptive operator learning via neural Taylor expansion

Operator learning for time-dependent partial differential equations (PDEs) has seen rapid progress in recent years, enabling efficient approximation of complex spatiotemporal dynamics. However, most existing methods rely on fixed time step sizes during rollout, which limits their ability to adapt to varying temporal complexity and often leads to error accumulation. In this work, we propose the Time-Adaptive Transformer with Neural Taylor Expansion (TANTE), a novel operator-learning framework that produces continuous-time predictions with adaptive step sizes. TANTE predicts future states by performing a Taylor expansion at the current state, where neural networks learn both the higher-order temporal derivatives and the local radius of convergence. This allows the model to dynamically adjust its rollout based on the local behavior of the solution, thereby reducing cumulative error and improving computational efficiency. We demonstrate the effectiveness of TANTE across a wide range of PDE benchmarks, achieving superior accuracy and adaptability compared to fixed-step baselines, delivering accuracy gains of 60-80 % and speed-ups of 30-40 % at inference time.

97 MATHEMATICS AND COMPUTING↗

Structured illumination for surface-resolved grazing-incidence X-ray scattering

Grazing-incidence (GI) scattering techniques are widely used to characterize thin films, offering high surface sensitivity and insight into morphology and structure. However, these approaches typically provide statistical averaged information due to elongated footprint or limited spatial resolution due to beam size. Here we introduce a method that combines structured illumination with GI X-ray scattering and leverages our computational imaging approach to resolve local structural details. We demonstrate that our method captures local features of an organic semiconductor thin film without the need for sample rotation as in tomography. The method expands GI techniques from statistical averaging to high-resolution imaging, thereby providing the capability for detailed analysis of local material properties, such as domain shape, orientation and polymorphism, which are critical for advancing material design towards more efficient and tailored materials.

97 MATHEMATICS AND COMPUTING↗