An improved algorithm for symbolic computation of Hirota bilinear forms of KdV-type equations withlogarithmic transformations is presented.In the algorithm,the general assumption of Hirota bilinear form is successfull...An improved algorithm for symbolic computation of Hirota bilinear forms of KdV-type equations withlogarithmic transformations is presented.In the algorithm,the general assumption of Hirota bilinear form is successfullyreduced based on the property of uniformity in rank.Furthermore,we discard the integral operation in the traditionalalgorithm.The software package HBFTrans is written in Maple and its running effectiveness is tested by a variety solitonequations.展开更多
In an inner-product space, an invertible vector generates a reflection with respect to a hyperplane, and the Clifford product of several invertible vectors, called a versor in Clifford algebra, generates the compositi...In an inner-product space, an invertible vector generates a reflection with respect to a hyperplane, and the Clifford product of several invertible vectors, called a versor in Clifford algebra, generates the composition of the corresponding reflections, which is an orthogonal transformation. Given a versor in a Clifford algebra, finding another sequence of invertible vectors of strictly shorter length but whose Clifford product still equals the input versor, is called versor compression. Geometrically, versor compression is equivalent to decomposing an orthogonal transformation into a shorter sequence of reflections. This paper proposes a simple algorithm of compressing versors of symbolic form in Clifford algebra. The algorithm is based on computing the intersections of lines with planes in the corresponding Grassmann-Cayley algebra, and is complete in the case of Euclidean or Minkowski inner-product space.展开更多
In this paper, an algorithm for computing the Janet bases of linear differential equations is described, which is the differential analogue of the algorithm JanetBasis improved by Gerdt. An implementation of the algor...In this paper, an algorithm for computing the Janet bases of linear differential equations is described, which is the differential analogue of the algorithm JanetBasis improved by Gerdt. An implementation of the algorithm in Maple is given. The implemented algorithm includes some subalgorithms: Janet division, Pommaret division, the judgement of involutive divisor and reducible, the judgement of conventional divisor and reducible, involutive normal form and conventional normal form, involutive autoreduction and conventional autoreduction, PJ-autoreduction and so on. As an application, the Janet Bases of the determining system of classical Lie symmetries of some partial differential equations are obtained using our package.展开更多
基金Supported by Scientific Research Fund of Zhejiang Provincial Education Department under Grant No.20070979the National Natural Science Foundations of China under Grant Nos.10675065 and 10735030+1 种基金the Scientific Research Found of Ningbo University under Grant No.XKL09059the K.C.Wong Magana Fund in Ningbo University
文摘An improved algorithm for symbolic computation of Hirota bilinear forms of KdV-type equations withlogarithmic transformations is presented.In the algorithm,the general assumption of Hirota bilinear form is successfullyreduced based on the property of uniformity in rank.Furthermore,we discard the integral operation in the traditionalalgorithm.The software package HBFTrans is written in Maple and its running effectiveness is tested by a variety solitonequations.
文摘In an inner-product space, an invertible vector generates a reflection with respect to a hyperplane, and the Clifford product of several invertible vectors, called a versor in Clifford algebra, generates the composition of the corresponding reflections, which is an orthogonal transformation. Given a versor in a Clifford algebra, finding another sequence of invertible vectors of strictly shorter length but whose Clifford product still equals the input versor, is called versor compression. Geometrically, versor compression is equivalent to decomposing an orthogonal transformation into a shorter sequence of reflections. This paper proposes a simple algorithm of compressing versors of symbolic form in Clifford algebra. The algorithm is based on computing the intersections of lines with planes in the corresponding Grassmann-Cayley algebra, and is complete in the case of Euclidean or Minkowski inner-product space.
文摘In this paper, an algorithm for computing the Janet bases of linear differential equations is described, which is the differential analogue of the algorithm JanetBasis improved by Gerdt. An implementation of the algorithm in Maple is given. The implemented algorithm includes some subalgorithms: Janet division, Pommaret division, the judgement of involutive divisor and reducible, the judgement of conventional divisor and reducible, involutive normal form and conventional normal form, involutive autoreduction and conventional autoreduction, PJ-autoreduction and so on. As an application, the Janet Bases of the determining system of classical Lie symmetries of some partial differential equations are obtained using our package.
