Alexander Nikolaev

Mr. Alexander Nikolaev

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
1 January 2023 in Keldysh Institute Preprints
Verified
Preprint
Open access
SESergey Ershov
Sergey Ershov
VFVladimir Frolov
Vladimir Frolov
ANAlexander Nikolaev
Alexander Nikolaev
AVAlexey G. Voloboy
Alexey G. Voloboy
The main computationally extensive task of realistic computer graphics is the calculation of global illumination. The work investigates the speed of the convergence of lighting simulation using Monte Carlo integration based on the Langevin equation. The paper presents the first part of the work, which provides a detailed overview of the problem, examines the influence of the divergent term, the choice of the integration step, and derives formulae for calculating the preconditioning matrix. It is shown how these aspects affect convergence.

1 January 2023 in Keldysh Institute Preprints
Verified
Preprint
Open access
SESergey Ershov
Sergey Ershov
VFVladimir Frolov
Vladimir Frolov
ANAlexander Nikolaev
Alexander Nikolaev
AVAlexey G. Voloboy
Alexey G. Voloboy
The main computationally extensive task of realistic computer graphics is the calculation of global illumination. The work investigates the speed of the convergence of lighting simulation using Monte Carlo integration based on the Langevin equation. The paper presents the second part of the work, which analyses the choice of the phase space, restrictions on the possible variations of light path, and the calculation of the probability density of the transition proposal. It is shown how these aspects affect convergence.

1 January 2023 in Keldysh Institute Preprints
Verified
Preprint
Open access
SESergey Ershov
Sergey Ershov
VFVladimir Frolov
Vladimir Frolov
ANAlexander Nikolaev
Alexander Nikolaev
AVAlexey G. Voloboy
Alexey G. Voloboy
The main computationally extensive task of realistic computer graphics is the calculation of global illumination. The work investigates the speed of the convergence of lighting simulation using Monte Carlo integration based on the Langevin equation. The paper presents the third part of the study. It describes the computational experiments performed with various modifications of the method. Based on the analysis of the results, it was concluded that the preconditioning matrix, which does not require calculation of the gradient of the potential, has the greatest importance for convergence. This allows one to significantly accelerate calculations.

1 January 2024 in Keldysh Institute Preprints
Verified
Preprint
Open access
ANAlexander Nikolaev
Alexander Nikolaev
SESergey Ershov
Sergey Ershov
VFVladimir Frolov
Vladimir Frolov
Our paper is devoted to the study of the Monte Carlo method based on the Langevin equation as applied to Monte Carlo rendering. We describe a simplified scene with a complex and discountinious density of contribution function, in which we evaluate the influence of the preconditioning matrix in the Langevin equation. Such a scene allows us to obtain explainable and interpretable results, which is difficult in real scenes encountered in Monte Carlo rendering. Test results demonstrate that a properly selected way to build preconditioning matrix can significantly reduce the number of steps of the Monte Carlo method, necessary to achieve the specified accuracy.

3 November 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
SESergey Ershov
Sergey Ershov
VFVladimir Frolov
Vladimir Frolov
ANAlexander Nikolaev
Alexander Nikolaev
VGVladimir Galaktionov
Vladimir Galaktionov
AVAlexey G. Voloboy
Alexey G. Voloboy
The main computationally expensive task of realistic computer graphics is the calculation of global illumination. Currently, most of the lighting simulation methods are based on various types of Monte Carlo ray tracing. One of them, the Langevin Monte Carlo ray tracing, generates samples using the time series of a system of the Langevin dynamics. The method seems to be very promising for calculating the global illumination. However, it remains poorly studied, while its analysis could significantly speed up the calculations without losing the quality of the result. In our work, we analyzed the most computationally expensive operations of this method and also conducted the computational experiments demonstrating the contribution of a particular operation to the convergence speed. One of our main conclusions is that the computationally expensive drift term can be dropped because it does not improve convergence. Another important conclution is that the preconditioning matrix makes the greatest contribution to the improvement of convergence. At the same time, calculation of this matrix is not so expensive, because it does not require calculating the gradient of the potential. The results of our study allow to significantly speed up the method.