Computer Algebra Methods Research Articles

On Using GeoGebra and ChatGPT for Geometric Discovery

This paper explores the performance of ChatGPT and GeoGebra Discovery when dealing with automatic geometric reasoning and discovery. The emergence of Large Language Models has attracted considerable attention in mathematics, among other fields where intelligence should be present. We revisit a couple of elementary Euclidean geometry theorems discussed in the birth of Artificial Intelligence and a non-trivial inequality concerning triangles. GeoGebra succeeds in proving all these selected examples, while ChatGPT fails in one case. Our thesis is that both GeoGebra and ChatGPT could be used as complementary systems, where the natural language abilities of ChatGPT and the certified computer algebra methods in GeoGebra Discovery can cooperate in order to obtain sound and—more relevant—interesting results.

On calculating partial sums of multiple numerical series by methods of Computer Algebra

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.

Applying computer algebra systems to study Chaundy-Bullard identities for the vector partition function with weight

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.

Solving rician data analysis problems: theory and numerical modeling using computer algebra metods in Wolfram Mathematica

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.

On Calculating Partial Sums of Multiple Numerical Series by Methods of Computer Algebra

On Calculating Partial Sums of Multiple Numerical Series by Methods of Computer Algebra

Research of nonstationary dynamic models of the organizational and technological process of railway transport technical vehicles repair

The problems of analytical and computer research of dynamic models of repair and operation of technical vehicles used in railway transport are among the urgent problems related to ensuring safety and stability of traffic, with the development of digital twins and the improvement of monitoring and diagnostic systems. The analysis of models described by various types of multidimensional nonlinear differential equations requires the use of modern methods of dynamical systems theory, numerical optimization and computer algebra. The purpose of the article is to conduct a qualitative and numerical analysis of mathematical models of organizational and technological processes (OTP) in railway transport, as well as the synthesis of new controlled OTP models. Nonstationary generalizations of a two-dimensional dynamic model describing the repair process of railway transport equipment are proposed. Various cases of using constant and time-dependent parameters are considered. The case of linear and exponential dependences of parameters on time is studied. For the studied models, trajectories are obtained taking into account the variation of constant parameters and taking into account the choice of parametric dependencies, a comparative analysis of the results is presented. The formulation of the problem of optimal control of the number of repaired and repaired railway wagons is proposed. Promising methods for solving this problem using numerical optimization methods, including those inspired by nature, are described. The results can be used in the tasks of constructing and analyzing mathematical models of dynamic systems, in the tasks of numerical modeling of transport systems and technological processes, in the tasks of optimizing the number of vehicles and improving the transportation process, as well as in the tasks of creating digital counterparts in the transport industry.

Алгоритмы дискретной фильтрации на основе модифицированной взвешенной ортогонализации Грама –Шмидта для дискретных стохастических систем с мультипликативными и аддитивными шумами

Discrete-time stochastic systems with multiplicative and additive noises describe a wide class of mathematical models of complex systems, for example, industrial-technological, energy, economic, telecommunication, aerospace systems, etc. An important class of algorithms for processing measure ment information in complex systems are Kalman-type discrete-time filtering algorithms. Purpose. Construction of new discrete-time filtering algorithms for discrete-time linear systems with multiplicative and additive noises based on numerically stable modified weighted Gram – Schmidt orthogonalization (MWGS). Methodology. The methods of computational linear algebra were used, namely, the direct procedu re of MWGS-orthogonalization, the theory of Kalman filtering, methods of scientific programming in MATLAB. Findings. New LD-algorithms for discrete-time filtering in covariance and informational form for discrete-time stochastic systems with multiplicative and additive noises are constructed. The algorithms have an extended array form allowing updates for all necessary filter values. The method employs numerically stable modified weighted Gram – Schmidt orthogonalization. Algebraic equiva lence of LD-filters to Kalman-type covariance and informational algorithms for linear discrete time stochastic systems with multiplicative and additive noises is proved. The conducted numerical experiments have shown the effectiveness of the proposed algorithms using the example of solving the problem of parametric estimation of a model of almost rectilinear motion, as well as their savings in computation time compared to previously constructed UD filters. Value. New discrete-time filtering LD-algorithms can be used as a reliable computational alterna tive to the Kalman-type “standard algorithms” since they have the property being numerically stable to machine round-off errors due to the use of the MWGS orthogonalization computational procedure at each iteration of the algorithm. The results can be used to solve problems of measurement information processing in discrete-time systems with multiplicative and additive noise.

Investigation of the Influence of Constant Torque on Equilibrium Orientations of a Satellite Moving in a Circular Orbit with the Use of Computer Algebra Methods

Investigation of the Influence of Constant Torque on Equilibrium Orientations of a Satellite Moving in a Circular Orbit with the Use of Computer Algebra Methods

Investigation of the Dynamics of Two Connected Bodies in the Plane of a Circular Orbit Using Computer Algebra Methods

Investigation of the Dynamics of Two Connected Bodies in the Plane of a Circular Orbit Using Computer Algebra Methods

Computational Technology for the Basis and Coefficients of Geodynamo Spectral Models in the Maple System

Spectral models are often used in the study of geodynamo problems. Physical fields in these models are presented as stationary basic modes combinations with time-dependent amplitudes. To construct a model it is necessary to calculate the modes parameters, and to calculate the model coefficients (the Galerkin coefficients). These coefficients are integrals of complex multiplicative combinations of modes and differential operators. The paper proposes computing technology for the calculation of parameters, the derivation of integrands and the calculation of the integrals themselves. The technology is based on computer algebra methods. The main elements for implementation of technology in the Maple system are described. The proposed computational technology makes it possible to quickly and accurately construct fairly wide classes of new geodynamo spectral models.

INVESTIGATION OF THE INFLUENCE OF THE INFLUENCE OF CONSTANT TORQUE ON EQUILIBRIUM ORIENTATIONS OF A SATELLITE MOVING IN A CIRCULAR ORBIT WITH THE USE OF COMPUTER ALGERRA METHODS

Methods of computer algebra are used to investigate equilibrium orientations of a satellite moving along a circular orbit under the action of gravitational and constant torques. The main focus is placed on the investigation of equilibrium orientations in the cases where the constant torque vector is parallel to the planes formed by the principal central axes of inertia of the satellite. Using methods for Gröbner basis construction, the system of six algebraic equations that determine the equilibrium orientations of the satellite is reduced to one sixth-order algebraic equation in one unknown. Domains with equal numbers of equilibrium solutions are classified using algebraic methods for constructing discriminant hypersurfaces. Bifurcation curves in the space of problem parameters, which define the boundaries of the domains with equal numbers of equilibrium solutions, are constructed. A comparative analysis of the influence of the order of variables in the process of Gröbner basis construction is carried out. Using the proposed approach, it is shown that, under the action of the constant torque, the satellite with unequal principal central moments of inertia has no more than 24 equilibrium orientations in a circular orbit.

Reconfiguration Analysis and Characteristics of a Novel 8-Link Variable-DOF Planar Mechanism with Five Motion Modes

Variable-DOF (or kinematotropic) mechanisms are a class of reconfigurable mechanisms that have varying degrees of freedom (DOF) in different motion modes and can be reconfigured without disassembly. However, the number of proposed variable-DOF multi-loop planar mechanisms is currently limited. This paper introduces a new 8-link variable-DOF planar mechanism that has five motion modes. Firstly, the 8-link variable-DOF planar mechanism is described. Then, reconfiguration analysis of the mechanism is performed using a hybrid approach that combines elimination and computer algebraic geometry methods. The analysis reveals that the 8-link mechanism has one 2-DOF motion mode and four 1-DOF motion modes. It can switch among three motion modes at four transition configurations and between two motion modes at the remaining four transition configurations. The paper also highlights the geometric characteristics of the mechanism in different motion modes. In contrast to variable-DOF planar mechanisms presented in the literature, the proposed 8-link mechanism has two inactive joints in one of its 1-DOF motion modes. Moreover, both closed-loop 4R kinematic sub-chains of the mechanism must appear as either a pair of parallelograms or a pair of anti-parallelograms in the same motion mode. As a by-product of this research, a method for factoring trigonometric functions in two angles is also proposed.

SOLVING THE CAUCHY PROBLEM FOR A THREE-DIMENSIONAL DIFFERENCE EQUATION IN A PARALLELEPIPED

An algorithm for solving the Cauchy problem for a three-dimensional difference equation with constant coefficients by given coefficients of the difference equation and initial data in a parallelepiped. The algorithm is based on the Apanovich and Leirnartas theorems characterizing well-posedness of Cauchy problems and uses computer algebra methods to achieve computational efficiency.The algorithm is implemented in Matlab.

Learning port-Hamiltonian Systems—Algorithms

In this article we study the possibilities of recovering the structure of port-Hamiltonian systems starting from “unlabelled” ordinary differential equations describing mechanical systems. The algorithm we suggest solves the problem in two phases. It starts by constructing the connectivity structure of the system using machine learning methods – producing thus a graph of interconnected subsystems. Then this graph is enhanced by recovering the Hamiltonian structure of each subsystem as well as the corresponding ports. This second phase relies heavily on results from symplectic and Poisson geometry that we briefly sketch. And the precise solutions can be constructed using methods of computer algebra and symbolic computations. The algorithm permits to extend the port-Hamiltonian formalism to generic ordinary differential equations, hence introducing eventually a new concept of normal forms of ODEs.

Learning port-Hamiltonian Systems—Algorithms

In this article we study the possibilities of recovering the structure of port-Hamiltonian systems starting from ``unlabelled'' ordinary differential equations describing mechanical systems. The algorithm we suggest solves the problem in two phases. It starts by constructing the connectivity structure of the system using machine learning methods -- producing thus a graph of interconnected subsystems. Then this graph is enhanced by recovering the Hamiltonian structure of each subsystem as well as the corresponding ports. This second phase relies heavily on results from symplectic and Poisson geometry that we briefly sketch. And the precise solutions can be constructed using methods of computer algebra and symbolic computations. The algorithm permits to extend the port-Hamiltonian formalism to generic ordinary differential equations, hence introducing eventually a new concept of normal forms of ODEs.

Dynamic construction of a family of octic curves as geometric loci

<abstract><p>We explore the construction of curves of degree 8 (octics) appearing as geometric loci of points defined by moving points on an ellipse and its director circle. To achieve this goal we develop different computer algebra methods, dealing with trigonometric or with rational parametric representations, as well as through implicit polynomial equations, of the given curves. Finally, we highlight the involved mathematical or computational issues arising when reflecting on the outputs obtained in each case.</p></abstract>

Research into the Dynamics of a System of Two Connected Bodies Moving in the Plane of a Circular Orbit by Applying Computer Algebra Methods

Computer algebra methods are used to determine the equilibrium orientations of a system of two bodies connected by a spherical hinge that moves in a central Newtonian force field on a circular orbit under the action of gravitational torque. Primary attention is given to the study of equilibrium orientations of the two-body system in the plane of the circular orbit. By applying symbolic differentiation, differential equations of motion are derived in the form of Lagrange equations of the second kind. A method is proposed for transforming the system of trigonometric equations determining the equilibria into a system of algebraic equations, which in turn are reduced by calculating the resultant to a single algebraic equation of degree 12 in one unknown. The roots of the resulting algebraic equation determine the equilibrium orientations of the two-body system in the circular orbit plane. By applying symbolic factorization, the algebraic equation is decomposed into three polynomial factors, each specifying a certain class of equilibrium configurations. The domains with an identical number of equilibrium positions are classified using algebraic methods for constructing a discriminant hypersurface. The equations for the discriminant hypersurface determining the boundaries of domains with an identical number of equilibrium positions in the parameter space of the problem are obtained via symbolic computations of the determinant of the resultant matrix. By numerical analysis of the real roots of the resulting algebraic equations, the number of equilibrium positions of the two-body system is determined depending on the parameters.

Research into the Dynamics of a System of Two Connected Bodies Moving in the Plane of a Circular Orbit by Applying Computer Algebra Methods

Research into the Dynamics of a System of Two Connected Bodies Moving in the Plane of a Circular Orbit by Applying Computer Algebra Methods

Generalized Permutahedra and Optimal Auctions

We study a family of convex polytopes, called SIM-bodies, which were introduced by Giannakopoulos and Koutsoupias in 2018 to analyze so-called Straight-Jacket Auctions. First, we show that the SIM-bodies belong to the class of generalized permutahedra. Second, we prove an optimality result for the Straight-Jacket Auctions among certain deterministic auctions. Third, we employ computer algebra methods and mathematical software to explicitly determine optimal prices and revenues.

APPLICATION OF COMPUTER MATHEMATICS SYSTEMS FOR SOLVING PROBLEMS OF CONTACT GEOMETRY

Task. The development of research in the field of contact geometry is impossible without the use of computer mathematics systems. Carrying out a computational experiment allows not only obtaining numerical results, analytical expressions, but also highlighting the correct and promising direction in obtaining theoretical results. Purpose of the work: to consider the application of computer mathematics systems to solving problems of contact geometry. Achieving the goals set in the work is carried out on the basis of the integrated use of computer algebra methods, mathematical modeling, the theory of differential geometry and tensor analysis. Findings. In this paper, we present schemes for studying contact Lie groups of arbitrary odd dimension. An algorithm and a set of programs have been developed in the Maxima computer mathematics system for modeling the proof of the existence of Sasakian structures. Practical value. This algorithm can be used to study contact structures on homogeneous spaces. The proposed schemes are of scientific and practical interest for specialists in the field of differential geometry and methods of its applications, as well as for solving the problems of developing quantum computing devices.