Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2206.07410

A hybrid meshing framework adapted to the topography to simulate Atmospheric Boundary Layer flows

Abel Gargallo-Peiró·Matias Avila·Arnau Folch
View original source ↗Read source document ↗Export metadata ↓

Abstract

A new topography adapted mesh generation process tailored to simulate Atmospheric Boundary Layer (ABL) flows on complex terrains is presented. The mesher is fully automatic given: the maximum and minimum surface mesh size, the size of the first element of the boundary layer, the maximum size in the boundary layer and the size at the top of the domain. The following contributions to the meshing workflow for ABL flow simulation are performed. First, we present a smooth topography modeling to query first and second order geometry derivatives. Second, we propose a new adaptive meshing procedure to discretize the topography based on two different metrics. Third, the ABL mesher is presented, featuring both prisms and tetrahedra. We extrude the triangles of the adapted surface mesh, generating prisms that reproduce the Surface Boundary Layer. Then, the rest of the domain is meshed with an unstructured tetrahedral mesh. In addition, for both the surface and volume meshers we detail a hybrid quality optimization approach, analyzing its impact on the solver for high-complexity terrains. We analyze the convergence of the triangle adaptive approach, obtaining quadratic convergence to the geometry and reducing to one half the error for the same amount of degrees of freedom than without adaptivity and optimization. We also study the mesh convergence of our RANS solver, obtaining quadratic mesh convergence to the solution, and using a 30% of the degrees of freedom while reducing a 20% of the error of standard semi-structured approaches. Finally, we present the generated meshes and the simulation results for a complete complex topographic scenario.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Abel Gargallo-Peiró, Matias Avila, Arnau Folch. 2022-06-15. A hybrid meshing framework adapted to the topography to simulate Atmospheric Boundary Layer flows. https://doi.org/10.1016/j.cad.2021.103168

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

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗
arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗
arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗