SearcharxivSearch

arXiv · 2311.06259

Assessing the Dissipative Capacity of Particle Impact Dampers Based on their Nonlinear Bandwidth Characteristics

Abstract

The dissipative capacity as quantified by the nonlinear bandwidth measure of impulsively loaded primary structures (PSs) coupled to particle impact dampers (PIDs) is assessed. The considered PIDs are designed by initially placing different numbers of spherical, linearly viscoelastic granules at different 2D initial topologies and clearances. The strongly nonlinear and highly discontinuous dynamics of the PIDs are simulated via the discrete element method taking Hertzian interactions, slipping friction and granular rotations into account. The general definition of nonlinear bandwidth is used to evaluate the energy dissipation capacity of the integrated PS-PID systems. Moreover, the effect of the dynamics of the PIDs on the time-bandwidth product of these systems is studied, as a measure of their capacity to store or dissipate vibration energy. It is found that the initial topologies of the granules in the PID drastically affect the time-bandwidth product, which, depending on shock intensity, may break the classical limit of unity which holds for linear time-invariant dissipative resonators. The optimal PS-PID systems composed of multiple granules produce large nonlinear bandwidths, indicating strong dissipative capacity of broadband input energy by the PIDs. Additionally, in the optimal configurations, the time-bandwidth product, i.e., the measure of the frequency bandwidth of the input shock that is stored in the PS-PID system, in tandem with the amount of time it takes for the system to dissipate (1/e) of the initial energy, can be tuned either above or below unity by varying the applied shock intensity. The implications of these findings on the dissipative capacity of the system considered are discussed, showing that it can be predictively assessed so that PIDs can act as highly effective nonlinear energy sinks capable of rapid and efficient suppression of vibration induced by shocks.

Explore related subjects

Keep this discovery

BibTeXRIS

Xiang Li, Alireza Mojahed, Li-Qun Chen, Lawrence A. Bergman, Alexander F. Vakakis. 2023-09-25. Assessing the Dissipative Capacity of Particle Impact Dampers Based on their Nonlinear Bandwidth Characteristics. https://arxiv.org/abs/2311.06259

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

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC