Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2511.10129

Accelerating the Serviceability-Based Design of Reinforced Concrete Rail Bridges under Geometric Uncertainties induced by unforeseen events: A Surrogate Modeling approach

Mouhammed Achhab·Pierre Jehel·Fabrice Gatuingt
View original source ↗Read source document ↗Export metadata ↓

Abstract

Reinforced concrete rail bridges are essential components of railway infrastructure, where reliability, durability, and adaptability are key design priorities. However, the design process is often complicated by uncertainties stemming from unforeseen construction constraints, such as the need to reposition piers or alter geometric characteristics. These design adaptations can lead to repeated redesigns, added costs, and project delays if not anticipated in the early design stages, as well as significant computational overhead when using traditional finite element (FE) simulations. To address this and anticipate such unexpected events, this study adopts surrogate modeling as an efficient probabilistic design approach. This methodology integrates key geometric parameters as random variables, capturing the uncertainties that may arise during the design and construction phases and propagating them on the bridge's performance functions. By doing so, we aim to enable the efficient exploration of a large number of design scenarios with minimal reliance on time-consuming finite element (FE) simulations, represent the performance functions of a reinforced concrete bridge as a function of our variable design parameters, and classify the overall design scenarios into failure and safe scenarios In this study, a four-span reinforced concrete bridge deck is modeled using a multi-fiber finite element approach in Cast3M software. This FE model is used to generate the required design of experiments to train the surrogate models. Within this framework, a comparative performance assessment is conducted to evaluate the performance of the Kriging surrogate against alternative methods, including polynomial chaos expansion (implemented in UQLab) and support vector regression (SVR). This methodology supports early-stage uncertainty-informed design, enhancing the robustness and adaptability of reinforced concrete rail bridges in the face of practical constraints and changing site conditions.

Explore related subjects

math.NAcs.NAphysics.class-phphysics.data-an

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mouhammed Achhab, Pierre Jehel, Fabrice Gatuingt. 2025-11-13. Accelerating the Serviceability-Based Design of Reinforced Concrete Rail Bridges under Geometric Uncertainties induced by unforeseen events: A Surrogate Modeling approach. https://arxiv.org/abs/2511.10129

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↗