Ken Umeno

Prof. Dr. Ken Umeno

orcid

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

1 May 1997 in Physical Review E
Verified
Journal Article
Closed access
PDF file
KUKen Umeno
Ken Umeno
We present a systematic method of constructing rational mappings as ergodic transformations with nonuniform invariant measures on the unit interval I=[0,1]. As a result, we obtain a two-parameter family of rational mappings that have a special property in that their invariant measures can be explicitly written in terms of algebraic functions of parameters and a dynamical variable. Furthermore, it is shown here that this family is the most generalized class of rational mappings possessing the property of exactly solvable chaos on I, including the Ulam–von Neumann map y=4x(1-x). Based on the present method, we can produce a series of rational mappings resembling the asymmetric shape of the experimentally obtained first return maps of the Beloussof-Zhabotinski chemical reaction, and we can match some rational functions with other experimentally obtained first return maps in a systematic manner.

22 August 2022 in Research in International Business and Finance
Verified
Journal Article
Open access
SKShinji Kakinaka
Shinji Kakinaka
KUKen Umeno
Ken Umeno

9 March 2017 in Journal of Geophysical Research: Space Physics
Verified
Journal Article
Closed access
PDF file
TITakuya Iwata
Takuya Iwata
KUKen Umeno
Ken Umeno

1 November 2021 in Physica A: Statistical Mechanics and its Applications
Verified
Journal Article
Open access
SKShinji Kakinaka
Shinji Kakinaka
KUKen Umeno
Ken Umeno

1 March 2000 in Japanese Journal of Applied Physics
Verified
Journal Article
Closed access
KUKen Umeno
Ken Umeno
Chaotic maps with absolutely continuous invariant probability measures are implemented as random-number generators for Monte Carlo computation. We observe that such Monte Carlo computation based on chaotic random-number generators yields sometimes unexpected dynamical dependency behavior which cannot be explained by usual statistical arguments. Furthermore, we find that superefficient Monte Carlo computation with O(1/N 2) mean square error can be carried out as an extreme case of such dynamical dependency behavior. Here, such superefficiency sharply contrasts with the conventional Monte Carlo simulation with O(1/N) mean square error. By deriving a necessary and sufficient condition for the superefficiency, it is shown that such high-performance Monte Carlo simulations can be carried out only if there exists a strong correlation with chaotic dynamical variables. Numerical calculation illustrates this dynamics dependency and the superefficiency of various chaotic Monte Carlo computations.