• 제목/요약/키워드: symbolic and numerical computations

검색결과 4건 처리시간 0.016초

기호계산 기법을 이용한 현가장치의 기구학적 민감도 해석 (Kinematic Design Sensitivity Analysis of Suspension System Using a Symbolic Computation Method)

  • 송성재;탁태오
    • 한국자동차공학회논문집
    • /
    • 제4권6호
    • /
    • pp.247-259
    • /
    • 1996
  • Kinematic design sensitivity analysis for vehicle in suspension systems design is performed. Suspension systems are modeled using composite joins to reduce the number of the constraint equations. This allows a semi-analytical approach that is computerized symbolic manipulation before numerical computations and that may compensate for their drawbacks. All the constraint equations including design variables are derived in symbolic equations for sensitivity analysis. By directly differentiating the equations with respect to design variables, sensitivity equations are obtained. Since the proposed method only requires the hard point data, sensitivity analysis is possible in suspension design stage.

  • PDF

Symbolic computation and differential quadrature method - A boon to engineering analysis

  • Rajasekaran, S.
    • Structural Engineering and Mechanics
    • /
    • 제27권6호
    • /
    • pp.713-739
    • /
    • 2007
  • Nowadays computers can perform symbolic computations in addition to mere number crunching operations for which they were originally designed. Symbolic computation opens up exciting possibilities in Structural Mechanics and engineering. Classical areas have been increasingly neglected due to the advent of computers as well as general purpose finite element software. But now, classical analysis has reemerged as an attractive computer option due to the capabilities of symbolic computation. The repetitive cycles of simultaneous - equation sets required by the finite element technique can be eliminated by solving a single set in symbolic form, thus generating a truly closed-form solution. This consequently saves in data preparation, storage and execution time. The power of Symbolic computation is demonstrated by six examples by applying symbolic computation 1) to solve coupled shear wall 2) to generate beam element matrices 3) to find the natural frequency of a shear frame using transfer matrix method 4) to find the stresses of a plate subjected to in-plane loading using Levy's approach 5) to draw the influence surface for deflection of an isotropic plate simply supported on all sides 6) to get dynamic equilibrium equations from Lagrange equation. This paper also presents yet another computationally efficient and accurate numerical method which is based on the concept of derivative of a function expressed as a weighted linear sum of the function values at all the mesh points. Again this method is applied to solve the problems of 1) coupled shear wall 2) lateral buckling of thin-walled beams due to moment gradient 3) buckling of a column and 4) static and buckling analysis of circular plates of uniform or non-uniform thickness. The numerical results obtained are compared with those available in existing literature in order to verify their accuracy.

LEONHARD EULER (1707-1783) AND THE COMPUTATIONAL ASPECTS OF SOME ZETA-FUNCTION SERIES

  • Srivastava, Hari Mohan
    • 대한수학회지
    • /
    • 제44권5호
    • /
    • pp.1163-1184
    • /
    • 2007
  • In this presentation dedicated to the tricentennial birth anniversary of the great eighteenth-century Swiss mathematician, Leonhard Euler (1707-1783), we begin by remarking about the so-called Basler problem of evaluating the Zeta function ${\zeta}(s)$ [in the much later notation of Georg Friedrich Bernhard Riemann (1826-1866)] when s=2, which was then of vital importance to Euler and to many other contemporary mathematicians including especially the Bernoulli brothers [Jakob Bernoulli (1654-1705) and Johann Bernoulli (1667-1748)], and for which a fascinatingly large number of seemingly independent solutions have appeared in the mathematical literature ever since Euler first solved this problem in the year 1736. We then investigate various recent developments on the evaluations and representations of ${\zeta}(s)$ when $s{\in}{\mathbb{N}}{\backslash}\;[1],\;{\mathbb{N}}$ being the set of natural numbers. We emphasize upon several interesting classes of rapidly convergent series representations for ${\zeta}(2n+1)(n{\in}{\mathbb{N}})$ which have been developed in recent years. In two of many computationally useful special cases considered here, it is observed that ${\zeta}(3)$ can be represented by means of series which converge much more rapidly than that in Euler's celebrated formula as well as the series used recently by Roger $Ap\'{e}ry$ (1916-1994) in his proof of the irrationality of ${\zeta}(3)$. Symbolic and numerical computations using Mathematica (Version 4.0) for Linux show, among other things, that only 50 terms of one of these series are capable of producing an accuracy of seven decimal places.

Efficient Computations for Evaluating Extended Stochastic Petri Nets using Algebraic Operations

  • Kim, Dong-Sung;Moon, Hong-Ju;Bahk, Je-Hyeong;Kwon, Wook-Hyun;Zygmunt J. Haas
    • International Journal of Control, Automation, and Systems
    • /
    • 제1권4호
    • /
    • pp.431-443
    • /
    • 2003
  • This paper presents an efficient method to evaluate the performance of an extended stochastic Petri net by simple algebraic operations. The reachability graph is derived from an extended stochastic Petri net, and then converted to a timed stochastic state machine, using a semi-Markov process. The n-th moments of the performance index are derived by algebraic manipulations with each of the n-th moments of transition time and transition probability. For the derivation, three reduction rules are introduced on the transition trajectories in a well-formed regular expression. Efficient computation algorithms are provided to automate the suggested method. The presented method provides a proficient means to derive both the numerical and the symbolic solutions for the performance of an extended stochastic Petri net by simple algebraic manipulations.