arXiv subjects

Àdel Alsalti-Baldellou

Publications and source records attributed to Àdel Alsalti-Baldellou.

5 recordsLinked to original sources

arXiv2026

On the Reynolds-number scaling of Poisson solver complexity

We aim to answer the following question: is the complexity of numerically solving the Poisson equation increasing or decreasing for very large simulations of incompressible flows? Physical and numerical arguments are combined to derive power-law scalings at very high Reynolds numbers. A theoretical convergence analysis for both Jacobi and multigrid solvers defines a two-dimensional phase space divided into two regions depending on whether the number of solver iterations tends to decrease or increase with the Reynolds number. Numerical results indicate that, for Navier-Stokes turbulence, the complexity decreases with increasing Reynolds number, whereas for the one-dimensional Burgers equation it follows the opposite trend. The proposed theoretical framework thus provides a unified perspective on how solver convergence scales with the Reynolds number and offers valuable guidance for the development of next-generation preconditioning and multigrid strategies for extreme-scale simulations.

physics.flu-dyn↗

arXiv2026

Exploiting repeated matrix block structures for more efficient CFD on modern supercomputers

Computational Fluid Dynamics (CFD) simulations are often constrained by the memory-bound nature of sparse matrix-vector operations, which eventually limits performance on modern high-performance computing (HPC) systems. This work introduces a novel approach to increase arithmetic intensity in CFD by leveraging repeated matrix block structures. The method transforms the conventional sparse matrix-vector product (SpMV) into a sparse matrix-matrix product (SpMM), enabling simultaneous processing of multiple right-hand sides. This shifts the computation towards a more compute-bound regime by reusing matrix coefficients. Additionally, an inline mesh-refinement strategy is proposed: simulations initially run on a coarse mesh to establish a statistically steady flow, then refine to the target mesh. This reduces the wall-clock time to reach transition, leading to faster convergence with equivalent computational cost. The methodology is evaluated using theoretical performance bounds and validated through three test cases: a turbulent channel flow, Rayleigh-Bénard convection, and an industrial airfoil simulation. Results demonstrate substantial speed-ups - from modest improvements in basic configurations to over 50% in the mesh-refinement setup - highlighting the benefits of integrating SpMM across all CFD operators, including divergence, gradient, and Laplacian.

physics.flu-dyn↗

arXiv2025

An efficient eigenvalue bounding method: CFL condition revisited

Direct and large-eddy simulations of turbulence are often solved using explicit temporal schemes. However, this imposes very small time-steps because the eigenvalues of the (linearized) dynamical system, re-scaled by the time-step, must lie inside the stability region. In practice, fast and accurate estimations of the spectral radii of both the discrete convective and diffusive terms are therefore needed. This is virtually always done using the so-called CFL condition. On the other hand, the large heterogeneity and complexity of modern supercomputing systems are nowadays hindering the efficient cross-platform portability of CFD codes. In this regard, our leitmotiv reads: relying on a minimal set of (algebraic) kernels is crucial for code portability and maintenance! In this context, this work focuses on the computation of eigenbounds for the above-mentioned convective and diffusive matrices which are needed to determine the time-step à la CFL. To do so, a new inexpensive method, that does not require to re-construct these time-dependent matrices, is proposed and tested. It just relies on a sparse-matrix vector product where only vectors change on time. Hence, both implementation in existing codes and cross-platform portability are straightforward. The effectiveness and robustness of the method are demonstrated for different test cases on both structured Cartesian and unstructured meshes. Finally, the method is combined with a self-adaptive temporal scheme, leading to significantly larger time-steps compared with other more conventional CFL-based approaches.

physics.flu-dyn↗

arXiv2025

Quantifying the checkerboard problem to reduce numerical dissipation

This work provides a comprehensive exploration of various methods in solving incompressible flows using a projection method, and their relation to the occurrence and management of checkerboard oscillations. It employs an algebraic symmetry-preserving framework, clarifying the derivation and implementation of discrete operators while also addressing the associated numerical errors. The lack of a proper definition for the checkerboard problem is addressed by proposing a physics-based coefficient. This coefficient, rooted in the disparity between the compact- and wide-stencil Laplacian operators, is able to quantify oscillatory solution fields with a physics-based, global, normalised, non-dimensional value. The influence of mesh and time-step refinement on the occurrence of checkerboarding is highlighted. Therefore, single measurements using this coefficient should be considered with caution, as the value presents little use without any context and can either suggest mesh refinement or use of a different solver. In addition, an example is given on how to employ this coefficient, by establishing a negative feedback between the level of checkerboarding and the inclusion of a pressure predictor, to dynamically balance the checkerboarding and numerical dissipation. This method is tested for laminar and turbulent flows, demonstrating its capabilities in obtaining this dynamical balance, without requiring user input. The method is able to achieve low numerical dissipation in absence of oscillations or diminish oscillation on skew meshes, while it shows minimal loss in accuracy for a turbulent test case. Despite its advantages, the method exhibits a slight decrease in the second-order relation between time-step size and pressure error, suggesting that other feedback mechanisms could be of interest.

physics.flu-dyn↗

arXiv2024

A multigrid reduction framework for domains with symmetries

Divergence constraints are present in the governing equations of numerous physical phenomena, and they usually lead to a Poisson equation whose solution represents a bottleneck in many simulation codes. Algebraic Multigrid (AMG) is arguably the most powerful preconditioner for Poisson's equation, and its effectiveness results from the complementary roles played by the smoother, responsible for damping high-frequency error components, and the coarse-grid correction, which in turn reduces low-frequency modes. This work presents several strategies to make AMG more compute-intensive by leveraging reflection, translational and rotational symmetries. AMGR, our final proposal, does not require boundary conditions to be symmetric, therefore applying to a broad range of academic and industrial configurations. It is based on a multigrid reduction framework that introduces an aggressive coarsening to the multigrid hierarchy, reducing the memory footprint, setup and application costs of the top-level smoother. While preserving AMG's excellent convergence, AMGR allows replacing the standard sparse matrix-vector product with the more compute-intensive sparse matrix-matrix product, yielding significant accelerations. Numerical experiments on industrial CFD applications demonstrated up to 70% speed-ups when solving Poisson's equation with AMGR instead of AMG. Additionally, strong and weak scalability analyses revealed no significant degradation.

math.NA↗