Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

- padalko.ma@dvfu.ru
- skype: Slava_ko108
- Google Scholar
- ResearchGate
- Vladivostok, FEFU campus, L451
- ORCID
- Scopus id: 57210794381
Interests:
physics of phase transitions, statistical physics, critical phenomena, programming, CUDA, MPI, OpenMPI,
HPC, classical guitar playing, magnet materials, Monte Carlo methods
- Ph.D-student of FEFU, condensed matter physics;
- Research engineer,
Institute of Applied Mathematics, Far Eastern Branch of Russian Academy of Sciences
The subject of my investigation is modeling of spin systems. Exact methods of calculation is interested for me also. Spin systems can help to explain critical phenomena. For carrying out out this task it is necessary applying Monte Carlo methods. HPC is the main tool we use for calculation. It includes CUDA, MPI and OpenMPI technologies of parallel programming.
My work includes:
- searching and investigation of the exact solutions for the Ising model problem
- modeling of spin glasses
2019
Padalko, M.; Andriushchenko, P.; Soldatov, K.; Nefedev, K.
Accelearated Algorithm of the Exhaustive Enumeration Algorithm in the Ising Model Journal Article Forthcoming
In: Dal’nevostochnyi Matematicheskii Zhurnal, vol. 19, no. 2, pp. 235-244, Forthcoming, ISBN: 1608-845X.
Abstract | Links | BibTeX | Tags: andriushchenko, monter carlo, nefedev ising, padalko, soldatov
@article{Padalko2019b,
title = {Accelearated Algorithm of the Exhaustive Enumeration Algorithm in the Ising Model},
author = {M. Padalko and P. Andriushchenko and K. Soldatov and K. Nefedev},
editor = {Bykovsky Victor Alekseevich},
url = {http://www.iam.khv.ru/article.php?art=403&iss=34},
isbn = {1608-845X},
year = {2019},
date = {2019-12-09},
journal = {Dal'nevostochnyi Matematicheskii Zhurnal},
volume = {19},
number = {2},
pages = {235-244},
abstract = {An accelearated algorithm for the precise calculation of the lattice Ising model is presented. The algorithm makes it possible to calculate two-dimensional 10x10 lattices for periodic boundary conditions on ordinary personal computers. In turn, the exact solution obtained by the proposed method makes it possible to check the effectiveness of various probabilistic approaches, in particular the Monte Carlo methods. The algorithm is applicable to various types of lattices.},
keywords = {andriushchenko, monter carlo, nefedev ising, padalko, soldatov},
pubstate = {forthcoming},
tppubtype = {article}
}
P. Andriushchenko M. Padalko, K. Nefedev
Optimization of the Exhaustive Enumeration Algorithm in the Ising Model Proceedings Article
In: Sergey I. Smagin, Alexander A. Zatsarinnyy (Ed.): Information Technologies and High-Performance Computing 2019, pp. 161-166, the Russian Academy of Sciences Computing Center of Far-Eastern Branch, Russian Academy of Sciences, Federal Research Center ‘Computer Science and Control’ of , 65 Kim Yo Cheng st., Khabarovsk, 680000, Russia, 2019, ISBN: 1613-0073.
Abstract | Links | BibTeX | Tags: andriushchenko, exact, nefedev ising, padalko
@inproceedings{Padalko2019,
title = {Optimization of the Exhaustive Enumeration Algorithm in the Ising Model},
author = {M. Padalko, P. Andriushchenko, K. Nefedev},
editor = {Sergey I. Smagin, Alexander A. Zatsarinnyy},
url = {http://ceur-ws.org/Vol-2426/paper24.pdf},
isbn = {1613-0073},
year = {2019},
date = {2019-08-14},
booktitle = {Information Technologies and High-Performance Computing 2019},
journal = {CEUR Workshop Proceedings, Information Technologies and High-Performance Computing},
volume = {2426},
number = {1},
pages = {161-166},
publisher = {Computing Center of Far-Eastern Branch, Russian Academy of Sciences, Federal Research Center 'Computer Science and Control' of },
address = {65 Kim Yo Cheng st., Khabarovsk, 680000, Russia},
organization = {the Russian Academy of Sciences},
series = {1},
abstract = {An optimized method for the precise calculation of the Ising model is presented. The algorithm makes it possible to calculate two-dimensional 10x10 lattices for periodic boundary conditions on ordinary personal computers. The method is applicable to various types of lattices. The proposed optimized method of precise calculation makes it possible to test the effectiveness of Monte Carlo methods.},
keywords = {andriushchenko, exact, nefedev ising, padalko},
pubstate = {published},
tppubtype = {inproceedings}
}
@article{Padalko2019b,
title = {Accelearated Algorithm of the Exhaustive Enumeration Algorithm in the Ising Model},
author = {M. Padalko , P. Andriushchenko, K. Soldatov, K. Nefedev},
editor = {Bykovsky Victor Alekseevich},
url = {http://www.iam.khv.ru/FEMJ.php},
isbn = {1608-845X},
year = {2019},
date = {2019-12-09},
journal = {Dal’nevostochnyi Matematicheskii Zhurnal},
volume = {19},
number = {2},
pages = {235-244},
abstract = {An accelearated algorithm for the precise calculation of the lattice Ising model is presented. The algorithm makes it possible to calculate two-dimensional 10×10 lattices for periodic boundary conditions on ordinary personal computers. In turn, the exact solution obtained by the proposed method makes it possible to check the effectiveness of various probabilistic approaches, in particular the Monte Carlo methods. The algorithm is applicable to various types of lattices.},
keywords = {andriushchenko, monter carlo, nefedev ising, padalko, soldatov},
pubstate = {forthcoming},
tppubtype = {article}
}
Specialist (eq. Master) – physicist
2009-2014, Pacific National University, Department of Mathematical Modelling
and Control Processes, physics (Information Systems in Physics)