This paper explores the numerical intergator of ODE based on combination of Appelroth’s quadratization of dynamical systems with polynomial right-hand sides and Kahan’s discretization method. Utilizing Appelroth’s technique, we reduce any system of ordinary differential equations with a polynomial right-hand side to a quadratic form, enabling the application of Kahan’s method. In this way, we get a difference scheme defining the one-to-one correspondence between the initial and final positions of the system (Cremona map). It provides important information about the Kahan method for differential equations with a quadratic right-hand side, because we obtain dynamical systems with a quadratic right-hand side that have movable branch points. We analyze algebraic properties of solutions obtained through this approach, showing that (1) the Kahan scheme describes the branch points as poles, significantly deviating from the behavior of the exact solution of the problem near these points, and (2) it disrupts algebraic invariant variety, in particular integral relations describing the relationship between old and Appelroth’s variables. This study advances numerical methods, emphasizing the possibility of designing difference schemes whose algebraic properties differ significantly from those of the initial dynamical system.
30 September 2021 in Международный научный журнал "Современные информационные технологии и ИТ-образование"
В работе исследуется концепция технологии нарезки радиоресурса сети или т.н. «сетевого слайсинга» (Network Slicing) и особенности, связанные с внедрением данной технологии в сетях 5G. Под сетевым слайсингом авторы понимают одновременное использование несколькими арендаторами принадлежащего поставщику инфраструктуры ресурса для предоставления пользователям услуг, удовлетворяющих требованиям к качеству. Ключевым отличием сетевого слайсинга от классической концепции разделения ресурсов стало гибкое выделение ресурса в соответствии с текущей потребностью арендатора при строгом соблюдении изоляции слайсов, то есть защиты слайса каждого арендатора от всплесков нагрузки в слайсах других арендаторов. В статье представлена модель сетевого слайсинга, позволяющая анализировать влияние применения стратегий доступа к ресурсам и политик приема заявок в систему на средний доход поставщика инфраструктуры. Исследованы две стратегии управления доступом к ресурсам – «перенарезка» ресурса поставщиком инфраструктуры при каждом поступлении нового запроса пользователя (слайсинг по требованию) и «перенарезка» ресурсов через фиксированные интервалы времени (периодический слайсинг). Для каждой стратегии управления доступом рассмотрены две политики приема запроса в систему – прием запроса вне зависимости от дохода, который он принесёт арендатору (Always Admit policy), и прием только тех запросов, доход от которых превысит заранее установленный порог (Above Threshold policy). Для построенной математической модели процесса нарезки радиоресурса сети проведен численный эксперимент, иллюстрирующий зависимость среднего дохода поставщика инфраструктуры, упущенного дохода поставщика инфраструктуры для слайсинга по требованию и периодического слайсинга от структурных и нагрузочных параметров системы, в том числе, от интенсивности поступления заявок в систему и от емкости системы. Результаты численного эксперимента приведены в заключении в виде рекомендаций поставщику инфраструктуры по определению наиболее выгодной для него стратегии доступа к ресурсам и политики приема заявок в систему. The article analyses the Network slicing concept and its features associated with the implementation of this technology in 5G networks. By network slicing, the authors mean the simultaneous use of a resource owned by an infrastructure provider by several tenants to provide users with services that meet the quality of services requirements. The key difference between network slicing and the classical resource sharing concept is flexible resource allocation in accordance with the current tenant needs while strictly observing the isolation of slices, that is, protecting a slice of each tenant from load spikes in the slices of other tenants. The article presents a network slicing model that allows analyzing the impact of applying access control strategies and accept's policies on the average revenue of an infrastructure provider. Two access control strategies have been investigated - the re-slice of the resource by the infrastructure provider at each new user request (slicing on demand) and the re-slice at fixed time intervals (periodic slicing). For each access control strategy, two policies for accepting a request into the system are considered - accepting a request regardless of the revenue it will bring to the tenant ("Always Admit" policy), and accepting only those requests whose revenue exceeds a predetermined threshold ("Above Threshold" policy). For the constructed mathematical model of the process of slicing the radio resource of the network, a numerical experiment was carried out that illustrates the dependence of the average revenue of the infrastructure provider, the lost revenue of the infrastructure provider for slicing on demand and periodic slicing, on the structural and load parameters of the system, including the intensity of the incoming flow of requests in the system and on the system's capacity. The results of a numerical experiment are given in the conclusion in the form of recommendations for an infrastructure provider to determine the most profitable access control strategy and accept's policies.
15 October 2025 in Discrete and Continuous Models and Applied Computational Science
In this paper, we examine difference approximations for dynamic systems characterized by polynomial Hamiltonians, specifically focusing on cases where these approximations establish birational correspondences between the initial and final states of the system. Difference approximations are commonly used numerical methods for simulating the evolution of complex systems, and when applied to Hamiltonian dynamics, they present unique algebraic properties due to the polynomial structure of the Hamiltonian. Our approach involves analyzing the conditions under which these approximations preserve key features of the Hamiltonian system, such as energy conservation and phase-space volume preservation. By investigating the algebraic structure of the birational mappings induced by these approximations, we aim to provide insights into the stability and accuracy of numerical simulations in identifying the true behavior of Hamiltonian systems. The results offer a framework for designing efficient and accurate numerical schemes that retain essential properties of polynomial Hamiltonian systems over time.
30 April 2026 in Discrete and Continuous Models and Applied Computational Science
The article considers reversible difference schemes for dynamical systems based on the system doubling method proposed by V.N. Abrashin and S.N. Sytova. The method duplicates the original variables, leading to an extended system whose finite-difference approximation defines a birational map between time layers. The preservation of algebraic integrals in such schemes is investigated. It is proved that if the original system admits a homogeneous quadratic first integral, the corresponding bilinear form is exactly preserved by the discrete scheme. This property is demonstrated on the Jacobi oscillator, where the geometric mean of the duplicated variables ensures exact conservation of the quadratic integral. A more detailed analysis is performed on the non-trivial Vanhaecke system, an integrable Hamiltonian system with two degrees of freedom and higher-degree polynomial integrals. Numerical experiments carried out in the computer algebra system Sage using the package fdm.sage confirm that the two copies oscillate synchronously around the exact values of the first integrals, and averaging reduces the oscillation amplitude. For separable Hamiltonian systems, the scheme is shown to be symplectic. The results obtained allow recommending the doubling method for constructing stable and structure-preserving numerical integrators for a wide class of dynamical systems with polynomial right-hand sides, including high-dimensional systems.