Ultimate Fast Gyrosynchrotron Codes

被引:18
|
作者
Kuznetsov, Alexey A. [1 ]
Fleishman, Gregory D. [2 ,3 ]
机构
[1] Inst Solar Terr Phys, Irkutsk 664033, Russia
[2] New Jersey Inst Technol Newark, Ctr Solar Terr Res, Phys Dept, Newark, NJ 07102 USA
[3] Ioffe Inst, Polytekhnicheskaya 26, St Petersburg 194021, Russia
来源
ASTROPHYSICAL JOURNAL | 2021年 / 922卷 / 02期
关键词
SYNCHROTRON-RADIATION; MICROWAVE; EMISSION; ACCELERATION; ABSORPTION; ENERGY;
D O I
10.3847/1538-4357/ac29c0
中图分类号
P1 [天文学];
学科分类号
0704 ;
摘要
The past decade has seen a dramatic increase in practical applications of microwave gyrosynchrotron emission for plasma diagnostics and three-dimensional modeling of solar flares and other astrophysical objects. This breakthrough became possible due to an apparently minor, technical development of fast gyrosynchrotron codes, which enormously reduced the computation time needed to calculate a single spectrum, while preserving the accuracy of the computation. However, the available fast codes are limited in that they can only be used for a factorized distribution over the energy and pitch angle, while the distribution of electrons over energy or pitch angle is limited to a number of predefined analytical functions. In realistic simulations, these assumptions do not hold; thus, the codes free from the mentioned limitations are called for. To remedy this situation, we extended our fast codes to work with an arbitrary input distribution function of radiating electrons. We accomplished this by implementing fast codes for a distribution function described by an arbitrary numerically defined array. In addition, we removed several other limitations of the available fast codes and improved treatment of the free-free component. The ultimate fast codes presented here allow for an arbitrary combination of the analytically and numerically defined distributions, which offers the most flexible use of the fast codes. We illustrate the code with a few simple examples.
引用
收藏
页数:10
相关论文
共 50 条
  • [21] Fast and secure hashing based on codes
    Knudsen, L
    Preneel, B
    ADVANCES IN CRYPTOLOGY - CRYPTO'97, PROCEEDINGS, 1997, 1294 : 485 - 498
  • [22] Analysis of Fast Sparse Superposition Codes
    Barron, Andrew R.
    Joseph, Antony
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011,
  • [23] Fast convergence algorithm for LDPC Codes
    Kienle, Frank
    Lehnigk-Emden, T.
    Wehn, Norbert
    2006 IEEE 63RD VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-6, 2006, : 2393 - 2397
  • [24] Fast Encoding and Decoding of Gabidulin Codes
    Silva, Danilo
    Kschischang, Frank R.
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 2858 - 2862
  • [25] Fast performance estimation of block codes
    Srinivasan, Rajan
    Wang, Nuo
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2008, 56 (03) : 369 - 377
  • [26] Fast systematic encoding of multiplicity codes
    Coxon, Nicholas
    JOURNAL OF SYMBOLIC COMPUTATION, 2019, 94 : 234 - 254
  • [27] Fast decoders for qudit topological codes
    Anwar, Hussain
    Brown, Benjamin J.
    Campbell, Earl T.
    Browne, Dan E.
    NEW JOURNAL OF PHYSICS, 2014, 16
  • [28] Fast operations with the use of differential codes
    Pogribny, Wlodzimierz
    Drechny, Marcin
    EUROCON 2007: THE INTERNATIONAL CONFERENCE ON COMPUTER AS A TOOL, VOLS 1-6, 2007, : 710 - 714
  • [29] A fast decoding method for prefix codes
    Milidiú, RL
    Laber, ES
    Moreno, LO
    Duarte, JC
    DCC 2003: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2003, : 438 - 438
  • [30] Fast Decoders for Topological Quantum Codes
    Duclos-Cianci, Guillaume
    Poulin, David
    PHYSICAL REVIEW LETTERS, 2010, 104 (05)