Searcharxiv⌕ Search

arXiv subjects

Vladimir Gerdt

Publications and source records attributed to Vladimir Gerdt.

15 recordsLinked to original sources
arXiv2020

On conservative difference schemes for the many-body problem

A new approach to the construction of difference schemes of any order for the many-body problem that preserves all its algebraic integrals is proposed. We introduced additional variables, namely, distances and reciprocal distances between bodies, and wrote down a system of differential equations with respect to coordinates, velocities, and the additional variables. In this case, the system lost its Hamiltonian form, but all the classical integrals of motion of the many-body problem under consideration, as well as new integrals describing the relationship between the coordinates of the bodies and the additional variables are described by linear or quadratic polynomials in these new variables. Therefore, any symplectic Runge-Kutta scheme preserves these integrals exactly. The evidence for the proposed approach is given. To illustrate the theory, the results of numerical experiments for the three-body problem on a plane are presented with the choice of initial data corresponding to the motion of the bodies along a figure of eight (choreographic test).

math.NA↗
arXiv2018

Symbolic-Numeric Integration of the Dynamical Cosserat Equations

We devise a symbolic-numeric approach to the integration of the dynamical part of the Cosserat equations, a system of nonlinear partial differential equations describing the mechanical behavior of slender structures, like fibers and rods. This is based on our previous results on the construction of a closed form general solution to the kinematic part of the Cosserat system. Our approach combines methods of numerical exponential integration and symbolic integration of the intermediate system of nonlinear ordinary differential equations describing the dynamics of one of the arbitrary vector-functions in the general solution of the kinematic part in terms of the module of the twist vector-function. We present an experimental comparison with the well-established generalized alpha-method illustrating the computational efficiency of our approach for problems in structural mechanics.

math.AP↗
arXiv2017

Linearization of ODEs: algorithmic approach

Algorithmic approach to the problem of linearization by point transformation of ordinary differential equation of arbitrary order is presented. Test-linearization is purely algorithmic.

math.CA↗
arXiv2017

A Case Study on the Parametric Occurrence of Multiple Steady States

We consider the problem of determining multiple steady states for positive real values in models of biological networks. Investigating the potential for these in models of the mitogen-activated protein kinases (MAPK) network has consumed considerable effort using special insights into the structure of corresponding models. Here we apply combinations of symbolic computation methods for mixed equality/inequality systems, specifically virtual substitution, lazy real triangularization and cylindrical algebraic decomposition. We determine multistationarity of an 11-dimensional MAPK network when numeric values are known for all but potentially one parameter. More precisely, our considered model has 11 equations in 11 variables and 19 parameters, 3 of which are of interest for symbolic treatment, and furthermore positivity conditions on all variables and parameters.

cs.SC↗
arXiv2017

Algorithmic Verification of Linearizability for Ordinary Differential Equations

For a nonlinear ordinary differential equation solved with respect to the highest order derivative and rational in the other derivatives and in the independent variable, we devise two algorithms to check if the equation can be reduced to a linear one by a point transformation of the dependent and independent variables. The first algorithm is based on a construction of the Lie point symmetry algebra and on the computation of its derived algebra. The second algorithm exploits the differential Thomas decomposition and allows not only to test the linearizability, but also to generate a system of nonlinear partial differential equations that determines the point transformation and the coefficients of the linearized equation. Both algorithms have been implemented in Maple and their application is illustrated using several examples.

math.CA↗
arXiv2016

On the General Analytical Solution of the Kinematic Cosserat Equations

Based on a Lie symmetry analysis, we construct a closed form solution to the kinematic part of the (partial differential) Cosserat equations describing the mechanical behavior of elastic rods. The solution depends on two arbitrary analytical vector functions and is analytical everywhere except a certain domain of the independent variables in which one of the arbitrary vector functions satisfies a simple explicitly given algebraic relation. As our main theoretical result, in addition to the construction of the solution, we proof its generality. Based on this observation, a hybrid semi-analytical solver for highly viscous two-way coupled fluid-rod problems is developed which allows for the interactive high-fidelity simulations of flagellated microswimmers as a result of a substantial reduction of the numerical stiffness.

math.AP↗
arXiv2014

Constructing SU(2) x U(1) orbit space for qutrit mixed states

The orbit space $\mathfrak{P}(\mathbb{R}^8)/\mathrm{G}$, of the group $\mathrm{G}:=\mathrm{SU(2)\times U(1)}\subset\mathrm{U(3)}$ acting adjointly on the state space $\mathfrak{P}(\mathbb{R}^8)$ of a 3-level quantum system is discussed. The semi-algebraic structure of $\mathfrak{P}(\mathbb{R}^8) /\mathrm{G}$, is determined within the Procesi-Schwarz method. Using the integrity basis for the ring of G-invariant polynomials, $\mathbb{R}[\mathfrak{P}(\mathbb{R}^8)]^{\mathrm{G}}$, the set of constraints on the Casimir invariants of $\mathrm{U}(3)$ group coming from the positivity requirement of Procesi-Schwarz gradient matrix, $\mathrm{Grad}(z)\geqslant 0$, is analyzed in details.

quant-ph↗
arXiv2014

Describing orbit space of global unitary actions for mixed qudit states

The unitary $ \mathrm{U}(d)$-equivalence relation between elements of the space $\mathfrak{P}_+\,$ of mixed states of $d$-dimensional quantum system defines the orbit space $ \mathfrak{P}_+/ \mathrm{U}(d)\,$ and provides its description in terms the ring $\mathbb{R}[\mathfrak{P}_+]^{\mathrm{U}(d)}\,$ of $\mathrm{U}(d)$-invariant polynomials. We prove that the semi-algebraic structure of $ \mathfrak{P}_+/ \mathrm{U}(d)\, $ is determined completely by two basic properties of density matrices, their semi-positivity and Hermicity. Particularly, it is shown that the Processi-Schwarz inequalities in elements of integrity basis for $\mathbb{R}[\mathfrak{P}_+]^{\mathrm{U}(d)}\,$ defining the orbit space, are identically satisfied for all elements of $\mathfrak{P}_+$.

quant-ph↗
arXiv2012

Comprehensive Involutive Systems

In this paper, we consider parametric ideals and introduce a notion of comprehensive involutive system. This notion plays the same role in theory of involutive bases as the notion of comprehensive Groebner system in theory of Groebner bases. Given a parametric ideal, the space of parameters is decomposed into a finite set of cells. Each cell yields the corresponding involutive basis of the ideal for the values of parameters in that cell. Using the Gerdt-Blinkov algorithm for computing involutive bases and also the Montes algorithm for computing comprehensive Groebner systems, we present an algorithm for construction of comprehensive involutive systems. The proposed algorithm has been implemented in Maple, and we provide an illustrative example showing the step-by-step construction of comprehensive involutive system by our algorithm.

cs.SC↗
arXiv2011

Algorithmic Thomas Decomposition of Algebraic and Differential Systems

In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems, simplicity means triangularity, square-freeness and non-vanishing initials. Differential simplicity extends algebraic simplicity with involutivity. We build upon the constructive ideas of J. M. Thomas and develop them into a new algorithm for disjoint decomposition. The given paper is a revised version of a previous paper and includes the proofs of correctness and termination of our decomposition algorithm. In addition, we illustrate the algorithm with further instructive examples and describe its Maple implementation together with an experimental comparison to some other triangular decomposition algorithms.

math.AC↗
arXiv2011

Local invariants for mixed qubit-qutrit states

In the present paper few steps are undertaken towards the description of the qubit-qutrit pair - quantum bipartite system composed of two and three level subsystems. The computational difficulties with the construction of the local unitary polynomial invariants are discussed. Calculations of the Molien functions and Poincare series for the qubit-qubit and qubit-qutrit local unitary invariants are outlined and compared with the known results. The requirement of positive semi-definiteness of the density operator is formulated explicitly as a set of inequalities in five Casimir invariants of the algebra su(6).

quant-ph↗
arXiv2010

Thomas Decomposition of Algebraic and Differential Systems

In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new algorithm. For algebraic systems simplicity means triangularity, squarefreeness and non-vanishing initials. For differential systems the algorithm provides not only algebraic simplicity but also involutivity. The algorithm has been implemented in Maple.

math.AC↗
arXiv2010

On the ring of local polynomial invariants for a pair of entangled qubits

The entanglement characteristics of two qubits are encoded in the invariants of the adjoint action of SU(2) x SU(2) group on the space of density matrices defined as the space of positive semi-definite Hermitian matrices. The corresponding ring of polynomial invariants is studied. The special integrity basis for this ring is described and constraints on its elements due to the positive semi-definiteness of density matrices are given explicitly in the form of polynomial inequalities. The suggested basis is characterized by the property that only a minimal number of invariants, namely two primary invariants of degree 2, 3 and one secondary invariant of degree 4 appearing in the Hironaka decomposition of the ring are subject to the polynomial inequalities.

quant-ph↗
arXiv2003

On Exact Solvability of Anharmonic Oscillators in Large Dimensions

General Schrödinger equation is considered with a central polynomial potential depending on $2q$ arbitrary coupling constants. Its exceptional solutions of the so called Magyari type (i.e., exact bound states proportional to a polynomial of degree $N$) are sought. In any spatial dimension $D \geq 1$, this problem leads to the Magyari's system of coupled polynomial constraints, and only purely numerical solutions seem available at a generic choice of $q$ and $N$. Routinely, we solved the system by the construction of the Janet bases in a degree-reverse-lexicographical ordering, followed by their conversion into the pure lexicographical Gröbner bases. For very large $D$ we discovered that (a) the determination of the "acceptable" (which means, real) energies becomes extremely facilitated in this language; (b) the resulting univariate "secular" polynomial proved to factorize, utterly unexpectedly, in a fully non-numerical manner. This means that due to the use of the Janet bases we found a new exactly solvable class of models in quantum mechanics.

math-ph↗