• 제목/요약/키워드: iteration functions

검색결과 97건 처리시간 0.019초

REPULSIVE FIXED-POINTS OF THE LAGUERRE-LIKE ITERATION FUNCTIONS

  • Ham, YoonMee;Lee, Sang-Gu
    • Korean Journal of Mathematics
    • /
    • 제16권1호
    • /
    • pp.51-55
    • /
    • 2008
  • Let f be an analytic function with a simple zero in the reals or the complex numbers. An extraneous fixed-point of an iteration function is a fixed-point different from a zero of f. We prove that all extraneous fixed-points of Laguerre-like iteration functions and general Laguerre-like functions are repulsive.

  • PDF

NUMBER OF VERTICES FOR POLYGONAL FUNCTIONS UNDER ITERATION

  • Li, Lin
    • 한국수학교육학회지시리즈B:순수및응용수학
    • /
    • 제14권2호
    • /
    • pp.99-109
    • /
    • 2007
  • Being complicated in computation, iteration of a nonlinear 1-dimensional mapping makes many interesting problems, one of which is about the change of the number of vertices under iteration. In this paper we investigate iteration of polygonal functions which each have only one vertex and give conditions under which the number of vertices either does not increase or has a bound under iteration.

  • PDF

A GENERATION OF A DETERMINANTAL FAMILY OF ITERATION FUNCTIONS AND ITS CHARACTERIZATIONS

  • Ham, YoonMee;Lee, Sang-Gu;Ridenhour, Jerry
    • Korean Journal of Mathematics
    • /
    • 제16권4호
    • /
    • pp.481-494
    • /
    • 2008
  • Iteration functions $K_m(z)$ and $U_m(z)$, $m{\geq}2$are defined recursively using the determinant of a matrix. We show that the fixed-iterations of $K_m(z)$ and $U_m(z)$ converge to a simple zero with order of convergence m and give closed form expansions of $K_m(z)$ and $U_m(z)$: To show the convergence, we derive a recursion formula for $L_m$ and then apply the idea of Ford or Pomentale. We also find a Toeplitz matrix whose determinant is $L_m(z)/(f^{\prime})^m$, and then we adapt the well-known results of Gerlach and Kalantari et.al. to give closed form expansions.

  • PDF

MORE PROPERTIES OF WEIGHTED BEREZIN TRANSFORM IN THE UNIT BALL OF ℂn

  • Lee, Jaesung
    • Korean Journal of Mathematics
    • /
    • 제30권3호
    • /
    • pp.459-465
    • /
    • 2022
  • We exhibit various properties of the weighted Berezin operator Tα and its iteration Tkα on Lp(𝜏), where α > -1 and 𝜏 is the invariant measure on the complex unit ball Bn. Iterations of Tα on L1R(𝜏) the space of radial integrable functions have performed important roles in proving 𝓜-harmonicity of bounded functions with invariant mean value property. We show differences between the case of 1 < p < ∞ and p = 1, ∞ under the infinite iteration of Tα or the infinite summation of iterations, most of which are extensions or related assertions to the propositions of the previous results.

블록암호 기반 키유도함수의 증명가능 안전성 (Provable Security of Key Derivation Functions Based on the Block Ciphers)

  • 강주성;이옥연;염지선
    • 정보보호학회논문지
    • /
    • 제20권4호
    • /
    • pp.3-16
    • /
    • 2010
  • 키유도함수는 고정된 길이의 키로부터 정보보호 알고리즘 수행을 위하여 필요로 하는 다양한 키들을 유도해내는 메커니즘으로 암호시스템의 필수적인 구성요소이다. 본 논문에서는 키유도함수에 대한 최신 연구 동향을 조사 분석하고 증명가능 안전성 관점에서 키유도함수 구조의 견고성에 대하여 논한다. 특히 NIST가 최근 제안한 의사난수함수(PRF) 기반 키유도함수 모드를 블록암호로 대표되는 의사단수치환 (PRP) 기반 키유도함수로 변형 할 경우의 증명 가능 안전성에 초점을 맞추어 Double-Pipeline Iteration 모드의 의사난수성을 규명한다.

NEW INTERIOR POINT METHODS FOR SOLVING $P_*(\kappa)$ LINEAR COMPLEMENTARITY PROBLEMS

  • Cho, You-Young;Cho, Gyeong-Mi
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제13권3호
    • /
    • pp.189-202
    • /
    • 2009
  • In this paper we propose new primal-dual interior point algorithms for $P_*(\kappa)$ linear complementarity problems based on a new class of kernel functions which contains the kernel function in [8] as a special case. We show that the iteration bounds are $O((1+2\kappa)n^{\frac{9}{14}}\;log\;\frac{n{\mu}^0}{\epsilon}$) for large-update and $O((1+2\kappa)\sqrt{n}log\frac{n{\mu}^0}{\epsilon}$) for small-update methods, respectively. This iteration complexity for large-update methods improves the iteration complexity with a factor $n^{\frac{5}{14}}$ when compared with the method based on the classical logarithmic kernel function. For small-update, the iteration complexity is the best known bound for such methods.

  • PDF

DYNAMICAL PROPERTIES ON THE ITERATION OF CF-FUNCTIONS

  • Yoo, Seung-Jae
    • 충청수학회지
    • /
    • 제12권1호
    • /
    • pp.1-13
    • /
    • 1999
  • The purpose of this paper is to show that if the Fatou set F(f) of a CF-meromorphic function f has two completely invariant components, then they are the only components of F(f) and that the Julia set of the entire transcendental function $E_{\lambda}(z)={\lambda}e^z$ for 0 < ${\lambda}$ < $\frac{1}{e}$ contains a Cantor bouquet by employing the Devaney and Tangerman's theorem[10].

  • PDF