?
Ускорение итерационных методов решения линейных обратных задач на основе малорангового приближения
Журнал вычислительной математики и математической физики. 2026. Т. 66. № 1. С. 6–18.
Валиахметов Б. И., Лукьяненко Д. В., Тыртышников Е. Е.
In press
An efficient method is proposed for constructing a preconditioner for accelerated solution of systems of linear algebraic equations arising in solving linear inverse problems. The method relies on the properties of a low-rank approximation of the original system matrix and allows for a significant reduction in the number of iterations in iterative solution methods. Significant savings in computational resources can be achieved in the inverse problem of processing experimental data measured in a spatial domain separated from the domain of localization of the quantities to be reconstructed.
Osipov D., Информационно-управляющие системы 2026 № 3 С. 49–62
Introduction: In many communication systems under construction and those to be created power control and channel estimation techniques developed for the previous generation communication systems fail to provide desired precision. One way to solve this problem is to use order-statistics-based reception techniques that do not need channel estimation or power control. To ensure the desired ...
Added: July 3, 2026
Springer, 2026.
This book presents established and new research on the close connections between graph games and systems of logic, particularly existing and newly designed modal logics. The volume utilizes two graph games – the sabotage game and the hide-and-seek game – to demonstrate the natural interplay between designing new graph games and exploring new kinds of ...
Added: June 30, 2026
Pochinka O., Barinova M., Journal of Geometry and Physics 2026 Vol. 228 P. 1–8
In the present paper we consider an Ω-stable 3-diffeomorphism with a solid or thickened surfaced non-trivial basic set. Such basic sets include, for instance, all one-dimensional expanding attractors and those two-dimensional basic sets that are not expanding. We prove that the chain recurrent set of every such a diffeomorphism necessarily contains at least two non-trivial ...
Added: June 30, 2026
German O., Illarionov A., Известия РАН. Серия математическая 2026 Т. 90 № 3 С. 3–18
Пусть симплекс с целочисленными вершинами - содержащий ровно одну целочисленную точку, отличную от своих вершин. В работе доказывается, что если точка находится во внутренности симплекса или в относительной внутренности некоторой гиперграни симплекса, то объем симплекса ограничен величиной, зависящей только от размерности, в противном случае объем симплекса может быть сколь угодно большим. Этот результат применяется для вывода асимптотической формулы для среднего числа вершин полиэдров ...
Added: June 29, 2026
Netherlands: ScienceDirect, 2025.
No ...
Added: June 28, 2026
Seidel A., Weske M., Montali M. et al., Information Systems 2026 Vol. 141 Article 102728
Business process management employs process models and event logs to represent the behavior of the information systems under study. Traditional case-centric notions consider the order of activities and events in isolated process instances. The emerging field of object-centric processes challenges this assumption by putting objects in the center. Object-centric process mining and modeling approaches identify ...
Added: June 27, 2026
IEEE, 2024.
A.S. Popov Russian Science and Technical Society with support from V. A. Trapeznikov Institute of Control Sciences, V.A. Kotelnikov Institute of Radio Engineering and Electronics, Autex Ltd. is leading the ХХVIII International Conference «Digital Signal Processing and its Applications — DSPA-2024» ...
Added: June 27, 2026
Ivchenko A., Дворкович А. В., Телекоммуникации 2020 Т. 12 С. 2–11
Dynamic Adaptive Streaming over HTTP (DASH) technology powers most multimedia services. Its specific features (re-buffering, quality switching, etc.) necessitate the development of specialized methods for assessing user subjective quality of experience (QoE) based on objective parameters. This article examines the impact of various metrics on QoE and presents assessment models with Spearman correlation coefficients up ...
Added: June 27, 2026
Stanislav Morozov, Calcolo 2026 Vol. 63 No. 2 Article 23
The approximation of tensors in a low-para metric format is a crucial component in many mathematical modelling and data analysis tasks. Among the widely used low-parametric representations, the canonical polyadic (CP) decomposition is known to be very efficient. Nowadays, most algorithms for CP approximation aim to construct the approximation in the Frobenius norm; however, some ...
Added: May 22, 2026
Low-rank matrix and tensor approximations for compression of machine-learning interatomic potentials
Vorotnikov I., Romashov F., Rybin N. et al., Journal of Chemical Physics 2025 Vol. 163 No. 24 Article 244112
Machine-learning interatomic potentials (MLIPs) have become a mainstay in computationally guided materials science, surpassing traditional force fields due to their flexible functional form and superior accuracy in reproducing physical properties of materials. This flexibility is achieved through mathematically rigorous basis sets that describe interatomic interactions within a local atomic environment. The number of parameters in ...
Added: January 4, 2026
Kazeev V., Oseledets I., Maxim V. Rakhuba et al., Multiscale Modeling and Simulation 2022 Vol. 20 No. 3 P. 893–935
Homogenization in terms of multiscale limits transforms a multiscale problem with 𝑛+1n+1 asymptotically separated microscales posed on a physical domain 𝐷⊂ℝ𝑑D⊂Rd into a one-scale problem posed on a product domain of dimension (𝑛+1)𝑑(n+1)d by introducing 𝑛n so-called fast variables. This procedure allows one to convert 𝑛+1n+1 scales in 𝑑d physical dimensions into a single-scale structure in (𝑛+1)𝑑(n+1)ddimensions. We prove here that both the original, physical multiscale problem and ...
Added: October 30, 2022
Marcati C., Rakhuba M., Schwab C., Advances in Computational Mathematics 2022 Vol. 48 No. 3 Article 18
We analyze rates of approximation by quantized, tensor-structured representations of functions with isolated point singularities in ℝ3. We consider functions in countably normed Sobolev spaces with radial weights and analytic- or Gevrey-type control of weighted semi-norms. Several classes of boundary value and eigenvalue problems from science and engineering are discussed whose solutions belong to the ...
Added: October 30, 2022
Rakhuba M., SIAM Journal of Scientific Computing 2021 Vol. 43 No. 2 P. A800–A827
The aim of this paper is to propose a robust numerical solver, which is capable of efficiently solving a three-dimensional elliptic problem in a data-sparse quantized tensor format. In particular, we use the combined Tucker and quantized tensor train format (TQTT), which allows us to use astronomically large grid sizes. However, due to the ill-conditioning of discretized ...
Added: February 4, 2021
Rakhuba M., / Series math "Seminar for Applied Mathematics reports". 2019. No. 30.
The aim of this paper is to propose a robust numerical solver, which is capable of efficiently solving a three-dimensional elliptic problem in a data-sparse quantized tensor format. In particular, we use the combined Tucker and quantized tensor train format (TQTT), which allows us to use astronomically large grid sizes. However, due to ill-conditioning of discretized differential ...
Added: October 20, 2020
Oseledets I., Rakhuba M., André U., SIAM Journal on Numerical Analysis 2018 Vol. 56 No. 6 P. 3459–3479
In this note we take a new look at the local convergence of alternating optimization methods for low-rank matrices and tensors. Our abstract interpretation as sequential optimization on moving subspaces yields insightful reformulations of some known convergence conditions that focus on the interplay between the contractivity of classical multiplicative Schwarz methods with overlapping subspaces and ...
Added: October 20, 2020
Rakhuba M., Oseledets I., SIAM Journal of Scientific Computing 2018 Vol. 40 No. 2 P. A1149–A1170
In this work we generalize the Jacobi--Davidson method to the case when the eigenvector can be reshaped into a low-rank matrix. In this setting the proposed method inherits the advantages of the original Jacobi--Davidson method, has lower complexity, and requires less storage. We also introduce a low-rank version of the Rayleigh quotient iteration which naturally ...
Added: October 20, 2020