• 제목/요약/키워드: recursive formula

검색결과 66건 처리시간 0.028초

ELASTOKINEMATIC ANALYSIS OF A SUSPENSION SYSTEM WITH LINEAR RECURSIVE FORMULA

  • KANG J. S.
    • International Journal of Automotive Technology
    • /
    • 제6권4호
    • /
    • pp.375-381
    • /
    • 2005
  • This paper presents linear algebraic equations in the form of recursive formula to compute elastokinematic characteristics of a suspension system. Conventional methods of elastokinematic analysis are based on nonlinear kinematic constrant equations and force equilibrium equations for constrained mechanical systems, which require complicated and time-consuming implicit computing methods to obtain the solution. The proposed linearized elastokinematic equations in the form of recursive formula are derived based on the assumption that the displacements of elastokinematic behavior of a constrained mechanical system under external forces are very small. The equations can be easily computerized in codes, and have the advantage of sharing the input data of existing general multi body dynamic analysis codes. The equations can be applied to any form of suspension once the type of kinematic joints and elastic components are identified. The validity of the method has been proved through the comparison of the results from established elastokinematic analysis software. Error estimation and analysis due to piecewise linear assumption are also discussed.

반복형태식을 이용한 多物體系의 動力學的 해석 (Dynamic analysis of a multibody system using recursive-formula)

  • 신상훈;유완석
    • 대한기계학회논문집
    • /
    • 제12권6호
    • /
    • pp.1265-1272
    • /
    • 1988
  • 본 연구에서는 속도변환을 이용하여 기본체(base body)가 움직이는 경우에 대 한 일반적인 운동방정식을 유도하고, 이를 적절히 변형시킴으로써 로봇분야에서 이미 유도된 식과 비슷한 반복형태의 식을 얻을 수 있음을 보임으로써, 기계의 동력학 분야 에서 사용하고 있는 속도변환의 방법이 기본체가 고정되어 있는 경우가 대부분인 로봇 분야에서도 적용될 수 있음을 보이고자 한다. 또한 유도된 반복형태식을 이용하여 개방연쇄계(open-loop system)로 이루어진 기계시스템의 동력학 시뮬레이션에 적합한 알고리즘을 만들고 자동차를 예제로 택하여 유도된 방법의 타당성과 효율성을 검토하 였다.

AN ASYMPTOTIC FORMULA FOR exp(x/1-x)

  • Song, Jun-Ho;Lee, Chang-Woo
    • 대한수학회논문집
    • /
    • 제17권2호
    • /
    • pp.363-370
    • /
    • 2002
  • We show that G(x) = $e^{(x}$(1-x))/ -1 is the exponential generating function for the labeled digraphs whose weak components are transitive tournaments and derive both a recursive formula and an explicit formula for the number of them on n vertices. Moreover, we investigate the asymptotic behavior for the coefficients of G(x) using Hayman's method.d.

Computation of Blocking Probability in a Loss System

  • Na, Seong-Ryong
    • 한국통계학회:학술대회논문집
    • /
    • 한국통계학회 2005년도 춘계 학술발표회 논문집
    • /
    • pp.203-207
    • /
    • 2005
  • A loss system where two types of customers arrive in accordance with two independent Poisson processes is considered. An efficient recursive formula is developed for calculating the loss probability when the number of servers is large. Some practical examples regarding the performance evaluation of telecommunications networks are discussed.

  • PDF

A RECURSIVE FORMULA FOR THE JONES POLYNOMIAL OF 2-BRIDGE LINKS AND APPLICATIONS

  • Lee, Eun-Ju;Lee, Sang-Youl;Seo, Myoung-Soo
    • 대한수학회지
    • /
    • 제46권5호
    • /
    • pp.919-947
    • /
    • 2009
  • In this paper, we give a recursive formula for the Jones polynomial of a 2-bridge knot or link with Conway normal form C($-2n_1$, $2n_2$, $-2n_3$, ..., $(-1)_r2n_r$) in terms of $n_1$, $n_2$, ..., $n_r$. As applications, we also give a recursive formula for the Jones polynomial of a 3-periodic link $L^{(3)}$ with rational quotient L = C(2, $n_1$, -2, $n_2$, ..., $n_r$, $(-1)^r2$) for any nonzero integers $n_1$, $n_2$, ..., $n_r$ and give a formula for the span of the Jones polynomial of $L^{(3)}$ in terms of $n_1$, $n_2$, ..., $n_r$ with $n_i{\neq}{\pm}1$ for all i=1, 2, ..., r.

A RECURSIVE FORMULA FOR THE KHOVANOV COHOMOLOGY OF KANENOBU KNOTS

  • Lei, Fengchun;Zhang, Meili
    • 대한수학회보
    • /
    • 제54권1호
    • /
    • pp.1-15
    • /
    • 2017
  • Kanenobu has given infinite families of knots with the same HOMFLY polynomial invariant but distinct Alexander module structure. In this paper, we give a recursive formula for the Khovanov cohomology of all Kanenobu knots K(p, q), where p and q are integers. The result implies that the rank of the Khovanov cohomology of K(p, q) is an invariant of p + q. Our computation uses only the basic long exact sequence in knot homology and some results on homologically thin knots.

정전력 구동기의 동특성 해석 (A Study on Dynamic Analysis of the Electrostatic Actuator)

  • 이상규;김지남;문원규;최진환;박일한
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2005년도 춘계학술대회 논문집
    • /
    • pp.686-689
    • /
    • 2005
  • A numerical simulation method is developed to analyze the dynamic response of a cantilever switch, which is driven by electrostatic force and a basic component of electro-mechanical coupled system. First, point-charges model on conductor is proposed as a lumped parameter of electrical part. Then, this model is easily incorporated into a multi-body dynamics analysis algorithm, the generalized recursive dynamics formula previously developed by our research group. The resulting motion of a coupled overall system is formulated as a differential algebraic equation form including electrical and mechanical variables together. The equation is simultaneously solved in every time step. To implement this approach into the useful dynamics analysis tool, we used multibody dynamics software (RecurDyn) based on the generalized recursive formula using relative coordinate. The developed numerical simulation tool is evaluated by applying to many different driving condition and switch configuration. The final analysis model will be added to RecurDyn as a basic module for dynamics analysis of electro-mechanical coupled system.

  • PDF

Evaluation and Optimal Arrangement of Multi-Dimensional Consecutive System

  • 안해일
    • 한국신뢰성학회:학술대회논문집
    • /
    • 한국신뢰성학회 2000년도 추계학술대회
    • /
    • pp.397-397
    • /
    • 2000
  • There exists an increasing need of study for generalized consecutive k-out-of-n systems. This paper demonstrates that a recursive formula for multi-dimensional consecutive k-out-of-n systems can be systematically developed by means of conventional structure function analysis. By taking advantage of notational convenience, the formulae expressed in the same recursive fashion just as the one dimensional consecutive k-out-of-n system. With the aids of the recursive formulae, not only the exact reliability of the system, but also the optimal arrangement of components is obtainable in a straightforward way.

  • PDF

A recursive approach for mechanical system design sensitivity analysis

  • Daesung Bae
    • 한국공작기계학회논문집
    • /
    • 제10권1호
    • /
    • pp.101-111
    • /
    • 2001
  • Recursive formulas have been effective in solving the equations of motion for large scale constratined mechanical sys-tems. However, derivation of the formulas has been limited to individual terms in the equations of motion, such as veloci-ty, acceleration. and generalized forces. The recursive formulas are generalized in this paper. The velocity transformation method is employed to transform the equations of motion from Cartesian to the joint spaces. Computational structure of the equations of motion in the joint space is carefully examined to classify all necessary computational operations into sev-eral categories. The generalized recursive formula for each category is then developed and applied whenever such a cate-gory of computation is encountered. Since the velocity transformation method yields the equations of motion in a compact form and computational efficiency is achieved by generalized recursive formulas, the proposed method is not only easy to implement but is also efficient. A library of generalized recursive formulas is developed to implement a dynamic analysis algorithm using backward difference.

  • PDF

ppcor: An R Package for a Fast Calculation to Semi-partial Correlation Coefficients

  • Kim, Seongho
    • Communications for Statistical Applications and Methods
    • /
    • 제22권6호
    • /
    • pp.665-674
    • /
    • 2015
  • Lack of a general matrix formula hampers implementation of the semi-partial correlation, also known as part correlation, to the higher-order coefficient. This is because the higher-order semi-partial correlation calculation using a recursive formula requires an enormous number of recursive calculations to obtain the correlation coefficients. To resolve this difficulty, we derive a general matrix formula of the semi-partial correlation for fast computation. The semi-partial correlations are then implemented on an R package ppcor along with the partial correlation. Owing to the general matrix formulas, users can readily calculate the coefficients of both partial and semi-partial correlations without computational burden. The package ppcor further provides users with the level of the statistical significance with its test statistic.