The effective and precise combination of computational fluid dynamics (CFD) and computational solid mechanics (CSM) routines is integral to fluid–structure interaction (FSI). Aerodynamic components such as wings, flaps, rudders and stabilizers are characterized by lightweight and flexible structures. Their mechanical behavior and the dynamics of the fluid flow that grazes over them mutually affect each other. Frequently, the flexibility of the structures involved is such that this reciprocal interplay significantly alters the situation from what it would be if the structure were assumed to be rigid. From a scientific and technical perspective, there are numerous examples falling into this category, including wind turbines [
1], textile roofs [
2], parachutes [
3] and both the static and transient [
4] dynamics of airplane wings, to name just a few. Examining an aerodynamic component thoroughly requires a comprehensive analysis of the interaction between the two fundamental physics. For instance, if the structural evaluation is conducted statically, the component must be considered in its equilibrium state, accounting for its deformed shape and the corresponding fluid flow. This integration is generally obtained by resorting to one of two main approaches [
5]: the tight approach involves the writing of a unique large system of both fluid dynamics and structural mechanics equations whose solution simultaneously updates variables pertaining to the two physics; the loose coupling approach adopts separate solvers for CFD and CSM problems, and boundary conditions are updated iteratively until convergence. Both approaches possess advantages and disadvantages. The tight approach necessitates greater computational resources and expertise, rendering it less prevalent compared to the alternative strategy. Often, it is implemented using in-house codes developed by the user. However, it offers the simultaneous handling of both physics, resulting in faster and more stable convergence [
6]. Conversely, the loose coupling method [
7] utilizes pre-existing, well-established software to independently solve the two problems. Nevertheless, this approach may encounter convergence difficulties and demands robust and precise data transfer between the associated modules. This data transfer constitutes a significant drawback of the loose method. Typically, CFD and CSM numerical grids do not align, as meshing practices differ between the two domains. Pressures, extracted at the centers of CFD cells, need to be mapped onto CSM nodes and converted to forces. As this process iterates multiple times before convergence, any errors introduced during this data shift are likely to accumulate, potentially leading to solutions deviating significantly from the correct one. Mapping algorithms for surface meshes can be broadly divided into two categories: weighted-residual methods and interpolation methods [
8]. Weighted-residual methods involve computing a residual over the problem domain using test functions and setting it equal to zero. The nature of this residual can vary; if it is computed from the pressure fields, the method is known as mortar. This can be standard mortar if the test functions are the common shape functions [
9,
10] or dual mortar if dual shape functions are used [
11]. Area-weighted averaging is suitable for cell-centered data [
12,
13,
14,
15], where the test functions exhibit a stepwise behavior from inside to outside a cell. The reaction-force method [
16,
17] is a mapping method based on a static analysis, using a common discretization between source and target meshes. In this case, the underlying weak formulation is that at the base of FEM itself. Interpolation techniques use polynomials or mathematical series based on the spatial proximity between source and target points. Nearest-neighbor interpolation [
18], nearest element interpolation [
19], polynomial interpolation [
20] and radial basis function interpolation fall into this category. A vast body of literature exists on mapping methods, with notable and comprehensive reviews provided by Smith et al. [
21], Franke [
22] and others.
The focus of this paper is to compare two data mapping strategies within the context of CFD-CSM data exchange. Both approaches utilize radial basis functions (RBFs) as a crucial component of their algorithms. The first method, introduced in [
23], is referred to as the RIBES method, as it was developed to address a key aspect of the RIBES EU research project. RIBES stands for Radial basis functions at fluid Interface Boundaries to Envelope flow results for advanced Structural analysis. Initiated in December 2014 and concluded in December 2016, the project aimed to enhance the methodologies employed in aircraft design. The second method is that included in the preCICE open-source coupling library. PreCICE stands for Precise Code Interaction Coupling Environment [
24]; it enables multi-code coupling of existing software for many types of numerical simulations. In the current release of preCICE, the available data mapping methods are limited to those that operate in a black-box manner on point clouds (such as nearest-neighbor mapping and RBF interpolation) or require minimal additional information (like nearest-projection mapping). The present work focuses on the method employing RBF interpolation.
The comparison parameters encompass the criteria for defining a robust and high-quality mapping method. These include load conservation, where force and moment resultants should remain unchanged before and after mapping, with associated vectors aligning in magnitude and direction. Additionally, flexibility is essential, requiring the method to seamlessly handle transfer problems between fine and coarse meshes without requiring ad hoc adjustments. Lastly, performance metrics such as computational time and memory usage must remain within reasonable limits. Comparison benchmarks are the catenoid, introduced in [
8] and addressed also in [
23], and a straight 1.6 m wide wing, with a root chord of 600 mm and 0.7 as the taper ratio, employed in the wind tunnel experimental campaign within the RIBES project [
25,
26]. As regards the latter, fluid results from CFD analyses are mapped onto the structural mesh to conduct stress assessments. Finally, another desired requirement for a well-conceived mapping method is the ability to potentially interface with any FEM/CFD solver. In this regard, the tests are conducted using commercial and open-source solvers.
RBF Interpolation
Radial basis functions (RBFs) constitute a central focus in approximation theory [
27], which deals with the challenge of approximating complex and usually unknown functions using simpler functions derived from incomplete and scattered data. RBFs stand out as particularly attractive among various interpolating mathematical tools because they enable the generation of an analytical interpolator capable of exactly reproducing specified values at known points in a smooth manner. A unique RBF series can, in fact, manage a substantial quantity of points providing a seamless interpolation devoid of the instability and oscillations commonly associated with high-degree polynomials. This eliminates the necessity for employing specific patterns of point placement or resorting to piecewise interpolation methods, as well as the requirement for organizing points into structured grids. Below, we provide an overview of the mathematical foundation and the terminology related to the RBF problem, without aiming to cover every detail comprehensively. For those interested, we suggest referring to the literature available on both aspects: the purely mathematical [
28] and the more practically oriented [
29] perspective.
The formulation of an interpolation problem begins with a collection of points
in an N-dimensional space, referred to as source points. Each point is linked to a specific field value, whether scalar or vectorial. The sought interpolator
provides the field value at any target point
within the N-dimensional space, returning the original value if the target location coincides with a source point. The interpolating function
above addressed is a collection of radial bases
:
where the summation extends to the number
of introduced source points.
Table 1 lists several of the most common radial bases (or kernels), where
and ϵ serves as a shape parameter [
30], introduced to accommodate the average grid spacing. In the case of the generalized multiquadratic (GMQ) kernel, the values of
and
are determined by the user and need to be adjusted according to the specific characteristics of the problem at hand.
provides a scalar value because each radial basis
is contingent upon the Euclidean distance between points. In case a vectorial field should be reproduced, Equation (1) applies independently to each scalar component of the field. The weights
appearing in Equation (1) are determined by imposing the interpolation condition, ensuring that the interpolator precisely reproduces the original values at the source points. In a vector-matrix representation:
Here,
represents the matrix comprising the radial bases calculated individually for each source point as the target,
is the vector containing the given values and
represents the vector of unknown weights. To accommodate the representation of a polynomial function
, whose degree varies according to the selected kernel [
30], it can be incorporated into the series outlined in Equation (1). This inclusion introduces formal complexities into the system described in Equation (2), as additional orthogonality conditions are required to handle the augmented set of unknowns, which now also include the coefficients of the polynomial. Further mathematical consequences pertaining to this extension can be explored in the specialized literature. The method just described is the simplest way of performing an RBF interpolation. However, as is evident, large numbers of nodes lead to large matrices that need to be inverted. Partition of unity techniques [
31] can divide a single interpolation problem into several smaller problems that partially overlap, resulting in a consistent reduction in computational running time. It is hardly necessary to observe that RBF interpolation finds wide application in many fields, and it would be extremely belittling not to acknowledge their successful adoption out of a plain interpolation context: from neural networks [
32] to computer graphics (surface reconstruction [
33]); from mesh morphing [
34,
35] to image analysis of deformations [
36,
37]; strain retrieval in non-linear mechanics [
38]; and association with reduced order models [
39]. RBF mesh morphing has been employed for several applications, from evolutionary optimizations [
40] to advanced modelling [
41]. RBFs also proved to be a valuable tool to enhance FEM accuracy [
42] and, as basis for collocation methods, led to very accurate results for stress retrieval in composite laminates [
43].