Programmirovanie

Media registration certificate: № 0110181 от 04.02.1993

最新一期

开放存取 开放存取  受限制的访问 ##reader.subscriptionAccessGranted##  受限制的访问 订阅存取

编号 2 (2024)

封面

完整期次

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

КОМПЬЮТЕРНАЯ АЛГЕБРА

Seminar on computer algebra in 2022–2023
Abramov S., Bogolyubskaya А.
摘要

Annual report on the work of the research seminar on computer algebra.

Programmirovanie. 2024;(2):3-6
pages 3-6 views
Computer-algebraic approach to first differential approximation: Van der Pol oscillator
Blinkov Y.
摘要

First differential approximation has been used to analyze various numerical methods for solving systems of ordinary differential equations. This has made it possible to estimate the stiffness of the ODE system that models the oscillations of the Van der Pol oscillator and the error of the method as well as to propose simple criteria for choosing a calculation step. The presented methods allow one to perform efficient calculations using computer algebra systems.

Programmirovanie. 2024;(2):7-12
pages 7-12 views
An extendable essay on the Sage computer algebra system and an editor for creating extendable essays
Bordachenkova E., Zubareva V., Panferov А.
摘要

An extendable essay is a special format of electronic texts that is more convenient for reading than hypertext. To facilitate the creation and editing of extendable essays, an editor program implemented as a web application is proposed. Using this editor, an extendable essay on the Sage computer algebra system is written. Sage seems to be a good choice for the users who are not familiar with computer algebra systems.

Programmirovanie. 2024;(2):13-21
pages 13-21 views
Integration of a degenerate system of ODEs
Bruno A., Edneral V.
摘要

The integrability of a two-dimensional autonomous polynomial system of ordinary differential equations (ODEs) with a degenerate singular point at the origin that depends on six parameters is investigated. The integrability condition for the first quasihomogeneous approximation allows one of these parameters to be fixed on a countable set of values. The further analysis is carried out for this value and five free parameters. Using the power geometry method, the system is reduced to a non-degenerate form through the blowup process. Then, the necessary conditions for its local integrability are calculated using the method of normal forms. In other words, the conditions for the parameters under which the original system is locally integrable near the degenerate stationary point are found. By resolving these conditions, we find seven twoparameter families in the five-dimensional parametric space. For parameter values from these families, the first integrals of the system are found. The cumbersome calculations that occur in the problem under consideration are carried out using computer algebra.

Programmirovanie. 2024;(2):22-32
pages 22-32 views
Constructing compartmental models of dynanic systems using a software package for symbolic computation in Julia
Demidova A., Druzhinina O., Masina O., Petrov А.
摘要

This paper considers the problem of constructing compartmental models of dynamic systems by using a software package for symbolic calculation written in Julia. The software package is aimed at unifying the formalized construction of compartmental models, taking into account the meaningful description of possible interactions among compartments and the influence of various factors on the evolution of systems. An approach to the development of the instrumental and methodological basis for modeling the dynamic systems the behavior of which can be described by one-step processes is developed. The proposed software package enables the symbolic representation of the differential equations of the model in both stochastic and deterministic cases. It is implemented in Julia and uses the Julia Symbolics computer algebra library. A comparison between the Julia Symbolics tools and some other computer algebra systems is carried out. The application of the developed software package to a compartmental model is considered. The results can be used to solve problems of constructing and studying dynamic models in natural sciences that are represented by onestep processes.

Programmirovanie. 2024;(2):33-44
pages 33-44 views
Symbolic-numerical implementation of the model of adiabatic guided modes for two-dimensional irregular waveguides
Divakov D., Tyutyunnik А., Starikov D.
摘要

In this work, a symbolic-numerical solution of Maxwell’s equations is constructed, describing the guided modes of a two-dimensional smoothly irregular waveguide in the zeroth approximation of the model of adiabatic waveguide modes. The system of linear algebraic equations obtained in this approximation is solved symbolically. The dispersion relation is solved numerically using the parameter continuation method.

Programmirovanie. 2024;(2):45-50
pages 45-50 views
Implementation of analytic projective geometry for computer graphics
Gevorkyan M., Korol’kova A., Kulyabov D., Sevast’yanov L.
摘要

In their research, the authors actively exploit different branches of geometry. For geometric constructions, computer algebra approaches and systems are used. Currently, we are interested in computer geometry, more specifically, the implementation of computer graphics. The use of the projective space and homogeneous coordinates has actually become a standard in modern computer graphics. In other words, the problem is reduced to the application of analytic projective geometry. The authors failed to find a computer algebra system that could implement projective geometry in its entirety. Therefore, it was decided to partially implement computer algebra for visualization of algebraic relations. For this purpose, the Asymptote system was employed.

Programmirovanie. 2024;(2):51-65
pages 51-65 views
Symbolic studies of Maxwell’s equations in space-time algebra formalism
Korol’kova A., Gevorkyan M., Fedorov A., Shtepa K., Kulyabov D.
摘要

Different implementations of Clifford algebra: spinors, quaternions, and geometric algebra, are used to describe physical and technical systems. The geometric algebra formalism is a relatively new approach, destined to be used primarily by engineers and applied researchers. In a number of works, the authors examined the implementation of the geometric algebra formalism for computer algebra systems. In this article, the authors extend elliptic geometric algebra to hyperbolic space-time algebra. The results are illustrated by different representations of Maxwell’s equations. Using a computer algebra system, Maxwell’s vacuum equations in the space-time algebra representation are converted to Maxwell’s equations in vector formalism. In addition to practical application, the authors would like to draw attention to the didactic significance of these studies.

Programmirovanie. 2024;(2):66-73
pages 66-73 views
On calculating partial sums of multiple numerical series by methods of Computer Algebra
Kuzovatov V., Kytmanov А., Myshkina Е.
摘要

A method to calculate partial sums of some multiple numerical series arising when searching for the resultant of a polynomial and an entire function is proposed. One can apply a symbolic algorithm that uses recurrent Newton formulas to find power sums of roots included in this formula without finding the very roots of the system. The algorithm that implements the proposed approach to calculate partial sums of multiple numerical series is implemented in Maple. Examples of using this algorithm to find partial sums of some classes of multiple numerical series are given.

Programmirovanie. 2024;(2):74-78
pages 74-78 views
Applying computer algebra systems to study Chaundy-Bullard identities for the vector partition function with weight
Leinartene A., Lyapin A.
摘要

An algorithm for obtaining the Chaundy-Bullard identity for a vector partition function with weight that uses computer algebra methods is proposed. To automate this process in Maple, an algorithm was developed and implemented that calculates the values of the vector partition function with weight by finding non-negative solutions of systems of linear Diophantine equations that are used to form the identities involved. The algorithm’s input data is represented by the set of integer vectors that form a pointed lattice cone and by some point from this cone, and the Chaundy-Bullard identity for the vector partition function with weight is its output. The code involved is stored in the depository and is ready-to-use. An example demonstrating the algorithm’s operation is given.

Programmirovanie. 2024;(2):79-83
pages 79-83 views
Primitive elements of free non-associative algebras over finite fields
Maisuradze M., Mikhalev А.
摘要

The representation of elements of free non-associative algebras as a set of multidimensional tables of coefficients is defined. An operation for finding partial derivatives for elements of free non-associative algebras in the same form is considered. Using this representation, a criterion of primitivity for elements of lengths 2 and 3 in terms of matrix ranks, as well as a primitivity test for elements of arbitrary length, is derived. This test makes it possible to estimate the number of primitive elements in free non-associative algebras with two generators over a finite field. The proposed representation allows us to optimize algorithms for symbolic computations with primitive elements. Using these algorithms, we find the number of primitive elements of length 4 in a free non-associative algebra of rank 2 over a finite field.

Programmirovanie. 2024;(2):84-92
pages 84-92 views
Port-Hamiltonian system: structure recognition and applications
Salnikov V.
摘要

In this paper, we continue to consider the problem of recovering the port-Hamiltonian structure for an arbitrary system of differential equations. We complement our previous study on this topic by explaining the choice of machine learning algorithms and discussing some details of their application. We also consider the possibility provided by this approach for a potentially new definition of canonical forms and classification of systems of differential equations.

Programmirovanie. 2024;(2):93-99
pages 93-99 views
Lower bounds for the rank of a matrix with zeros and ones outside the leading diagonal
Seliverstov A., Zverkov O.
摘要

We have found a lower bound on the rank of a square matrix, where every entry in the leading diagonal is neither zero nor one, but every entry outside the leading diagonal is either zero or one. The rank of such a matrix is at least half the order of the matrix. Under an additional condition, the lower bound is one higher. This condition means that some auxiliary system of linear equations has no binary solution. Examples are given showing the achievability of the lower bound. This lower bound on the rank allows us to reduce the problem of finding a binary solution to a system of linear equations, where the number of linearly independent equations is sufficiently large, to a similar problem in a smaller number of variables. Restrictions on the existence of a large set of solutions are found, each of which differs from binary one by the value of one variable. In addition, we discuss the possibility of certifying the absence of a binary solution to a system of a large set of linear algebraic equations. Estimates of the running time for calculating the rank of a matrix with the SymPy computer algebra system are also given. It is shown that the matrix rank over the field of residues modulo a prime number is calculated in less time than is usually required to calculate the rank of a matrix of the same order over the field of rational numbers.

Programmirovanie. 2024;(2):100-107
pages 100-107 views
Searching for laurent solutions of truncated systems of linear differential equations with the use of EG-eliminations
Ryabenko А., Khmelnov D.
摘要

Laurent solutions of systems of linear ordinary differential equations with the truncated power series coefficients are considered. The Laurent series in the solutions are also truncated. We use induced recurrent systems for constructing the solutions and have previously proposed an algorithm for the case when the induced system has a non-singular leading matrix. The algorithm finds the maximum possible number of terms of the series in the solutions that are invariant with respect to any prolongation of the original system. Below we present advances in extending our algorithm to the case when the leading matrix is singular using algorithm EG as an auxiliary tool. The implementation of the algorithm as a Maple procedure and examples of its usage are presented.

Programmirovanie. 2024;(2):108-117
pages 108-117 views
Solving rician data analysis problems: theory and numerical modeling using computer algebra metods in Wolfram Mathematica
Yakovleva T.
摘要

This paper considers theoretical foundations and mathematical methods of data analysis under the conditions of the Rice statistical distribution. The problem involves joint estimation of the signal and noise parameters. It is shown that this estimation requires the solution of a complex system of essentially nonlinear equations with two unknown variables, which implies significant computational costs. This study is aimed at mathematical optimization of computer algebra methods for numerical solution of the problem of Rician data analysis. As a result of the optimization, the solution of the system of two nonlinear equations is reduced to the solution of one equation with one unknown variable, which significantly simplifies algorithms for the numerical solution of the problem, reduces the amount of necessary computational resources, and enables the use of advanced methods for parameter estimation in information systems with priority of real-time operation. Results of numerical experiments carried out using Wolfram Mathematica confirm the effectiveness of the developed methods for two-parameter analysis of Rician data. The data analysis methods considered in this paper are useful for solving many scientific and applied problems that involve analysis of data described by the Rice statistical model.

Programmirovanie. 2024;(2):118-124
pages 118-124 views
##common.cookie##