• 제목/요약/키워드: Logarithmic

검색결과 931건 처리시간 0.047초

기하평균에 대한 소고 (A brief study on the geometric mean)

  • 여인권
    • 응용통계연구
    • /
    • 제33권4호
    • /
    • pp.357-364
    • /
    • 2020
  • 이 소고에서는 기하평균의 성질과 기하평균과 관련된 통계적 추론에 대한 알아 본다. 로그변환-역변환을 통해 얻어진 통계적 추론 결과가 기하평균과 관련이 있다는 것을 보이고 이 과정에서 유도된 결과를 어떻게 해석해야 하는지를 설명한다.

THE LIMIT THEOREMS UNDER LOGARITHMIC AVERAGES FOR MIXING RANDOM VARIABLES

  • Zhang, Yong
    • 대한수학회논문집
    • /
    • 제29권2호
    • /
    • pp.351-358
    • /
    • 2014
  • In this paper, under some suitable integrability and smoothness conditions on f, we establish the central limit theorems for $$\sum_{k{\leq}N}k^{-1}f(S_k/{\sigma}\sqrt{k})$$, where $S_k$ is the partial sums of strictly stationary mixing random variables with $EX_1=0$ and ${\sigma}^2=EX^2_1+2\sum_{k=1}^{\infty}EX_1X_{1+k}$. We also establish an almost sure limit behaviors of the above sums.

A LOGARITHMIC CONJUGATE GRADIENT METHOD INVARIANT TO NONLINEAR SCALING

  • Moghrabi, I.A.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제8권2호
    • /
    • pp.15-21
    • /
    • 2004
  • A Conjugate Gradiant (CG) method is proposed for unconstained optimization which is invariant to a nonlinear scaling of a strictly convex quadratic function. The technique has the same properties as the classical CG-method when applied to a quadratic function. The algorithm derived here is based on a logarithmic model and is compared to the standard CG method of Fletcher and Reeves [3]. Numerical results are encouraging and indicate that nonlinear scaling is promising and deserves further investigation.

  • PDF

NEW CLASS OF INTEGRALS INVOLVING GENERALIZED HYPERGEOMETRIC FUNCTION AND THE LOGARITHMIC FUNCTION

  • Kim, Yongsup
    • 대한수학회논문집
    • /
    • 제31권2호
    • /
    • pp.329-342
    • /
    • 2016
  • Motivated essentially by Brychkov's work [1], we evaluate some new integrals involving hypergeometric function and the logarithmic function (including those obtained by Brychkov[1], Choi and Rathie [3]), which are expressed explicitly in terms of Gamma, Psi and Hurwitz zeta functions suitable for numerical computations.

Ubiquitous Crisis and Renormalization Approach for e-commerce : Critical Phenomena and Emergence of Phase Transition ; Logarithmic convergence

  • Ito, Ken;Kazuomi;Fukuta, Takanari
    • 한국전자거래학회:학술대회논문집
    • /
    • 한국전자거래학회 2004년도 e-Biz World Conference
    • /
    • pp.89-97
    • /
    • 2004
  • 1. Introduction; Fundamental Difference between conventional old commerce and e-commerce? 2. "Quantity changes into Quality"; Phase transition and Critical phenomena Logarithmic Convergence and Emergence of Quality 3. Networked Small World; Indications from Genomics; Power-Law Ordered Plain Structure of Super-Complex System ⇔ The Structure of e-Biz. 4. Uniquitous Crisis to Ubiquitous Critical Points for the Emergence of Qualified Business with e-strucrure

  • PDF

A NUMERICAL METHOD FOR SOLVING THE NONLINEAR INTEGRAL EQUATION OF THE SECOND KIND

  • Salama, F.A.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제7권2호
    • /
    • pp.65-73
    • /
    • 2003
  • In this work, we use a numerical method to solve the nonlinear integral equation of the second kind when the kernel of the integral equation in the logarithmic function form or in Carleman function form. The solution has a computing time requirement of $0(N^2)$, where (2N +1) is the number of discretization points used. Also, the error estimate is computed.

  • PDF

ADAPTATION OF THE MINORANT FUNCTION FOR LINEAR PROGRAMMING

  • Leulmi, S.;Leulmi, A.
    • East Asian mathematical journal
    • /
    • 제35권5호
    • /
    • pp.597-612
    • /
    • 2019
  • In this study, we propose a new logarithmic barrier approach to solve linear programming problem using the projective method of Karmarkar. We are interested in computation of the direction by Newton's method and of the step-size using minorant functions instead of line search methods in order to reduce the computation cost. Our new approach is even more beneficial than classical line search methods. We reinforce our purpose by many interesting numerical simulations proved the effectiveness of the algorithm developed in this work.