Abstract
Symbolic Regression (SR) offers an interpretable alternative to conventional Machine-Learning (ML) approaches, which are often criticized as “black boxes”. In contrast to standard regression models that require a prescribed functional form, SR constructs expressions from a user-defined set of mathematical primitives, enabling the automated discovery of compact formulas that fit the data and reveal underlying physical relationships. In fluid mechanics, where understanding the underlying physics is as crucial as predictive accuracy, this study applies SR to model three-dimensional (3D) laminar flow in a rectangular channel, focusing on the axial velocity and pressure fields. Compact symbolic equations were derived from numerical simulation data, accurately reproducing the expected parabolic velocity profile and linear pressure drop, and showing excellent agreement with analytical solutions from the literature. To address the limitation that purely data-driven SR models may overlook domain-specific constraints, an innovative hybrid framework that integrates SR with Answer Set Programming (ASP) is also introduced. This integration combines the generative power of SR with the declarative reasoning capabilities of ASP, ensuring that derived equations remain both statistically accurate and physically plausible. The proposed SR/ASP methodology demonstrates the potential of combining data-driven and knowledge-representation approaches to enhance interpretability, reliability, and alignment with physical principles in fluid dynamics and related domains.
Keywords: Symbolic regression, Answer set programming, Knowledge representation, Fluid mechanics, Interpretability, Data-driven, Symbolic artificial intelligence
Subject terms: Engineering, Mathematics and computing, Physics
Introduction
Fluid mechanics is essential to many fields, from engineering and environmental science to medical research. However, the complexity of fluid behaviour, especially in turbulent or multiphase systems, makes it challenging to model and understand. Traditional methods, including Computational Fluid Dynamics (CFD), have been highly effective and physically transparent, yet often incur substantial computational cost. On the other hand, modern Machine-Learning (ML) approaches range from interpretable methods to more opaque models such as Artificial Neural Networks. Although ML surrogates are often used in fluid mechanics primarily for computational efficiency, many commonly adopted models still behave as “black boxes”, offering limited physical interpretability—an important limitation in applications where understanding the underlying flow physics is as important as prediction quality.
Against this background, research increasingly turns to data-driven methods for new solutions, and approaches that combine accuracy with clear, understandable models. Symbolic Regression (SR) stands out in this space. Unlike typical ML models that operate as “black boxes”, SR identifies mathematical expressions that describe relationships in the data. Rather than relying on a fixed predefined functional form, SR searches over combinations of user-specified mathematical primitives, enabling it to reveal or confirm physically meaningful relationships in fluid mechanics1. This feature is invaluable for researchers and engineers who need models that are not just predictive, but also provide insight into the underlying physics.
Despite the interpretability of SR and its successful use in a plethora of domains2–6, the application of evolutionary algorithm-based SR in fluid mechanics remains relatively limited. In what follows, we briefly review representative studies that apply SR within fluid-mechanics contexts.
Schmidt and Lipson’s seminal study showed that symbolic methods can automatically distill free-form natural laws (including Hamiltonians/Lagrangians) directly from experimental time series by targeting non-trivial invariants, foreshadowing later physics-aware SR workflows4. Praks and Brkić7 illustrated SR’s potential by approximating the Colebrook equation for turbulent friction factors, refining initial models through fixed-point iterations to enhance accuracy with low computational cost. Extending SR to particle-fluid interactions, El Hasadi and Padding8 proposed new drag correlations for ellipsoidal and spherocylindrical particles, while Milošević et al.9 unified laminar and turbulent friction models via data-driven symbolic formulations. Sofos et al.10 applied SR to define a Lennard-Jones fluid descriptor, and Roland et al.11 used it to model viscous dissipation in polymer extrusion, reducing reliance on costly simulations. For Lennard-Jones fluids, Angelis et al.12 developed closed-form expressions for viscosity and thermal conductivity spanning dilute to dense regimes, while Alam et al.13 predicted self-diffusion with interpretable and accurate SR models. In turbulence, Wu and Zhang14 enhanced the shear-stress-transport (SST) turbulence model with SR-derived correction terms that generalized across 3D flows, and Chakrabarty and Yakovenko15 improved Reynolds-averaged Navier-Stokes (RANS) closures through compact symbolic stress approximations.
Parallel to evolutionary SR, sparse-regression approaches such as SINDy formalize model discovery as selecting a parsimonious set of terms from rich function libraries, enabling scalability to fluid systems and robustness to noise16; the PySINDy package operationalizes these ideas with practical tooling and constraint options17. In this vein, Reinbold et al.18 demonstrated the effectiveness of physics-aware sparse regression in experimental settings by reconstructing external force fields from noisy, high-dimensional measurements, illustrating how library-based SR can integrate prior physics to yield interpretable and reliable models. Complementarily, dimensionless-learning frameworks enforce dimensional invariance to recover compact, scale-free variables and their associated scaling relations —along with dimensionally homogeneous differential equations— from scarce, noisy experiments, providing a principled route to interpretable, scale-aware models19.
In this article, we investigate the use of SR as an interpretable, data-driven tool for modelling a fundamental laminar fluid-flow problem. Our approach establishes a novel and robust benchmark for interpretable ML models in viscous fluid motion within confined geometries. Instead of prescribing a specific functional form, our SR framework successfully derives explicit expressions for the (axial) velocity and pressure fields in three-dimensional (3D) channels as functions of spatial coordinates and the Reynolds number. As demonstrated, the derived symbolic expressions closely match the corresponding numerical solutions, reproducing the expected physical behaviour and aligning with established analytical trends. These results suggest that the SR-based expressions offer an interpretable and computationally efficient representation of the underlying flow physics, while remaining consistent with high-fidelity numerical predictions.
While, as we show, SR excels in its generative capabilities, it operates within a purely data-driven manner, potentially overlooking intricate domain-specific constraints and logical relationships inherent to physical systems. This limitation can lead to the selection of models that, despite their statistical accuracy, may violate fundamental physical laws or, in general, domain-specific constraints. To address these challenges, we propose an exploratory integration of SR with the knowledge-representation framework of Answer Set Programming (ASP)20–22. ASP constitutes a declarative-programming paradigm that allows the specification of complex problems and constraints in a high-level (symbolic) language. By blending data-driven and symbolic Artificial Intelligence (AI), the resulting conceptual hybrid SR/ASP framework ensures that the SR-generated symbolic expressions are not only statistically accurate, but also physically plausible, adhering to domain-specific constraints and principles, encoded into ASP (see Fig. 1). This integration offers a promising direction for building versatile and trustworthy AI systems, capitalizing on the complementary strengths of learning from data and reasoning with knowledge23. It is worth emphasizing that, while ASP has been extensively applied across a wide range of domains24,25, the integration of ASP with SR represents, to the best of our knowledge, the first effort to combine these two powerful frameworks.
Fig. 1.
Integrated SR and ASP work-flow. SR generates candidate accurate symbolic expressions from fluid-mechanics raw data. Then, ASP applies domain-specific constraints to filter and select expressions that are both accurate and physically valid.
On the whole, the present study highlights two major contributions: First, the ability of SR to translate intricate flow dynamics into simple, interpretable equations that effectively balance precision and clarity; and second, the significant role of knowledge-representation techniques in improving the reliability and domain-specific validity of data-driven SR models. These developments open new avenues for incorporating hybrid (data-driven and symbolic) methodologies into efficient computational systems, particularly in high-stakes fluid-dynamics scenarios where the integration of detailed, explainable simulations with real-time, data-driven insights is crucial.
The remainder of the article is organized as follows: The subsequent section (section Mathematical formulation of the fluid-flow problem) sets out the mathematical formulation of the fluid-flow problems under investigation. Thereafter, section The symbolic-regression models introduces the architecture and parameters of the developed SR models. Section Results and discussion is dedicated to the presentation and discussion of the results of the SR models. Section Symbolic Regression Enhanced with Answer Set Programming presents the alluded hybrid SR/ASP approach. The article closes with a concluding section that summarizes the overall contribution and discusses interesting avenues for future research.
Mathematical formulation of the fluid-flow problem
The governing equations describing (time-independent) fluid flow in three spatial dimensions, without external forces, are the Navier-Stokes equations,
![]() |
1 |
complemented by the conservation of mass equation,
, where
are the dimensional velocity components and
is the dimensional fluid pressure. Additionally,
is the fluid density and
is the dynamic fluid viscosity26. To derive the non-dimensional form of the governing equations, the following non-dimensional parameters are introduced:
![]() |
2 |
where h represents the characteristic height27.
By substituting the parameters defined in Equation (2) into the dimensional Navier-Stokes equations (Equation (1)), the governing equations are recast in non-dimensional form. Applying the chain rule, in conjunction with the conservation of mass equation, yields the following closed-form expressions for the non-dimensional governing equations:
![]() |
3 |
It should be noted that applying the non-dimensional parameters of Equation (2) leads to non-dimensional equations that do not explicitly include non-dimensional groups, such as the Reynolds number
. In the present setting, the flow is instead driven by a prescribed constant streamwise pressure gradient c, which plays the role of the primary control parameter. A corresponding Reynolds number will be introduced later in this section as a convenient, equivalent parametrization of the operating condition.
The Finite Volume Method (FVM) is employed to discretize Equations (3) and the conservation of mass equation. The FVM discretizes the computational domain into smaller, finite control volumes, called cells28. By integrating the governing equations over these control volumes, the system of non-linear partial differential equations is transformed into a larger system of non-linear algebraic equations, subject to corresponding boundary conditions. This transformation allows the equations to be solved using methods for non-linear systems, such as Newton’s method. Additionally, the FVM evaluates equations at each cell centroid, enabling the implementation of various boundary conditions29.
The algebraic system obtained by the FVM discretization can be written in the form
![]() |
4 |
Here,
,
, and
denote the grid spacing in each coordinate direction, respectively. The velocity components
,
,
, and the pressure
are evaluated at the control-volume faces
and at the cell center
. Additional details regarding the grid structure and control-volume arrangement can be found in the works30–32.
The numerical solution of the system of Equation (4) is obtained using an in-house code implemented in MATLAB. The resulting algebraic system is solved on a collocated grid, using Newton’s method combined with trust-region techniques. The solver settings include a structured grid of
control volumes, resulting in
degrees of freedom (four unknowns
per control volume). Convergence is declared when the Euclidean norm of the residual vector falls below
.
By assuming that the velocity components
and
are identically zero throughout the flow, Equations (3) simplify significantly. In particular, one obtains
, implying a linear pressure drop along the channel length, and
![]() |
which yields a velocity profile
that depends on the imposed pressure gradient
. This profile
is numerically evaluated for various values of
, and is subsequently used as the inlet axial-velocity distribution.
The discrete system of Equation (4) is complemented by the following boundary conditions:
![]() |
5 |
These conditions imply that the axial velocity component
follows the inlet profile
, while the transverse components
and
are identically zero at the inlet. A constant streamwise pressure gradient
is imposed at the channel inlet. At the outlet, homogeneous Neumann boundary conditions are applied to all velocity components, whereas the pressure is fixed to zero. Along the channel walls, no-slip boundary conditions are enforced for the velocity components, and homogeneous Neumann boundary conditions are used for the pressure.
In the present study, the fluid-mechanics problem under consideration is the fluid flow in a three-dimensional, symmetrical rectangular duct, with dimensions
. A visual representation of the geometry of the problem is shown in Fig. 2. Note that the characteristic length h appearing in the identities of Equation (2) is assumed to be the height of the duct H; i.e.,
. It is also noteworthy that, although the geometry of the problem appears relatively simple, deriving a corresponding analytical solution can be challenging. For example, Kakaç et al.33, Chapter 3 present an analytical solution expressed as an infinite series, underscoring the complexity of the problem, while also providing approximations that reduce computational costs.
Fig. 2.
Geometry of the three-dimensional symmetrical rectangular duct. The computational domain spans
. The duct height H is used as the characteristic length scale.
To address the studied problem, numerical data were generated to train and test the Symbolic-Regression models by varying the driving pressure gradient. Specifically, a constant streamwise pressure gradient ranging from
to
, with a step size of
, was applied to the Poisson equation
, resulting in distinct fully developed inlet velocity profiles. The duct dimensions are specified as
and
, and the fluid properties are kept fixed throughout.
As previously mentioned, the non-dimensional parameters of Equation (2) yield governing equations that do not explicitly include the Reynolds number. In this work, the flow regime is therefore most naturally indexed by the imposed pressure gradient c. For convenience of interpretation, we additionally compute an effective Reynolds number
a posteriori from the numerical solution u via
![]() |
following Tzirtzilakis and colleagues27. For a fixed geometry and fluid, the laminar regime considered here ensures a one-to-one, monotonic relationship between the imposed pressure gradient c, the characteristic velocity, and the corresponding Reynolds number. Thus,
functions as a case-level control parameter, equivalent to having prescribed
directly for each simulation. It is therefore not a per-sample function of the target field, but a global descriptor of the flow regime that labels each simulation (i.e., each value of c).
The resulting training dataset includes the velocity components u, v, w, and the pressure p within the 3D channel for operating conditions characterized by
, while the testing dataset comprises the same quantities for
. Consequently, the SR models are evaluated under interpolation scenarios with respect to this scalar control parameter. It is noted that the forthcoming analysis excludes the velocity components v and w, as their magnitudes remain negligible and approach zero throughout the channel, as indicated by the numerical solutions.
The symbolic-regression models
Symbolic Regression (SR) is a powerful computational technique used to uncover interpretable mathematical relationships that govern data dynamics. Unlike traditional regression methods that rely on a fixed, predefined functional form, SR explores a flexible search space constructed from user-specified mathematical primitives to derive models that are both accurate and interpretable. This flexibility makes SR particularly suited for domains where the underlying physical relationships are unknown or complex.
SR is typically implemented using evolutionary algorithms, which draw inspiration from biological processes like natural selection and genetic mutation34. These algorithms treat mathematical expressions as individuals within a population, and evolve them over successive generations to optimize their performance against a fitness criterion, such as minimizing prediction error. The process begins with the generation of an initial population of random mathematical expressions, composed of variables, constants, and operators. Each of these expressions is then evaluated for fitness, based on how accurately it approximates the observed data using predefined metrics like Mean Squared Error or custom loss functions. The population is subsequently evolved by introducing variation through operations such as mutation, which randomly alters parts of an expression, and crossover, which combines segments from two parent expressions to produce new candidates. Finally, a selection and refinement step retains the most accurate and interpretable expressions, gradually improving the population across generations. This biologically inspired work-flow enables SR to efficiently explore a vast space of candidate mathematical relationships, striking a balance between predictive accuracy and interpretability. The outcome is a set of concise, human-readable equations that capture the underlying dynamics of the system being modelled.
For implementing SR in the present study, the PySR tool (version 0.19.4) was employed. PySR is a powerful SR library written in Python and Julia, leveraging techniques such as regularized evolution, simulated annealing, and gradient-free optimization35. In the remainder of this section, we detail the design and implementation of the SR models, highlighting their configuration and providing the rationale behind each methodological choice.
To begin with, two distinct SR models were developed: One specifically designed to predict the axial velocity u, and the other to model the pressure p within the 3D channel. In constructing these models, interpretability was encouraged by restricting the maximum allowed expression complexity, and by selecting a domain-motivated set of primitive mathematical operators (e.g., arithmetic operations and low-order polynomial functions). These primitive operators also constrain the search space, thereby preserving computational tractability.
More specifically, the models were trained for 1000 iterations. This setting was supported by trial runs using markedly larger iteration budgets, which indicated that the resulting expressions and error metrics remained effectively unchanged. Core arithmetic operations, such as addition, subtraction, multiplication, and division, formed the basis for constructing expressions. To capture more complex relationships, non-linear operators, including square and cube functions, were also incorporated as “building blocks”. This choice is motivated by fluid-mechanics principles, which indicate that laminar fluid-flow solutions frequently exhibit polynomial-like behaviour — allowing velocity and pressure profiles to be well-approximated by low-order polynomials, as will be further discussed in Subsection Literature’s analytical equations, where we examine relevant analytical equations from the literature. It should be stressed that restricting the operator set in a domain-informed manner is standard practice in SR. For example, in the seminal PySR paper, Cranmer notes that “empirical relations are frequently comprised of operators which are unique to one particular field of science, so the equation search strategy must allow for custom operators”35, p. 3, underscoring the importance of incorporating domain-specific, user-defined operators within PySR.
To enhance the simplicity and utility of the resulting equations, a number of constraints were introduced. The complexity of expressions —expressed by the total count of mathematical operations and terms within each equation— was limited by setting a maximum size (25), ensuring they remained interpretable. Additionally, nested constraints were applied to prevent unnecessary combinations of higher-order functions, such as squaring a squared term. This helped reduce redundancy and promoted concise mathematical representations. Reproducibility was ensured by explicitly configuring PySR in deterministic mode, using a fixed
and disabling parallelism so that repeated runs yield identical results.
As outlined in section Mathematical formulation of the fluid-flow problem, the training and testing datasets comprise the spatial coordinates (x, y, z) together with the Reynolds number (
) as input variables, while the corresponding outputs are the axial velocity (u) and the pressure (p). Here,
plays the role of a scalar control parameter that indexes the operating condition of each simulation (through the imposed pressure gradient), since all samples originating from the same numerical run share a single
value. The SR models therefore learn a parametric mapping of the form
and
across different flow regimes, rather than a self-referential dependence of u on its own pointwise values. For clarity, the upper-case variables X, Y, Z appearing in the forthcoming SR equations denote the same non-dimensional coordinates as x, y, z used in the mathematical formulation of the fluid-flow problem. A summary of the key parameters and settings employed by the PySR tool is provided in Table 1.
Table 1.
Key parameters of the PySR tool used for the development of the two SR models.
| Parameter | Value | Description |
|---|---|---|
| niterations | 1000 | Number of training iterations |
| binary_operators | + , − , , / |
Core arithmetic operations |
| unary_operators | square(x) = x² , cube(x) = x³ | Low-order polynomials as building blocks |
| maxsize | 25 | Limits expression complexity |
| nested_constraints | True | Restricts nested square and/or cube operators |
| variable_names |
X , Y , Z ,
|
Names of input variables x , y , z ,
|
During the training process, the SR models iteratively refine their mathematical expressions, striving to minimize the prediction error quantified by a loss function (fitness criterion). PySR uses Mean Squared Error (MSE) as its default loss function to evaluate the performance of candidate equations, adhering to predefined configurations, as outlined in Table 1. For a target quantity
, the MSE is defined as
, where
is the number of data points,
represents the reference (actual) value of the
-th data point, and
denotes the SR-predicted value for the
-th data point.
Upon completing the training process, PySR produces a collection of candidate models that form the Pareto front35. In multi-objective optimization, the Pareto front is the set of all Pareto-efficient solutions, namely, the set of solutions that cannot be improved in any one objective without degrading at least one of the other objectives36. In our context, the Pareto front represents the optimal trade-off between simplicity (model complexity) and accuracy (error metrics such as MSE or MAE). Formally, a model belongs to the Pareto front if and only if no other model achieves both a lower complexity and a lower error. Hence, models on the Pareto front are characterized by their best balance between interpretability and predictive accuracy, ensuring robustness and minimizing the risk of overfitting.
Results and discussion
Having discussed the architecture of our SR models, we turn to the presentation of the derived results concerning the axial velocity u and the pressure p of the channel.
The equations derived from the SR models are assessed using three primary error metrics: Mean Squared Error (MSE), Mean Absolute Error (MAE), and Normalized Mean Absolute Error (NMAE). The MSE, introduced in Section The symbolic-regression models, serves as the default loss function (fitness criterion) employed by PySR to evaluate candidate expressions. Meanwhile, focusing on the prediction of a target quantity
, MAE and NMAE are defined as
and
, where
is the total number of data points,
is the reference (actual) value of the i-th data point,
is the SR-predicted value for the i-th data point, and
,
are the maximum and minimum reference values of y, respectively.
Symbolic equations
Against this background, two symbolic equations derived from the implemented SR models are presented below. Selected automatically from the Pareto front of their respective models using the built-in PySR model-selection criterion (model_selection=”best”), these expressions reflect a balance between predictive accuracy and expression complexity rather than minimum loss alone, thereby constituting robust and interpretable candidates for further exploration and analysis. The computation time required for an SR model to generate the full set of Pareto-front equations is approximately 15 minutes on a system equipped with a 13th-generation Intel® Core™ i7–13700 processor (2.10 GHz) and
GB of RAM.
![]() |
6 |
![]() |
7 |
Equation (6) defines the axial velocity
within the channel as a function of the Reynolds number
and the spatial variables
and
. The expression incorporates quadratic dependencies on both
and
, with coefficients that capture the influence of
on the velocity distribution. The quadratic terms establish a parabolic velocity profile, consistent with the expected flow characteristics in such a configuration. The pressure field
is represented symbolically in Equation (7) as a function of the Reynolds number
and the spatial variable
. This equation reveals a negative linear relationship between
and
, where the coefficients are scaled by
. The negative correlation between
and
highlights a linear pressure drop across the channel, a common feature in laminar flow systems.
Table 2 provides a detailed comparison of the symbolic expressions, highlighting both their complexity and performance on the training and testing datasets. The performance is evaluated using the error metrics MSE, MAE, and NMAE, quantifying the accuracy of the symbolic models for the axial velocity (
) and the pressure field (
), with results reported separately for the training and testing datasets. As already stated, the complexity of each equation, shown in the second column of Table 2, reflects the total count of mathematical operations and terms within each expression. A higher complexity value suggests a more intricate equation, which often results from the need to capture detailed relationships in the data.
Table 2.
For
(Equation (6)), with a complexity of 17, the model achieves a low NMAE of
on the training dataset and
on the testing dataset. These results demonstrate a highly accurate fit, with slightly better performance observed during training. The pressure field,
(Equation (7)), has a notably lower complexity of 9 but achieves remarkable precision. The MSE values for both the training and testing datasets are in the order of
, while the NMAE is consistently in the range of
. This demonstrates that the symbolic model for
not only captures the underlying trend but does so with minimal error, even for unseen data.
Overall, the results highlight the balance between complexity and accuracy achieved by the SR approach. The models effectively generalize from the training data to the testing data, with minimal loss in accuracy, showcasing their robustness and suitability for modelling fluid velocity and pressure within the channel. The consistent performance across the training and testing datasets suggests that overfitting was effectively mitigated, reinforcing the reliability of the approach.
Representative plots
The low error metrics presented in Table 2 are further substantiated by the exceptional alignment observed in the fitted identity plots for Equations (6) and (7), which compare the predictions of the SR models against the reference numerical results, as illustrated in Fig. 3.
Fig. 3.
Identity plots for Equations (6) and (7) of the SR models. The red
line represents a perfect match between the symbolic equation derived from an SR model and the numerical results.
Furthermore, Fig. 4 depicts the 3D contour-maps of the axial velocity u within the channel, alongside its 2D profile at a representative vertical cross-section of the channel, for indicative Reynolds numbers of the testing dataset. Depicted are the predicted quantities as generated by the SR model, and the reference quantities as generated by the numerical solutions. Along similar lines, Fig. 5 depicts the 3D contour-maps of the pressure p within the channel, for indicative Reynolds numbers of the testing dataset. Depicted are the predicted quantities as generated by the SR model, and the reference quantities as generated by the numerical solutions.
Fig. 4.

3D contour-maps of the axial velocity u within the channel, alongside its 2D profile at a representative vertical cross-section of the channel, for indicative Reynolds numbers of the testing dataset. Depicted are the predicted quantities as generated by the SR model, and the reference quantities as generated by the numerical solutions.
Fig. 5.
3D contour-maps of the pressure p within the channel, for indicative Reynolds numbers of the testing dataset. Depicted are the predicted quantities as generated by the SR model, and the reference quantities as generated by the numerical solutions.
Evidently, the SR models demonstrate exceptional accuracy and interpretability, not only in capturing the flow’s axial velocity field, but also in representing its pressure distribution. For the axial velocity u, the derived equation produces nearly indistinguishable results from the reference numerical solution across the tested Reynolds numbers. The predicted flow fields preserve the quintessential parabolic profile, smoothly peaking at the channel’s centerline and tapering off near the boundary walls in accordance with the no-slip boundary conditions. This fidelity to fundamental physical behaviour is quantified by exceedingly low NMAEs, consistently at the order of a few thousandths of a percent. Such negligible discrepancies underscore the model’s remarkable capability to generalize beyond the training dataset and its promise for reducing reliance on high-fidelity, computationally expensive simulations. The SR model developed for the pressure provides an equally compelling representation of the pressure field. The retrieved symbolic expression accurately captures the expected linear pressure gradient along the channel’s longitudinal direction, a hallmark feature of laminar, fully developed flow. The minimal residual errors in pressure predictions, as reflected by the near-vanishing error metrics, attest to the robustness of the model and its ability to encode fundamental fluid-dynamic principles in a compact functional form.
Literature’s analytical equations
Following the presentation of the concrete results obtained from the SR models, we now delve into analytical equations from the literature relevant to laminar fluid flows in 3D channels. A foundational example is the exit velocity profile of an incompressible fluid flowing steadily through a rectangular duct, as illustrated in Fig. 2 of Sect. Mathematical formulation of the fluid-flow problem. This profile is described approximately by the equation
![]() |
8 |
where
is the axial velocity at any point within the cross-section,
is the maximum velocity at the center of the duct,
is the height of the duct in the
-direction,
is the width of the duct in the
-direction, and
,
are the coordinates in the cross-sectional plane37, p. 198, Problem P3.18. (For exact solutions of fully developed velocity profiles in flows through rectangular ducts, the reader is referred to the work of Kakaç et al.33.) In the context of our study, where the duct dimensions are defined as
(section Mathematical formulation of the fluid-flow problem), Equation (8) simplifies to
![]() |
9 |
The above expression highlights the parabolic velocity profile commonly observed in laminar flows through ducts, with
at the center and the velocity decreasing symmetrically toward the walls, due to the no-slip boundary conditions.
Building on this foundation, the conducted numerical simulation suggests a direct relationship between the Reynolds number
and the maximum axial velocity at the centerline of the channel
, given by
![]() |
10 |
By combining Equations (6) and (10), we obtain the following symbolic representation for the velocity profile:
![]() |
11 |
Evidently, the forms of Equations (9) and (11) are strikingly similar. The symbolic representation in Equation (11), derived from the corresponding SR model, provides an excellent approximation to the analytical solution from the literature, namely Equation (9). The small remaining discrepancy may be due both to the approximate nature of Equation (9) and to the finite spatial resolution of the numerical dataset used to generate the SR training data. As the present problem is steady, temporal discretization does not arise, and the relevant numerical-resolution issue is therefore the spatial one. Quantifying its effect more precisely would require a systematic grid-refinement study, which is left for future work. Similarly, the symbolic representation of the pressure field in Equation (7), derived from the corresponding SR model, aligns closely with the general form of pressure distributions reported in the literature, according to which the pressure drops linearly across the length of the channel37,38. This close agreement underscores the ability of the developed SR models to capture the fundamental characteristics of the velocity and pressure fields with high fidelity, reinforcing their potential as powerful tools for both theoretical studies and real-world engineering applications.
Robustness analysis
Although our primary analysis relies on the deterministic dataset generated by the numerical simulation, in this subsection we additionally assess the robustness of the proposed approach by injecting controlled levels of synthetic noise into the existing data and retraining the SR models. To this end, we perturbed the target fields by applying independent pointwise random perturbations, while leaving all input variables unchanged. Specifically, each target value was multiplied by a random factor chosen uniformly within
of its original value, thereby producing noisy versions of the fields with controlled relative perturbations.
Accordingly, two symbolic equations derived from the Pareto front of the noise-augmented SR models are presented below.
![]() |
12 |
![]() |
13 |
Both Equations (12) and (13) remain very close to their noise-free counterparts (Equations (6) and (7), respectively), demonstrating strong robustness to perturbations in the data. This is further confirmed by the corresponding MSE, MAE, and NMAE values on both the training and testing datasets, which exhibit only minor deviations from the deterministic case (cf. Table 2).
It should be stated that the presence of noise generally makes SR model selection more challenging, as it perturbs the fitness values of competing expressions and may broaden the Pareto front. In the present case, however, the effect of the imposed
noise remained limited, as the SR procedure recovered the same qualitative forms as in the noise-free setting, with only minor coefficient changes. This supports the robustness of the proposed methodology in both predictive accuracy and equation discovery.
Lastly, we verified that the overall accuracy and stability of the SR models were preserved when the SR operator set was expanded to include trigonometric and exponential functions (cf. Table 1). Even within these richer search spaces, the SR procedure consistently converged to polynomial-type expressions, indicating that the discovered relationships are not an artefact of a restricted operator set, but are consistent with the underlying flow physics.
Symbolic Regression Enhanced with Answer Set Programming
As already made clear, SR has gained prominence as a robust methodology for discovering mathematical relationships within complex datasets, without presupposing a specific model structure. While SR excels in its generative capabilities, it often operates within a purely data-driven paradigm, potentially overlooking intricate domain-specific constraints and logical relationships inherent to physical systems. This limitation can lead to the selection of models that, despite their statistical accuracy, may violate fundamental physical laws or lack interpretability within the context of established scientific theories. To address these challenges, we propose an integration of SR with Answer Set Programming (ASP) — a form of declarative programming oriented towards difficult combinatorial search problems20–22. This innovative hybrid approach seamlessly merges data-driven and symbolic Artificial Intelligence into a unified framework, combining the generative power of SR with the declarative reasoning strengths of ASP, which not only enhances model selection, but also ensures adherence to physical principles (refer to Fig. 1 of Introduction). It is important to highlight that, although both ASP and SR have been extensively studied independently, our proposal represents, to the best of our knowledge, the first attempt to integrate these two powerful frameworks.
Answer set programming
ASP constitutes a knowledge-representation paradigm that allows the specification of complex problems and constraints in a high-level, declarative language. Unlike imperative approaches, ASP focuses on describing what the solution should satisfy rather than how to discover it20–22. ASP operates by defining a logic program, namely, rules and facts that describe the problem domain, allowing an ASP solver to compute stable models, also known as answer sets — i.e., consistent sets of literals (atomic formulae or their negation) that satisfy all given constraints. This capability makes ASP particularly suitable for tasks that require intricate constraint satisfaction, logical inference, and combinatorial optimization24,25.
Methodology
The integration of ASP with SR involves a systematic work-flow that leverages the strengths of both methodologies. Initially, SR tools like PySR are employed to explore the space of possible mathematical models that fit the fluid-mechanics data. This process yields a diverse set of candidate equations, each characterized by attributes such as complexity, loss (an error metric), and functional form. However, the raw output from SR often includes models that may not comply with domain-specific constraints essential for physical validity.
To imbue the SR-generated models with domain-specific intelligence, the next step involves preprocessing and feature extraction. This can be accomplished using scripting languages like Python, where the symbolic forms of the candidate equations are parsed to extract relevant features. Features of interest may include the presence of specific terms (e.g.,
), functional properties (such as monotonicity or asymptotic behaviour), and dimensional attributes ensuring dimensional consistency. These extracted features are then represented as facts in an ASP-compatible format, effectively translating the symbolic information into a form that ASP can process.
Subsequently, an ASP program can be developed to encapsulate the desired constraints and domain-specific knowledge. These constraints can range from simple exclusions or inclusion of certain terms to more complex rules enforcing physical laws such as conservation of mass and momentum. For instance, the ASP program can include rules that prevent the selection of equations containing non-physical terms (e.g.,
), enforce the selection of equations containing essential parameters like the Reynolds number (
), or ensure that selected models adhere to dimensional homogeneity. Additionally, ASP’s optimization capabilities can be harnessed to balance multiple objectives, such as minimizing both model complexity and prediction error while ensuring compliance with physical constraints.
An ASP solver, such as Clasp, is then employed to process (the propositional form of) the ASP program, alongside the preprocessed facts derived from the SR output. Clasp is a widely used, off-the-shelf ASP solver that incorporates state-of-the-art techniques from Boolean constraint solving39. The solver evaluates the rules and constraints, identifying stable models that represent valid selections of equations adhering to all specified criteria. These stable models effectively filter out non-compliant equations, retaining only those that are both data-accurate and physically meaningful. The (physically) validated models can then be utilized for further analysis, simulations, or as components of more comprehensive fluid-mechanics theories.
A concrete example
To demonstrate the practical integration of the proposed SR/ASP hybrid approach, we present a concrete example based on the equations derived by the SR model tailored to the axial velocity u of the flow (see section Results and discussion). Recall that these equations are all part of the Pareto front of the SR procedure, meaning that each one retains an optimal balance of accuracy and simplicity. The presented example illustrates how SR-generated symbolic expressions can be effectively filtered and validated using ASP to ensure their physical plausibility and adherence to domain-specific constraints. As will be shown, the methodology is highly versatile, allowing for the incorporation of numerous constraints or adaptation to other domains.
First, Table 3 reports all the (14) equations of the Pareto front, identified by the alluded SR model. Each equation varies in complexity and loss (MSE), representing different levels of fit and intricacy in capturing the underlying physical phenomena. Note that the equation corresponding to
is Equation (6) of section Results and discussion.
Table 3.
The equations of the Pareto front, identified by the SR model tailored to the axial velocity u of the flow. Observe that the complexity of equations remains up to 25, as constrained by the corresponding limitation outlined in Table 1 of section The symbolic-regression models.
| ID | Complexity | Loss | SR Equation for the Axial Velocity u |
|---|---|---|---|
| 0 | 1 | 37396.16 | X |
| 1 | 2 | 31757.25 | ![]() |
| 2 | 3 | 13316.42 | ![]() |
| 3 | 5 | 13316.14 | ![]() |
| 4 | 6 | 10670.45 | ![]() |
| 5 | 8 | 9246.47 | ![]() |
| 6 | 10 | 7431.94 | ![]() |
| 7 | 13 | 7417.14 | ![]() |
| 8 | 15 | 3620.02 | ![]() |
![]() |
![]() |
44.98 | ![]() |
| 10 | 20 | 25.31 | ![]() |
| 11 | 22 | 25.07 | ![]() |
| 12 | 24 | 25.02 | ![]() |
| 13 | 25 | 22.96 | ![]() |
While the symbolic expressions of Table 3 achieve an optimal balance between accuracy and simplicity, they do not necessarily adhere to physical laws and/or domain-specific constraints. To ensure such an adherence, ASP will be employed as a filtering mechanism that enforces the desired constraints. To that end, the SR output is, first, translated into ASP-compatible facts. Additionally, the presence of specific terms that may violate physical constraints, such as non-physical exponents or the inclusion of essential parameters like the Reynolds number (
) can be identified. Such an ASP encoding is, indicatively, presented subsequently for the equations corresponding to
and
of Table 3. Note that, as ASP cannot process real numbers, the loss values have been rounded to the nearest integers for compatibility. For a comprehensive discussion of ASP’s syntax and semantics, the interested reader is referred to the Potassco guide40.
In the above code snippet, the predicate eq/4 represents an SR equation in the form eq(ID, Complexity, Loss, ”Expression”), where the four arguments encapsulate essential information about the equation. The first argument, ID, uniquely identifies the equation within the dataset, allowing for efficient referencing and filtering. The second argument, Complexity, denotes the complexity of the equation. The third argument, Loss, specifies the MSE of the equation when evaluated against the dataset. Finally, the fourth argument, ”Expression”, is a string representation of the symbolic equation itself. An indicative fact that complements an equation is expressed via the predicate contains_re(7), which states that the equation corresponding to
includes the Reynolds number (
).
Thereafter, we can impose constraints such as maximum allowable complexity and loss, exclusion of non-physical terms (e.g.,
,
,
), and the requirement that selected models incorporate essential physical parameters like the Reynolds number (
). Such requirements can be represented in an ASP format as follows:
Upon formulating the ASP program, the Clasp ASP solver is employed to process the program, and identify stable models (answer sets) that satisfy all the imposed constraints, evaluating each candidate equation against the eligibility criteria and exclusion constraints. After executing the ASP solver, we derive the following selected/filtered equations in approximately 0.1 seconds — notably, the first equation corresponds to Equation (6) of section Results and discussion.
Evidently, the expressions appearing in the list of “SELECTED EQUATIONS” strike an ideal trade-off between accuracy and simplicity (as they are part of the Pareto front of the SR procedure) and, at the same time, they are physically valid (as they adhere to the imposed domain-specific constraints of ASP).
The computation time required by the Clasp ASP solver to generate stable models in our representative example is indeed negligible — approximately 0.1 seconds, which is significantly less than the computation time (around 15 minutes) required by the SR model to derive the equations of the Pareto front (see section Results and discussion). Nevertheless, in more complex fluid-flow problems and geometries, the sheer volume of potential SR equations and the nature of domain-specific constraints can significantly enlarge the search space for stable models and, by extension, increase computational overhead. To mitigate these concerns, one can exploit incremental solving strategies (where constraints are added iteratively), utilize domain-decomposition techniques to tackle sub-problems in parallel, or take advantage of advanced ASP features, such as heuristic-guided optimization, which can substantially narrow the search space22. These practices can allow the introduced framework to remain viable in larger, more intricate fluid-mechanics scenarios, while keeping computation times in check.
More expressive physical constraints
The constraints discussed so far are mostly “syntactic”, but ASP’s expressive language can also encode genuinely physical constraints. In this subsection, we present a representative collection of such constraints.
In this constraint, the predicate wall(P) marks each point P that lies on a duct wall (these points are defined in advance). The predicate val(u, EqID, P, V) provides the numerically evaluated value V of the candidate velocity equation EqID at point P. The comparison |V|> eps_u checks whether the magnitude of this value exceeds a small predefined tolerance eps_u, used to represent “effectively zero”. If all these conditions hold simultaneously, the candidate equation violates the no-slip boundary condition. Consequently, ASP eliminates any equation that produces a non-zero wall velocity, thereby ensuring that admissible symbolic expressions satisfy the requirement that the axial velocity vanishes at all wall locations.
In a rectangular duct, the velocity field is symmetric with respect to the mid-planes
and
. This symmetry implies that the transverse gradients of the axial velocity must vanish at these locations, that is,
![]() |
Accordingly, in the above constraint, the predicate center_y(P) (resp., center_z(P)) identifies every point P located on the symmetry plane
(resp.,
). The predicates dudy(EqID, P, G) and dudz(EqID, P, G) represent the evaluated transverse gradients
and
of the candidate velocity equation EqID at point P. The comparison |G|> eps_g checks whether the magnitude of these gradients exceeds a small tolerance eps_g. Whenever this occurs, the constraint is triggered and the candidate equation is eliminated. In this way, the ASP module filters out symbolic expressions that violate the geometric symmetry of the flow.
The geometry of the rectangular duct is symmetric with respect to the transverse coordinates
and
, and the corresponding laminar velocity field inherits this symmetry. As a consequence, physically admissible expressions for the axial velocity must depend only on even powers of
and
. In addition, in the considered laminar regime, the axial velocity scales linearly with the Reynolds number
, and thus non-linear powers of
are physically inconsistent. In the ASP rules above, the predicate has_term(EqID, y_pow(K)) (resp., z_pow(K)) indicates that the symbolic expression associated with the equation EqID contains a term proportional to
(resp.,
). The condition K #mod 2 == 1 (modulo operation) identifies odd exponents, which violate geometric symmetry. Similarly, the predicate has_term(EqID, re_pow(K)) detects terms involving powers of
, and the condition K != 1 filters out non-linear dependencies. Whenever any of these conditions hold, the corresponding constraint is triggered and the candidate equation is rejected. This ensures that the ASP module retains only symbolic expressions that respect the symmetry of the flow and the appropriate laminar scaling with the Reynolds number.
Final remarks
We conclude our discussion by noting that the proposed approach is sufficiently flexible to recover different analytical forms when applied to datasets reflecting other physical scenarios. For example, in the case of fluid flow in a cylindrical pipe, commonly referred to as Hagen–Poiseuille flow37, and using boundary conditions analogous to those adopted for the rectangular-duct case together with a comparable pressure gradient, an SR model developed for this configuration recovered the expected Cartesian form of the axial velocity field, namely the Hagen–Poiseuille profile, with quadratic dependence on the transverse coordinates through
and linear parametric scaling with the Reynolds number
. More specifically, the derived expression
![]() |
is equivalent, in terms of its functional form, to the known analytical parabolic profile
, where the constant C and the multiplicative coefficient depend on the specific flow parameters and determine the overall scale of the velocity field. This additional example further supports the view that, by adjusting the SR search space and tailoring the ASP constraints to the relevant boundary conditions and physical requirements, the framework can be naturally extended to alternative geometries, flow regimes, or governing equations without altering its core methodology.
Finally, we note that the SR/ASP hybrid framework can, to a certain extent, be paralleled with Physics-Informed Neural Networks (PINNs)41,42. These specialized Artificial Neural Networks embed physical laws directly into their learning process, producing models that are inherently consistent with the underlying physics of the application. Analogously, the SR/ASP hybrid approach capitalizes on domain knowledge to refine and validate the SR equations, thus achieving greater alignment with the physical principles governing a problem.
Conclusions
Recognizing that understanding flow physics is as crucial as accurate prediction, we presented a Symbolic-Regression (SR) approach for modelling laminar flow in a three-dimensional channel. Using Finite Volume Method (FVM)-generated simulation data and the PySR library, we derived interpretable equations for the velocity and pressure fields without prior assumptions on their functional forms.
The channel geometry featured a rectangular cross-section, with flow characterized by a parabolic velocity profile and linear pressure drop. SR successfully recovered these patterns, as the velocity equation showed quadratic dependence on the vertical (Y) and lateral (Z) coordinates, while the pressure model captured the expected linear decay along the longitudinal direction (X). Both models achieved excellent accuracy, with Normalized Mean Absolute Errors below
for velocity and
for pressure, closely matching analytical solutions.
While SR provides accurate, data-driven models, it can overlook domain-specific constraints. To address this, we introduced a hybrid framework that integrates Answer Set Programming (ASP) to enforce physical plausibility and domain rules. This ensures symbolic models remain both statistically robust and physically consistent.
The proposed SR/ASP methodology highlights the potential of combining data-driven and symbolic Artificial Intelligence for fluid dynamics, where interpretability and physical consistency are critical. Future work will extend the SR framework to more complex flows, examine the effect of spatial grid resolution on the recovered symbolic expressions, and explore the use of Chebyshev polynomials to further improve precision, while leveraging Large Language Models to help automate constraint generation for the ASP module.
Author contributions
T.A. conceived the study, developed the methodology, implemented the Symbolic-Regression (SR) models, integrated the Answer Set Programming (ASP) framework, performed the analysis, and wrote the manuscript. G.C. generated the numerical simulation data used for training and testing the SR models. M.F., M.X., and E.T. provided supervision, domain expertise, and critical feedback throughout the study. All authors reviewed and approved the final version of the manuscript.
Funding
This research was implemented in the framework of the Action “Flagship actions in interdisciplinary scientific fields with a special focus on the productive fabric”, which is implemented through the National Recovery and Resilience Fund Greece 2.0 and funded by the European Union–NextGenerationEU (Project ID: TAEDR-0535983).
Data availability
The datasets generated during the current study are available from the corresponding author on reasonable request.
Declarations
Competing interests
The authors declare no competing interests.
Ethical approval
No human participants or animals were involved.
Footnotes
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
References
- 1.Kronberger, G., Burlacu, B., Kommenda, M., Winkler, S. M. & Affenzeller, M. Symbolic Regression (CRC Press, 2024).
- 2.Makke, N. & Chawla, S. Interpretable scientific discovery with symbolic regression: A review. Artificial Intelligence Review 57 (2024).
- 3.Angelis, D., Sofos, F. & Karakasidis, T. E. Artificial intelligence in physical sciences: Symbolic regression trends and perspectives. Arch. Comput. Methods Eng.30, 3845–3865 (2023). [DOI] [PMC free article] [PubMed] [Google Scholar]
- 4.Schmidt, M. & Lipson, H. Distilling free-form natural laws from experimental data. Science324, 81–85 (2009). [DOI] [PubMed] [Google Scholar]
- 5.Udrescu, S.-M. & Tegmark, M. AI Feynman: A physics-inspired method for symbolic regression. Science Advances 6 (2020). [DOI] [PMC free article] [PubMed]
- 6.Kim, S. et al. Integration of neural network-based symbolic regression in deep learning for scientific discovery. IEEE Transactions on Neural Networks and Learning Systems 32 (2021). [DOI] [PubMed]
- 7.Praks, P. & Brkić, D. Symbolic regression-based genetic approximations of the Colebrook equation for flow friction. Water 10 (2018).
- 8.Hasadi, Y. M. F. E. & Padding, J. T. Solving fluid flow problems using semi-supervised symbolic regression on sparse data. AIP Advances 9 (2019).
- 9.Milošević, M., Brkić, D., Praks, P., Litričin, D. & Stajić, Z. Hydraulic losses in systems of conduits with flow from laminar to fully turbulent: A new symbolic regression formulation. Axioms 11 (2022).
- 10.Sofos, F., Charakopoulos, A., Papastamatiou, K. & Karakasidis, T. E. A combined clustering/symbolic regression framework for fluid property prediction. Physics of Fluids 34 (2022).
- 11.Roland, W., Marschik, C., Krieger, M., Löw-Baselli, B. & Miethlinger, J. Symbolic regression models for predicting viscous dissipation of three-dimensional non-Newtonian flows in single-screw extruders. J. Non-Newtonian Fluid Mech.268, 12–29 (2019). [Google Scholar]
- 12.Angelis, D., Sofos, F. & Karakasidis, T. E. Reassessing the transport properties of fluids: A symbolic regression approach. Physical Review E 109 (2024). [DOI] [PubMed]
- 13.Alam, T. M., Allers, J. P., Leverant, C. J. & Harvey, J. A. Symbolic regression development of empirical equations for diffusion in Lennard-Jones fluids. The Journal of Chemical Physics 157 (2022). [DOI] [PubMed]
- 14.Wu, C. & Zhang, Y. Enhancing the shear-stress-transport turbulence model with symbolic regression: A generalizable and interpretable data-driven approach. Physical Review Fluids 8 (2023).
- 15.Chakrabarty, A. & Yakovenko, S. N. Data-driven turbulence modelling using symbolic regression. Journal of Physics: Conference Series 2099 (2021).
- 16.Brunton, S. L., Proctor, J. L. & Kutz, J. N. Discovering governing equations from data by sparse identification of nonlinear dynamical systems. Proceedings of the National Academy of Sciences113, 3932–3937 (2016). [DOI] [PMC free article] [PubMed]
- 17.de Silva, B. M. et al. PySINDy: A Python package for the sparse identification of nonlinear dynamics from data. arXiv:2004.08424 (2020).
- 18.Reinbold, P. A. K., Kageorge, L. M., Schatz, M. F. & Grigoriev, R. O. Robust learning from noisy, incomplete, high-dimensional experimental data via physically constrained symbolic regression. Nature Communications 12 (2021). [DOI] [PMC free article] [PubMed]
- 19.Xie, X., Samaei, A., Guo, J., Liu, W. K. & Gan, Z. Data-driven discovery of dimensionless numbers and governing laws from scarce measurements. Nature Communications 13 (2022). [DOI] [PMC free article] [PubMed]
- 20.Lifschitz, V. Answer Set Programming (Springer, 2019).
- 21.Brewka, G., Eiter, T. & Truszczyński, M. Answer set programming at a glance. Commun. ACM54, 93–103 (2011). [Google Scholar]
- 22.Gebser, M., Kaminski, R., Kaufmann, B. & Schaub, T. Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning (Morgan & Claypool Publishers, 2012).
- 23.Platzer, A. Intersymbolic AI. In Margaria, T. & Steffen, B. (eds.) Leveraging Applications of Formal Methods, Verification and Validation. Software Engineering Methodologies, ISoLA 2024, 1070–1080 (Springer, 2024).
- 24.Erdem, E., Gelfond, M. & Leone, N. Applications of Answer Set Programming. AI Magazine37, 53–68 (2016). [Google Scholar]
- 25.Falkner, A., Friedrich, G., Schekotihin, K., Taupe, R. & Teppan, E. C. Industrial applications of Answer Set Programming. KI - Künstliche Intelligenz32, 165–176 (2018). [Google Scholar]
- 26.Munson, B. R., Rothmayer, A. P., Okiishi, T. H. & Huebsch, W. W. Fundamentals of Fluid Mechanics (Wiley, 2012), 7th edn.
- 27.Tzirtzilakis, E. E., Sakalis, V. D., Kafoussias, N. G. & Hatzikonstantinou, P. M. Biomagnetic fluid flow in a 3D rectangular duct. Int. J. Numer. Methods Fluids44, 1279–1298 (2004). [Google Scholar]
- 28.Mazumder, S. Numerical Methods for Partial Differential Equations: Finite Difference and Finite Volume Methods (Academic Press, 2016).
- 29.Moukalled, F., Mangani, L. & Darwish, M. The Finite Volume Method in Computational Fluid Dynamics: An Advanced Introduction with OpenFOAM® and MATLAB (Springer, 2016).
- 30.Chrimatopoulos, G., Tzirtzilakis, E. E. & Xenos, M. A. Magnetohydrodynamic and ferrohydrodynamic fluid flow using the finite volume method. Fluids9, 5 (2024). [Google Scholar]
- 31.Aravanis, T., Chrimatopoulos, G., Xenos, M. & Tzirtzilakis, E. E. Forecasting two-dimensional channel flow using Machine Learning. Physics of Fluids 36 (2024).
- 32.Katsoudas, S., Chrimatopoulos, G., Xenos, M. & Tzirtzilakis, E. A finite volume and Levenberg-Marquardt optimization framework for benchmarking MHD flows over backward-facing steps. Mathematics13, 2953 (2025). [Google Scholar]
- 33.Kakaç, S., Shah, R. K. & Aung, W. Handbook of Single-Phase Convective Heat Transfer (Wiley-Interscience, 1987).
- 34.Pétrowski, A. & Ben-Hamida, S. Evolutionary Algorithms (Wiley, 2017).
- 35.Cranmer, M. Interpretable machine learning for science with PySR and SymbolicRegression.jl. arXiv:2305.01582 (2023).
- 36.Wang, L., Ng, A. H. C. & Deb, K. Multi-Objective Evolutionary Optimisation for Product Design and Manufacturing (Springer, London, 2011). [Google Scholar]
- 37.White, F. M. Fluid Mechanics (McGraw Hill, 2011), 7th edn.
- 38.Pritchard, P. J. & Leylegian, J. C. Fox and McDonald’s Introduction to Fluid Mechanics (John Wiley & Sons, 2011), 8th edn.
- 39.Gebser, M., Kaufmann, B., Neumann, A. & Schaub, T. Clasp: A conflict-driven answer set solver. In Baral, C., Brewka, G. & Schlipf, J. (eds.) Logic Programming and Nonmonotonic Reasoning (LPNMR 2007), Lecture Notes in Computer Science, 260–265 (Springer, 2007).
- 40.Gebser, M. et al. Potassco User Guide 2nd edn. (Potassco, University of Potsdam, 2017). [Google Scholar]
- 41.Raissi, M., Perdikaris, P. & Karniadakis, G. E. Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations. J. Computational Phys.378, 686–707 (2019). [Google Scholar]
- 42.Cai, S., Mao, Z., Wang, Z., Yin, M. & Karniadakis, G. E. Physics-informed neural networks (PINNs) for fluid mechanics: A review. Acta Mech. Sin.37, 1727–1738 (2021). [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.
Data Availability Statement
The datasets generated during the current study are available from the corresponding author on reasonable request.
















































