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

검색결과 70건 처리시간 0.027초

EXPLICIT EVALUATION OF HARMONIC SUMS

  • Xu, Ce
    • 대한수학회논문집
    • /
    • 제33권1호
    • /
    • pp.13-36
    • /
    • 2018
  • In this paper, we obtain some formulae for harmonic sums, alternating harmonic sums and Stirling number sums by using the method of integral representations of series. As applications of these formulae, we give explicit formula of several quadratic and cubic Euler sums through zeta values and linear sums. Furthermore, some relationships between harmonic numbers and Stirling numbers of the first kind are established.

IDEAL CELL-DECOMPOSITIONS FOR A HYPERBOLIC SURFACE AND EULER CHARACTERISTIC

  • Sozen, Yasar
    • 대한수학회지
    • /
    • 제45권4호
    • /
    • pp.965-976
    • /
    • 2008
  • In this article, we constructively prove that on a surface S with genus g$\geq$2, there exit maximal geodesic laminations with 7g-7,...,9g-9 leaves. Thus, S can have ideal cell-decompositions (i.e., S can be (ideally) triangulated by maximal geodesic laminations) with 7g-7,...,9g-9 (ideal) 1-cells. Once there is a triangulation for a compact surface, the Euler characteristic for the surface can be calculated as the alternating sum F-E+V, where F, E, and V denote the number of faces, edges, and vertices, respectively. We also prove that the same formula holds for the ideal cell decompositions.

AN ALGORITHM FOR THE NUMERICAL SOLUTION OF DIFFERENTIAL EQUATIONS OF FRACTIONAL ORDER

  • Odibat, Zaid M.;Momani, Shaher
    • Journal of applied mathematics & informatics
    • /
    • 제26권1_2호
    • /
    • pp.15-27
    • /
    • 2008
  • We present and discuss an algorithm for the numerical solution of initial value problems of the form $D_*^\alpha$y(t) = f(t, y(t)), y(0) = y0, where $D_*^\alpha$y is the derivative of y of order $\alpha$ in the sense of Caputo and 0<${\alpha}{\leq}1$. The algorithm is based on the fractional Euler's method which can be seen as a generalization of the classical Euler's method. Numerical examples are given and the results show that the present algorithm is very effective and convenient.

  • PDF

Derivation of the Extended Elastic Stiffness Formula of the Holddown Spring Assembly Comprised of Several Leaves

  • Song, Kee-Nam;Kang, H.S.;Yoon, K.H.
    • Nuclear Engineering and Technology
    • /
    • 제31권3호
    • /
    • pp.328-334
    • /
    • 1999
  • Based on the Euler beam theory and the elastic strain energy method, the elastic stiffness formula of the holddown spring assembly consisting of several leaves was previously derived. Even though the previous formula was known to be useful to estimate the elastic stiffness of the holddown spring assembly, recently it was reported that the elastic stiffness from the previous formula deviated greatly from the test results as the number of leaves was increased. The objective of this study is to extend the previous formula in order to resolve such an increasing deviation when increasing the number of leaves. Additionally, considering the friction forces acting on the interfaces between the leaves, we obtained an extended elastic stiffness formula. The characteristic test and the elastic stiffness analysis on the various kinds of specimens of the holddown spring assembly have been carried out; the validity of the extended formula has been verified by the comparison of their results. As a result of comparisons, it is found that the extended formula is able to evaluate the elastic stiffness of the holddown spring assembly within the maximum error range of + 12%, irrespective of the number of the leaves.

  • PDF

엔진 커넥팅로드의 좌굴평가에 대한 연구 (Study of Buckling Evaluation for the connecting rod of the engine)

  • 이문규;문희욱;이형일;이태수;신성원;장훈
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2004년도 추계학술대회 논문집
    • /
    • pp.677-680
    • /
    • 2004
  • This study investigates the buckling evaluation of connecting rods used in the diesel engine through finite element analysis. The Rankine formula, which is modified from classical Euler‘s formula, has been widely accepted in automotive industry to evaluate the buckling of connecting rods. Apparently, this formula is most suitable for the straight and idealized rod shape, and over-simplifies the geometric complexity associated with connecting rods. The subspace iteration method in FEA is used to predict the critical buckling stress of a connecting rod with certain slenderness ratio. To create models with various slenderness ratios for shank portion in the rod, the automatic meshing preprocessor was implemented. Results from FEA were verified by the experiments, in which the embedded strain gages measured for the connecting rod running at 4000rpm. The result indicates that the buckling prediction curve through FEA and experiment is effectively different from the curve of classical Rankine formula.

  • PDF

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.

NOTE ON THE CLASSICAL WATSON'S THEOREM FOR THE SERIES 3F2

  • Choi, Junesang;Agarwal, P.
    • 호남수학학술지
    • /
    • 제35권4호
    • /
    • pp.701-706
    • /
    • 2013
  • Summation theorems for hypergeometric series $_2F_1$ and generalized hypergeometric series $_pF_q$ play important roles in themselves and their diverse applications. Some summation theorems for $_2F_1$ and $_pF_q$ have been established in several or many ways. Here we give a proof of Watson's classical summation theorem for the series $_3F_2$(1) by following the same lines used by Rakha [7] except for the last step in which we applied an integral formula introduced by Choi et al. [3].

비다양체 형상 모델링을 위한 간결한 경계 표현 및 확장된 오일러 작업자 (Compact Boundary Representation and Generalized Eular Operators for Non-manifold Geometric Modeling)

  • 이상헌;이건우
    • 한국CDE학회논문집
    • /
    • 제1권1호
    • /
    • pp.1-19
    • /
    • 1996
  • Non-manifold topological representations can provide a single unified representation for mixed dimensional models or cellular models and thus have a great potential to be applied in many application areas. Various boundary representations for non-manifold topology have been proposed in recent years. These representations are mainly interested in describing the sufficient adjacency relationships and too redundant as a result. A model stored in these representations occupies too much storage space and is hard to be manipulated. In this paper, we proposed a compact hierarchical non-manifold boundary representation that is extended from the half-edge data structure for solid models by introducing the partial topological entities to represent some non-manifold conditions around a vertex, edge or face. This representation allows to reduce the redundancy of the existing schemes while full topological adjacencies are still derived without the loss of efficiency. To verify the statement above, the storage size requirement of the representation is compared with other existing representations and present some main procedures for querying and traversing the representation. We have also implemented a set of the generalized Euler operators that satisfy the Euler-Poincare formula for non-manifold geometric models.

  • PDF

A q-ANALOGUE OF $\omega-BERNOULLI$ NUMBERS AND THEIR APPLICATIONS

  • Son, Jin-Woo;Jang, Douk-Soo
    • 대한수학회보
    • /
    • 제38권2호
    • /
    • pp.399-412
    • /
    • 2001
  • In this paper, we consider that the q-analogue of w$\omega-Bernoulli numbers\; B_i(\omega, q)$. And we calculate the sums of products of two q-analogue of $\omega-Bernoulli numbers B_i(\omega, q)$ in complex cases. From this result, we obtain the Euler type formulas of the Carlitz´s q-Bernoulli numbers $\beta_i(q)$ and q-Bernoulli numbers $B_i(q)$. And we also calculate the p-adic Stirling type series by the definition of $B_i(\omega, q)$ in p-adic cases.

  • PDF

최소 면적의 CMOS 기능셀 설계도면을 찾는 휴리스틱 알고리즘 (A Heuristic Algorithm for Minimal Area CMOS Cell Layout)

  • 권용준;경종민
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
    • /
    • pp.1463-1466
    • /
    • 1987
  • The problem of generating minimal area CMOS functional cell layout can be converted to that of decomposing the transistor connection graph into a minimum number of subgraphs, each having a pair of Euler paths with the same sequence of input labels on the N-graph and P-graph, which are portions of the graph corresponding to NMOS and PMOS parts respectively. This paper proposes a heuristic algorithm which yields a nearly minimal number of Euler paths from the path representation formula which represents the give a logic function. Subpath merging is done through a list processing scheme where the pair of paths which results in the lowest cost is successively merged from all candidate merge pairs until no further path merging and further reduction of number of subgraphs are possible. Two examples were shown where we were able to further reduce the number of interlaces, i.e., the number of non-butting diffusion islands, from 3 to 2, and from 2 to 1, compared to the earlier work [1].

  • PDF