• Title/Summary/Keyword: iteration functions

Search Result 95, Processing Time 0.023 seconds

REPULSIVE FIXED-POINTS OF THE LAGUERRE-LIKE ITERATION FUNCTIONS

  • Ham, YoonMee;Lee, Sang-Gu
    • Korean Journal of Mathematics
    • /
    • v.16 no.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
    • The Pure and Applied Mathematics
    • /
    • v.14 no.2 s.36
    • /
    • 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
    • /
    • v.16 no.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
    • /
    • v.30 no.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 (블록암호 기반 키유도함수의 증명가능 안전성)

  • Kang, Ju-Sung;Yi, Ok-Yeon;Youm, Ji-Sun
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.20 no.4
    • /
    • pp.3-16
    • /
    • 2010
  • Key derivation functions are used within many cryptographic systems in order to generate various keys from a fixed short key string. In this paper we survey a state-of-the-art in the key derivation functions and wish to examine the soundness of the functions on the view point of provable security. Especially we focus on the key derivation functions using pseudorandom functions which are recommended by NISI recently, and show that the variant of Double-Pipeline Iteration mode using pseudorandom permutations is a pseudorandom function. Block ciphers can be regarded as practical primitives of pseudorandom permutations.

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
    • /
    • v.13 no.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
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.12 no.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

Optimal Process Design in Non-Steady Metal Forming by the Design Sensitivity (설계민감도를 이용한 비정상상태 소성가공공정 최적 설계)

  • 정석환;황상무
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 1997.03a
    • /
    • pp.113-118
    • /
    • 1997
  • A new approach to process optimal design in non-isothermal, non-steady state metal forming is presented. In this approach, the optimal design problem is formulated on the basis of the integrated thermo-mechanical finite element process model so as to cover a wide range of the objective functions and design variables, and the derivative based approach is adopted for conducting optimization by design iteration. The process model, the formulation for process optimal design, and the procedures for the evaluation of the design sensitivity and for design iteration for optimization are described.

  • PDF