Certified reduced-basis analysis of parametrized laminated plates by an affine finite element–polyharmonic splines-radial basis function-finite differences hybrid method

Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas · Springer Nature · 2026-11-05 · DOI: 10.1007/s10665-026-10562-y

Аннотация

A new formulation is presented for the certified reduced-basis (RB) analysis of parametrized laminated composite plates by a finite element/polyharmonic spline-radial basis function-finite difference (FEM/PHS-RBF-FD) hybrid method. The full-order (“truth”) model is first-order shear deformation theory. The mid-surface is meshed with Q9 quadrilateral elements, but the Lagrange interpolation is replaced inside each element by PHS-RBF cardinal functions built from $$r^{5}$$ plus complete quadratic polynomials on the element node set, which keeps standard finite-element assembly and boundary handling while removing the RBF shape parameter. The plies are grouped by orientation and each group g carries a scalar stiffness multiplier $$\mu _g$$, so the truth stiffness is exactly affine in the parameter, $${\varvec{K}}({\varvec{\mu }})=\sum _{g=1}^{G}\mu _g\,{\varvec{K}}_g$$, with symmetric positive semidefinite, precomputable components. This affine structure is exploited by a weak-greedy reduced-basis method with full offline–online decomposition and a rigorous a posteriori error bound: because every $${\varvec{K}}_g\succeq 0$$ and the energy inner product is chosen at the reference parameter, the min-$$\theta $$ coercivity lower bound is available in closed form and the dual norm of the residual is evaluated online from precomputed Gram matrices. The method is assessed on simply supported and clamped plates with cross-ply and angle-ply stacking sequences. A locking study shows that full integration of the shear term is adequate for $$a/h\le 100$$ but locks for very thin plates ($$a/h\gtrsim 10^{3}$$), where a $$2\times 2$$ rule for the shear term is needed. The online stage is two to four orders of magnitude faster than a truth solve.

Читать у издателя →

Похожие статьи