Показати простий запис статті
dc.contributor.author |
Gurin, A.M. |
|
dc.date.accessioned |
2015-04-02T15:07:34Z |
|
dc.date.available |
2015-04-02T15:07:34Z |
|
dc.date.issued |
2001 |
|
dc.identifier.citation |
Geometric attractor of an electron beam passing through a crystal / A.M. Gurin // Вопросы атомной науки и техники. — 2001. — № 6. — С. 147-148. — Бібліогр.: 8 назв. — англ. |
uk_UA |
dc.identifier.issn |
1562-6016 |
|
dc.identifier.other |
PACS: 12.20.-m, 13.40.-f, 13.60-Hb, 13.88.+e |
|
dc.identifier.uri |
http://dspace.nbuv.gov.ua/handle/123456789/79473 |
|
dc.description.abstract |
The Lemmlein algorithm assigns a cyclic interaction of a mathematical point with other (n+1) points of the n - dimensional Euclidean space. In this paper generalization A of the Lemmlein algorithm for an arbitrary number of points m situated in the n - dimensional Riemann space is proposed. Algorithm A generates a Markovian chain consisting of the finite number of combinatorially different strongly convergent attractors. Algorithm A is generalized to describe the interaction of mass points, e.g., the motion of electrons in the real crystal medium. The strong convergence of the attractors provides stability of the electron trajectories in the vicinity of an attractor in the unit cell of the crystal after electron scattering at the crystal defects. |
uk_UA |
dc.description.sponsorship |
The research described in this publication was made possible in part by Grant № U22000 from the International Science Foundation. |
uk_UA |
dc.language.iso |
en |
uk_UA |
dc.publisher |
Національний науковий центр «Харківський фізико-технічний інститут» НАН України |
uk_UA |
dc.relation.ispartof |
Вопросы атомной науки и техники |
|
dc.subject |
Electrodynamics of high energies in matter and strong fields |
uk_UA |
dc.title |
Geometric attractor of an electron beam passing through a crystal |
uk_UA |
dc.title.alternative |
Геометрический аттрактор пучка электронов, прошедших через кристалл |
uk_UA |
dc.type |
Article |
uk_UA |
dc.status |
published earlier |
uk_UA |
Файли у цій статті
Ця стаття з'являється у наступних колекціях
Показати простий запис статті