ZIB-Report
Refine
Year of publication
Document Type
- ZIB-Report (43)
Language
- English (43)
Has Fulltext
- yes (43)
Is part of the Bibliography
- no (43)
Keywords
- computer algebra (6)
- conservation laws (3)
- discrete equations (3)
- integrable systems (3)
- large polynomial systems (3)
- Computer Go (2)
- Computer algebra (2)
- Crack (2)
- Integrability (2)
- REDUCE (2)
Institute
12-32
The paper reports on a computer algebra program {\sc LSSS} (Linear Selective
Systems Solver) for solving linear algebraic systems with rational
coefficients. The program is especially efficient for very large sparse
systems that have a solution in which many variables take the value
zero. The program is applied to the symmetry investigation of a non-abelian
Laurent ODE introduced recently by M.\ Kontsevich. The computed symmetries
confirmed that a Lax pair found for this system earlier generates all first
integrals of degree at least up to 14.
08-14
10-18
11-24
We consider systems of ODEs with the right hand side being Laurent
polynomials in several non-commutative unknowns. In particular,
these unknowns could be matrices of arbitrary size. An important
example of such a system was proposed by M. Kontsevich. We prove the
integrability of the Kontsevich system by finding a Lax pair,
corresponding first integrals and commuting flows. We also provide
a pre-Hamiltonian operator which maps gradients of integrals for
the Kontsevich system to symmetries.
SC-98-05
Three different approaches for the determination of conservation laws of differential equations are presented. For three corresponding REDUCE computer algebra programs CONLAW1/2/3 the necessary subroutines are discribed. One of them simplifies general solutions of overdetermined PDE systems so that all remaining free functions and constants correspond to independent conservation laws. It determines redundant functions and constants in differential expressions and is equally useful for the determination of symmetries or the fixing of gauge freedom in differential expressions.
17-33
In this paper we report on an application of computer algebra in which mathematical puzzles are generated of a type that had been widely used in mathematics contests by a large number of participants worldwide.
The algorithmic aspect of our work provides a method to compute rational solutions of single polynomial equations that are typically large with 10^2 ... 10^5 terms and that are heavily underdetermined.
It was possible to obtain this functionality by adding a number of new modules for a new type of splitting of equations to the existing package CRACK that is normally used to solve polynomial algebraic and differential systems of equations.
00-02
An algorithm is described to decide if a given polynomial differential expression $\Delta$ of multivariate functions is exact, i.e. whether there exists a first integral $P$ such that $D_xP = \Delta$ for any one of a set of variables $x$ and to provide the integral $P$. A generalization is given to allow integration in the case that the exactness is prohibited by terms which contain only functions of not all the independent variables.
02-08
The purpose of the paper is to formulate and use syzygies for systems of linear PDEs. The computation of an equivalent of a GCD for linear partial differential operators will save us their factorization which is otherwise only possible algorithmically in special cases. After showing the computation with the new and the traditional method and comparing both in the next three sections, the algorithm is explained in general and an overview is given.
05-06
A method based on infinite parameter conservation laws is described to factor linear differential operators out of nonlinear partial differential equations (PDEs) or out of differential consequences of nonlinear PDEs. This includes a complete linearization to an equivalent linear PDE (-system) if that is possible. Infinite parameter conservation laws can be computed, for example, with the computer algebra package {\sc ConLaw}.
05-07
Quadratic Hamiltonians with a linear Lie-Poisson bracket have a number of applications in mechanics. For example, the Lie-Poisson bracket $e(3)$ includes the Euler-Poinsot model describing motion of a rigid body around a fixed point under gravity and the Kirchhoff model describes the motion of a rigid body in ideal fluid. Advances in computer algebra algorithms, in implementations and hardware, together allow the computation of Hamiltonians with higher degree first integrals providing new results in the search for integrable models. A computer algebra module enabling related computations in a 3-dimensional vector formalism is described.
02-48
The talk given by the author at the CRM workshop on Superintegrability in Sep.\ 2002 and this related paper report on work in two subjects. One is the collaboration with Vladimir Sokolov and Takayuki Tsuchida in an effort to classify polynomial integrable vector evolution equations. The other is the computer algebra package {\sc Crack} which did the main computations in solving large bi-linear algebraic systems. Although originally designed to solve over-determined systems of partial differential equations a number of extensions made {\sc Crack} a powerful tool for solving systems of bi-linear algebraic equations. Such systems turn up in many different classification problems some of which were investigated by other participants of this workshop. Two additional applications are outlined. In the talk on which this article is based a method to reduce the length of equations was presented which proved to be useful in solving the bi-linear algebraic systems. Due to numerous asked questions about the computer program, a more complete overview is given in the appendix.
08-10
The paper describes a method for solution of very large overdetermined algebraic polynomial systems on an example that appears from a classification of all integrable 3-dimensional scalar discrete quasilinear equations $Q_3=0$ on an elementary cubic cell of the lattice ${\mathbb Z}^3$. The overdetermined polynomial algebraic system that has to be solved is far too large to be formulated. A probing' technique which replaces independent variables by random integers or zero allows to formulate subsets of this system. An automatic alteration of equation formulating steps and equation solving steps leads to an iteration process that solves the computational problem.
08-15
The purpose of this paper is twofold. An immediate practical use of the presented algorithm is its applicability to the parametric solution of underdetermined linear ordinary differential equations (ODEs) with coefficients that are arbitrary analytic functions in the independent variable. A second conceptual aim is to present an algorithm that is in some sense dual to the fundamental Euclids algorithm, and thus an alternative to the special case of a Gr\"{o}bner basis algorithm as it is used for solving linear ODE-systems. In the paper Euclids algorithm and the new dual version' are compared and their complementary strengths are analysed on the task of solving underdetermined ODEs. An implementation of the described algorithm is interactively accessible at http://lie.math.brocku.ca/crack/uode.
SC-99-01
The paper compares computational aspects of four approaches to compute conservation laws of single differential equations or systems of them, ODEs and PDEs. The only restriction, required by two of the four corresponding computer algebra programs, is that each DE has to be solvable for a leading derivative. Extra constraints may be given. Examples of new conservation laws include non-polynomial expressions, an explicit variable dependence and conservation laws involving arbitrary functions. Examples involve the following equations: Ito, Liouville, Burgers, Kadomtsev-Petviashvili, Karney-Sen-Chu-Verheest, Boussinesq, Tzetzeica, Benney.
SC-95-22
In the introduction an approach to solving differential equations is motivated in which non-linear DEs are not attacked directly but properties like infinitesimal symmetries or the existence of an equivalent variational principle are investigated. In the course of such investigations overdetermined PDE-systems are generated which are to be solved (where the term `overdetermined' just stands for `more conditions than free functions'). In section 2.\ algorithms for simplifying and solving overdetermined PDE systems are given together with examples. References for more details of the corresponding program {\tt CRACK}, written by A.\ Brand and the author, are given. In sections 3.-05.\ applications of the program {\tt CRACK} are discussed. The first application is the investigation of symmetries of space-time metrics by solving Killing equations for Killing vectors and Killing tensors and their integrability conditions. A program {\tt CLASSYM} that formulates these equations, written by G.\ Grebot, is briefly described. In section 4.\ an example of the original application of {\tt CRACK} is discussed which is the determination of symmetries of a PDE system. The problem is to find the symmetries of an unusual unified field theory of gravitational and hadronic interactions. The application of symmetries with a program {\tt APPLYSYM} is the content of section 5.\ where an ODE, resulting from an attempt to generalize Weyl's class of solutions of Einsteins field equations, is solved. The final section is devoted to future work on, first, making a general PDE-solver more flexible and effective, and secondly, on applying it to more advanced applications. This section contains so far unpublished work. An example requiring the extension of {\tt CRACK} to deal with non-polynomial non-linearities results from an investigation of interior solutions of Einstein's field equations for a spherically symmetric perfect fluid in shear-free motion by H.\ Stephani. A possible future application of {\tt CRACK} is the determination of Killing tensors of higher rank. In the last sub-section an algorithm for formulating corresponding integrability conditions has been sketched. The maximal number of Killing tensors of rank $r$ in a $n$-dimensional Riemannian space has been found to be $\frac{1}{r+1}\left( ^{n + r - 1}_{\;\;\;\;\,r} \right) \left( ^{ n+r}_{\;\;\,r} \right)$.
SC-95-05
In this paper the programs {\tt APPLYSYM}, {\tt QUASILINPDE} and {\tt DETRAFO} are described which aim at the utilization of infinitesimal symmetries of differential equations. The purpose of {\tt QUASILINPDE} is the general solution of quasilinear PDEs. This procedure is used by {\tt APPLYSYM} for the application of point symmetries for either \begin{itemize} \item calculating similarity variables to perform a point transformation which lowers the order of an ODE or effectively reduces the number of explicitly occuring independent variables in a PDE(-system) or for \item generalizing given special solutions of ODEs/PDEs with new constant parameters. \end{itemize} The program {\tt DETRAFO} performs arbitrary point- and contact transformations of ODEs/PDEs and is applied if similarity and symmetry variables have been found. The program {\tt APPLYSYM} is used in connection with the program {\tt LIEPDE} for formulating and solving the conditions for point- and contact symmetries which is described in LIEPDE(1992). The actual problem solving is done in all these programs through a call to the package {\tt CRACK} for solving overdetermined PDE-systems.
SC-97-62
An algorithm is given for bringing the equations of monomial first integrals of arbitrary degree of the geodesic motion in a Riemannian space $V_n$ into the form $(F_A)_{;k} = \sum_B \Gamma_{kAB} F_B$. The $F_A$ are the components of a Killing tensor $K_{i_1\ldots i_r}$ of arbitrary rank $r$ and its symmetrized covariant derivatives. Explicit formulas are given for rank 1,2 and 3. %The maximal number of Killing tensors %(reducible + non-reducible) is found to be %$\frac{1}{r+1}\left( ^{n + r - 1}_{\;\;\;\;\,r} \right) % \left( ^{ n+r}_{\;\;\,r} \right)$. Killing tensor equations in structural form allow the formulation of algebraic integrability conditions and are supposed to be well suited for integration as it is demonstrated in the case of flat space. An alternative proof of the reducibility of these Killing tensors is given which shows the correspondence to structural equations for rank 2 Killing tensors as formulated by Hauser & Malhiot. They used tensors with different symmetry properties.
SC-98-01
SC-97-58
Killing Pairs in Flat Space
(1997)
10-13
In solving large polynomial algebraic systems that are too big for standard Gröbner basis techniques one way to make progress is to introduce case distinctions. This divide and conquer technique can be beneficial if the algorithms and computer programs know how to take advantage of inequalities. A further hurdle is the form of the resulting general solutions which often have unnecessarily many branches. In this paper we discuss a procedure to merge solutions by dropping inequalities which are associated with them and, if necessary, by re-parametrizing solutions. In the appendix the usefulness of the procedure is demonstrated in the classification of quadratic Hamiltonians with a Lie-Poisson bracket $e(3)$. This application required the solution of algebraic systems with over 200 unknowns, 450 equations and between 5000 and 9000 terms.