Life-cycle assessment for flutter probability of a long-span suspension bridge based on field monitoring data

Xiaolei Chu; Hung Nguyen Sinh; Wei Cui; Lin Zhao; Yaojun Ge

Home/Archive/arXiv

arXiv · 2106.10694

Life-cycle assessment for flutter probability of a long-span suspension bridge based on field monitoring data

Xiaolei Chu·Hung Nguyen Sinh·Wei Cui·Lin Zhao·Yaojun Ge

View original source ↗Read source document ↗Export metadata ↓

Abstract

Assessment of structural safety status is of paramount importance for existing bridges, where accurate evaluation of flutter probability is essential for long-span bridges. In current engineering practice, at the design stage, flutter critical wind speed is usually estimated by the wind tunnel test, which is sensitive to modal frequencies and damping ratios. After construction, structural properties of existing structures will change with time due to various factors, such as structural deteriorations and periodic environments. The structural dynamic properties, such as modal frequencies and damping ratios, cannot be considered as the same values as the initial ones, and the deteriorations should be included when estimating the life-cycle flutter probability. This paper proposes an evaluation framework to assess the life-cycle flutter probability of long-span bridges considering the deteriorations of structural properties, based on field monitoring data. The Bayesian approach is employed for modal identification of a suspension bridge with the main span of 1650 m, and the field monitoring data during 2010-2015 is analyzed to determine the deterioration functions of modal frequencies and damping ratios, as well as their inter-seasonal fluctuations. According to the historical trend, the long-term structural properties can be predicted, and the probability distributions of flutter critical wind speed for each year in the long term are calculated. Consequently, the life-cycle flutter probability is estimated, based on the predicted modal frequencies and damping ratios.

Explore related subjects

stat.CO stat.AP

Keep this discovery

BibTeX RIS

Xiaolei Chu, Hung Nguyen Sinh, Wei Cui, Lin Zhao, Yaojun Ge. 2021-06-20. Life-cycle assessment for flutter probability of a long-span suspension bridge based on field monitoring data. https://arxiv.org/abs/2106.10694

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

KEEP EXPLORING

Related papers

arXiv2026

Extended One-Liners for the Gamma, Poisson, and Binomial Distributions

We demonstrate explicit transformations of three independent uniforms with exact Gamma$(a,1)$, $a>0$, Poisson$(\lambda)$, $\lambda>0$, and Binomial$(N,p)$, $N\geq 1$, $0\leq p \leq 1$ laws using only elementary operations.

stat.CO↗

arXiv2026

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO↗

arXiv2026

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO↗