Ekaterina Muravleva

Dr. Ekaterina Muravleva

1. Center for Petroleum Science and Engineering, Skolkovo Institute of Science and Technology, Moscow 121205, Russia
+1

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
4 February 2022 in Physical Review E
Verified
Journal Article
Closed access
PDF file
DVDenis Volkhonskiy
Denis Volkhonskiy
Ekaterina MuravlevaEkaterina Muravleva
Ekaterina Muravleva
OSOleg Sudakov
Oleg Sudakov
DODenis Orlov
Denis Orlov
Evgeny BurnaevEvgeny Burnaev
Evgeny Burnaev
VKVladislav Krutko
Vladislav Krutko
In many branches of earth sciences, the problem of rock study on the microlevel arises. However, a significant number of representative samples is not always feasible. Thus the problem of the generation of samples with similar properties becomes actual. In this paper we propose a deep learning architecture for three-dimensional porous medium reconstruction from two-dimensional slices. We fit a distribution on all possible three-dimensional structures of a specific type based on the given data set of samples. Then, given partial information (central slices), we recover the three-dimensional structure around such slices as the most probable one according to that constructed distribution. Technically, we implement this in the form of a deep neural network with encoder, generator, and discriminator modules. Numerical experiments show that this method provides a good reconstruction in terms of Minkowski functionals.

7 July 2018 in Computational Methods in Applied Mathematics
Verified
Journal Article
Closed access
Ekaterina MuravlevaEkaterina Muravleva
Ekaterina Muravleva
IOIvan Oseledets
Ivan Oseledets
In this paper we propose an efficient algorithm to compute low-rank approximation to the solution of so-called “Laplace-like” linear systems. The idea is to transform the problem into the frequency domain, and then use cross approximation. In this case, we do not need to form explicit approximation to the inverse operator, and can approximate the solution directly, which leads to reduced complexity. We demonstrate that our method is fast and robust by using it as a solver inside Uzawa iterative method for solving the Stokes problem.

6 August 2021 in arXiv
Verified
Preprint
Open access
PDF file
DVDenis Volkhonskiy
Denis Volkhonskiy
Ekaterina MuravlevaEkaterina Muravleva
Ekaterina Muravleva
OSOleg Sudakov
Oleg Sudakov
DODenis Orlov
Denis Orlov
BBBoris Belozerov
Boris Belozerov
DKDmitry Koroteev
Dmitry Koroteev
In many branches of earth sciences, the problem of rock study on the micro-level arises. However, a significant number of representative samples is not always feasible. Thus the problem of the generation of samples with similar properties becomes actual. In this paper, we propose a novel deep learning architecture for three-dimensional porous media reconstruction from two-dimensional slices. We fit a distribution on all possible three-dimensional structures of a specific type based on the given dataset of samples. Then, given partial information (central slices), we recover the three-dimensional structure around such slices as the most probable one according to that constructed distribution. Technically, we implement this in the form of a deep neural network with encoder, generator and discriminator modules. Numerical experiments show that this method provides a good reconstruction in terms of Minkowski functionals.

20 September 2025 in arXiv
Verified
Preprint
Open access
PDF file
VTVladislav Trifonov
Vladislav Trifonov
IOIvan Oseledets
Ivan Oseledets
Ekaterina MuravlevaEkaterina Muravleva
Ekaterina Muravleva
We analyze a weighted Frobenius loss for approximating symmetric positive definite matrices in the context of preconditioning iterative solvers. Unlike the standard Frobenius norm, the weighted loss penalizes error components associated with small eigenvalues of the system matrix more strongly. Our analysis reveals that each eigenmode is scaled by the corresponding square of its eigenvalue, and that, under a fixed error budget, the loss is minimized only when the error is confined to the direction of the largest eigenvalue. This provides a rigorous explanation of why minimizing the weighted loss naturally suppresses low-frequency components, which can be a desirable strategy for the conjugate gradient method. The analysis is independent of the specific approximation scheme or sparsity pattern, and applies equally to incomplete factorizations, algebraic updates, and learning-based constructions. Numerical experiments confirm the predictions of the theory, including an illustration where sparse factors are trained by a direct gradient updates to IC(0) factor entries, i.e., no trained neural network model is used.

21 October 2023 in arXiv
Verified
Preprint
Open access
PDF file
VPVladislav Pimanov
Vladislav Pimanov
OIOleg Iliev
Oleg Iliev
IOIvan Oseledets
Ivan Oseledets
Ekaterina MuravlevaEkaterina Muravleva
Ekaterina Muravleva
If the Stokes equations are properly discretized, it is known that the Schur complement matrix is spectrally equivalent to the identity matrix. Moreover, in the case of simple geometries, it is often observed that most of its eigenvalues are equal to one. These facts form the basis for the famous Uzawa algorithm. Despite recent progress in developing efficient iterative methods for solving the Stokes problem, the Uzawa algorithm remains popular in science and engineering, especially when accelerated by Krylov subspace methods. However, in complex geometries, the Schur complement matrix can become severely ill-conditioned, having a significant portion of non-unit eigenvalues. This makes the established Uzawa preconditioner inefficient. To explain this behaviour, we examine the Pressure Schur Complement formulation for the staggered finite-difference discretization of the Stokes equations. Firstly, we conjecture that the no-slip boundary conditions are the reason for non-unit eigenvalues of the Schur complement matrix. Secondly, we demonstrate that its condition number increases with increasing the surface-to-volume ratio of the flow domain. As an alternative to the Uzawa preconditioner, we propose using the diffusive SIMPLE preconditioner for geometries with a large surface-to-volume ratio. We show that the latter is much more fast and robust for such geometries. Furthermore, we show that the usage of the SIMPLE preconditioner leads to more accurate practical computation of the permeability of tight porous media. Keywords: Stokes problem, tight geometries, computing permeability, preconditioned Krylov subspace methods

15 April 2024 in arXiv
Verified
Preprint
Open access
PDF file
DMDaniil Merkulov
Daniil Merkulov
DCDaria Cherniuk
Daria Cherniuk
ARAlexander Rudikov
Alexander Rudikov
IOIvan Oseledets
Ivan Oseledets
Ekaterina MuravlevaEkaterina Muravleva
Ekaterina Muravleva
BKBoris Kashin
Boris Kashin
In this paper, we introduce an algorithm for data quantization based on the principles of Kashin representation. This approach hinges on decomposing any given vector, matrix, or tensor into two factors. The first factor maintains a small infinity norm, while the second exhibits a similarly constrained norm when multiplied by an orthogonal matrix. Surprisingly, the entries of factors after decomposition are well-concentrated around several peaks, which allows us to efficiently replace them with corresponding centroids for quantization purposes. We study the theoretical properties of the proposed approach and rigorously evaluate our compression algorithm in the context of next-word prediction tasks and on a set of downstream tasks for text classification. Our findings demonstrate that Kashin Quantization achieves competitive or superior quality in model performance while ensuring data compression, marking a significant advancement in the field of data quantization.