2016
DOI: 10.1177/1077546315573919
|View full text |Cite
|
Sign up to set email alerts
|

Local coordinate systems-based method to analyze high-order modes of n-step Timoshenko beam

Abstract: High-frequency transverse vibration of stepped beams has attracted increasing attention in various industrial areas. For an n-step Timoshenko beam, the governing differential equations of transverse vibration have been well established in the literature on the basis of assembling classic Timoshenko beam equations for uniform beam segments. However, solving the governing differential equation has not been resolved well to date, manifested by a computational bottleneck: only the first k modes (k 12) are solvable… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 46 publications
0
4
0
Order By: Relevance
“…However, while performing the Gaussian elimination, it is necessary to perform column pivoting since otherwise the Gaussian elimination may not be stable [24]. Assume that after column pivoting the linear system reads B ã = 0, (21) and that we have a bijective permutation map σ from the set {1, 2, 3, 4} onto itself such that ãi = a σ(i) where i ∈ {1, 2, 3, 4}; and Bi,j = B i,σ(j) where j ∈ {1, 2, 3, 4}. (22) Note that the map σ is invertible, i.e., we can write ãσ −1 (i) = a i and Bi,σ −1 (j) = B i,j .…”
Section: Solution Strategy For the Eigenvalue Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…However, while performing the Gaussian elimination, it is necessary to perform column pivoting since otherwise the Gaussian elimination may not be stable [24]. Assume that after column pivoting the linear system reads B ã = 0, (21) and that we have a bijective permutation map σ from the set {1, 2, 3, 4} onto itself such that ãi = a σ(i) where i ∈ {1, 2, 3, 4}; and Bi,j = B i,σ(j) where j ∈ {1, 2, 3, 4}. (22) Note that the map σ is invertible, i.e., we can write ãσ −1 (i) = a i and Bi,σ −1 (j) = B i,j .…”
Section: Solution Strategy For the Eigenvalue Problemmentioning
confidence: 99%
“…The issue of numerical stability of modes is even more prominent for stepped beams, both Euler-Bernoulli and Timoshenko, where fewer than 10 modes can be predicted reliably [20,21]. Xu et al [20] and Cao et al [21] have mitigated the issue by defining a set of local coordinates that decrease the growth rate of the hyperbolic sine and cosine terms in Euler-Bernoulli and Timoshenko beams, respectively. However, their approach does not solve the core problem and numerical stabilities continue to be a problem in their formulation.…”
Section: Introductionmentioning
confidence: 99%
“…Solving Equation (39) produces a sequence of natural frequencies [ 69 ]; provided with , the corresponding coefficient vector can be derived from Equation (38); substituting and into Equation (34a), the m -th mode shape can be obtained.…”
Section: Proof Of Conceptmentioning
confidence: 99%
“…Xu et al. (2014) and Cao et al. (2017) solved the bottlenecks in analytically evaluating high-order modes of stepped beams by introducing local coordinate systems to depict stepped beams.…”
Section: Introductionmentioning
confidence: 99%