Talbot carpets by rogue waves of extended nonlinear Schrödinger equations
Creators
- 1. Texas A&M University at Qatar, Science Program (Qatar)
- 2. University of California, Berkeley, Department of Physics (United States)
- 3. Xi'an Jiaotong University, Department of Applied Physics, School of Science (China)
- 4. Texas A&M University, Department of Physics and Astronomy (United States)
Description
We present analytical and numerical double-periodic solutions of the one-dimensional nonlinear Schrödinger equation and its extended versions in the form of Talbot carpets. The breathers and rogue waves of different orders are obtained using numerical simulations, starting from the initial conditions calculated by the Darboux transformation. To suppress undesirable aspects of modulation instability leading to homoclinic chaos, Fourier mode pruning procedures are invented to preserve and maintain the twofold periodicity of carpets. The novelty of this paper is analytical Talbot carpets for Hirota–quintic equation and ability to obtain them dynamically by controlling the growth of the Fourier modes. In addition, the new period-matching procedure is also described for periodic rogue waves that can be utilized to produce Talbot carpets without mode pruning. Tablot carpets may find future utility in optoplasmonic nanolithography.
Additional details
Identifiers
Publishing Information
- Journal Title
- Nonlinear Dynamics
- Journal Volume
- 97
- Journal Issue
- 2
- Journal Page Range
- p. 1215-1225
- ISSN
- 0924-090X
INIS
- Country of Publication
- Netherlands
- Country of Input or Organization
- International Atomic Energy Agency (IAEA)
- INIS RN
- 51102383
- Subject category
- S97: MATHEMATICAL METHODS AND COMPUTING;
- Descriptors DEI
- CHAOS THEORY; COMPUTERIZED SIMULATION; MATHEMATICAL SOLUTIONS; NONLINEAR PROBLEMS; PERIODICITY; SCHROEDINGER EQUATION; TRANSFORMATIONS
- Descriptors DEC
- DIFFERENTIAL EQUATIONS; EQUATIONS; MATHEMATICS; PARTIAL DIFFERENTIAL EQUATIONS; SIMULATION; VARIATIONS; WAVE EQUATIONS
Optional Information
- Copyright
- Copyright (c) 2019 The Author(s)