Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2502.11529

Axial Behaviour of Pre-Damaged RC Short Columns Retrofitted with Square Corrugated Steel Jackets

Ligui Yang·Fan Yang·Yuyin Wang·Shuangshuang Jin·Yong Fang·Yunwen Chen·Qilong Xia
View original source ↗Read source document ↗Export metadata ↓

Abstract

This study proposes a strengthening method employing square corrugated steel jackets as external confinement, which significantly enhances both the bearing capacity and ductility of existing reinforced concrete (RC) columns. Axial compression tests were conducted on ten short column specimens to evaluate the effects of corrugated steel thickness (1.6, 2.0, and 2.7 mm), preloading level before jacketing (40%, 60%, and 100% of the original capacity), and connection type (welding vs. bolting). A computational model was developed to predict the ultimate bearing capacity of the strengthened sections. The main findings are as follows: (1) The corrugated steel jackets increased the ultimate bearing capacity of the existing RC columns by 34.6% to 67.3%. (2) Given the relatively low confinement efficiency in square sections, thinner corrugated steel plates can be used in a material-efficient manner to achieve comparable strengthening effects. (3) Fully welded connections between corrugated plates induce less stress concentration and provide better transverse confinement effectiveness compared to bolted connections. (4) In a pre-unloaded column, greater existed damage causes concrete softening and increased lateral expansion under re-compression. This dilation promotes a tighter interaction between the core concrete and the outer jacket, activating stronger passive confinement after being jacketed. (5) The low longitudinal stresses in the jacket indicate that its primary role is to provide lateral confinement rather than to resist axial loads directly. (6) It is recommended to employ a calculation method that accounts for both pre-damage and confinement effects to ensure a conservative and reliable design of corrugated steel-jacketed RC columns with pre-damage.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ligui Yang, Fan Yang, Yuyin Wang, Shuangshuang Jin, Yong Fang, Yunwen Chen, Qilong Xia. 2025-09-04. Axial Behaviour of Pre-Damaged RC Short Columns Retrofitted with Square Corrugated Steel Jackets. https://arxiv.org/abs/2502.11529

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↗