Mechanical theorem proving in the surfaces using the characteristic set method and Wronskian determinant

In this paper, we generalize the method of mechanical theorem proving in curves to prove theorems about surfaces in differential geometry with a mechanical procedure. We improve the classical result on Wronskian determinant, which can be used to decide whether the elements in a partial differential field are linearly dependent over its constant field. Based on Wronskian determinant, we can describe the geometry statements in the surfaces by an algebraic language and then prove them by the characteristic set method.     

INVARIANT ALGEBRAIC SURFACES OF SOME DYNAMICAL SYSTEM

In this paper, we study the invariant algebraic surfaces of a system, which generalizes the Lorenz system. Using the weight homogeneous polynomials and the method of characteristic curves for solving linear partial differential equations, we characterize all the Darboux invariants, the irreducible Darboux polynomials, the rational first integrals and the algebraic integrability of this system.     

Parallel algorithms for large-scale linearly constrained minimization problem

In this paper, two PVD-type algorithms are proposed for solving inseparable linear constraint optimization. Instead of computing the residual gradient function, the new algorithm uses the reduced gradients to construct the PVD directions in parallel computation, which can greatly reduce the computation amount each iteration and is closer to practical applications for solve large-scale nonlinear programming. Moreover, based on an active set computed by the coordinate rotation at each iteration, a feasible descent direction can be easily obtained by the extended reduced gradient method. The direction is then used as the PVD direction and a new PVD algorithm is proposed for the general linearly constrained optimization. And the global convergence is also proved.     

非线性系统的精确解

Based on the computerized symbolic, a new generalized tanh functions method is used for constructing exact travelling wave solutions of nonlinear partial differential equations （PDES） in a unified way. The main idea of our method is to take full advantage of an auxiliary ordinary differential equation which has more new solutions. At the same time, we present a more general transformation, which is a generalized method for finding more types of travelling wave solutions of nonlinear evolution equations （NLEEs）. More new exact travelling wave solutions to two nonlinear systems are explicitly obtained.     

Numerical scheme to solve a class of variable–order Hilfer–Prabhakar fractional differential equations with Jacobi wavelets polynomials

In this paper,we introduced a numerical approach for solving the fractional differential equations with a type of variable-order Hilfer-Prabhakar derivative of orderμ(t)andν(t).The proposed method is based on the Jacobi wavelet collocation method.According to this method,an operational matrix is constructed.We use this operational matrix of the fractional derivative of variable-order to reduce the solution of the linear fractional equations to the system of algebraic equations.Theoretical considerations are discussed.Finally,some numerical examples are presented to demonstrate the accuracy of the proposed method.     

An Implementation for the Algorithm of Janet bases of Linear Differential Ideals in the Maple System

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.     

用径向函数法求解偏微分方程

In this paper. Kansa′s method and Hermite collocation method with Radial Basis Func-tions is applied to solve partial differential equation. The resultant matrix generated from the Her-mite method is positive definite, which guarantees the reversibility of the matrix. The numerical re-sults indicate that the methods provides reversibility of the matrix. The numerical results indicatethat the method provieds an efficient algorithm for solving partial differential equations.     

Explicit One-Step P-Stable Methods for Second Order Periodic Initial Value Problems

In this paper, we present an explicit one-step method for solving periodic initial value problems of second order ordinary differential equations. The method is P-stable, and of first algebraic order and high phase-lag order. To improve the algebraic order, we give a composition second order scheme with the proposed method and its adjoint. We report some numerical results to illustrate the efficiency of our methods.     

ACCELERATION METHODS OF NONLINEAR ITERATION FOR NONLINEAR PARABOLIC EQUATIONS

This paper discusses the accelerating of nonlinear parabolic equations. Two iterative methods for solving the implicit scheme new nonlinear iterative methods named by the implicit-explicit quasi-Newton （IEQN） method and the derivative free implicit-explicit quasi-Newton （DFIEQN） method are introduced, in which the resulting linear equations from the linearization can preserve the parabolic characteristics of the original partial differential equations. It is proved that the iterative sequence of the iteration method can converge to the solution of the implicit scheme quadratically. Moreover, compared with the Jacobian Free Newton-Krylov （JFNK） method, the DFIEQN method has some advantages, e.g., its implementation is easy, and it gives a linear algebraic system with an explicit coefficient matrix, so that the linear （inner） iteration is not restricted to the Krylov method. Computational results by the IEQN, DFIEQN, JFNK and Picard iteration methods are presented in confirmation of the theory and comparison of the performance of these methods.     

On the Minimal Nonnegative Solution of Nonsymmetric Algebraic Riccati Equation

We study perturbation bound and structured condition number about the minimal nonnegative solution of nonsymmetric algebraic Riccati equation, obtaining a sharp perturbation bound and an accurate condition number. By using the matrix sign function method we present a new method for finding the minimal nonnegative solution of this algebraic Riccati equation. Based on this new method, we show how to compute the desired M-matrix solution of the quadratic matrix equation X^2 - EX - F = 0 by connecting it with the nonsymmetric algebraic Riccati equation, where E is a diagonal matrix and F is an M-matrix.     

微分多项式系统的约化算法理论

本文中，作者推广了纯代数形式的特征列集理论（吴方法）为微分形式的相应理论，即建立了在机器证明了诸多微分问题中非常重要的微分多项式组的约化算法理论。引入了一些新的概念和观点使函数微分（导数）具有直观的代数几何表示。给出了Coherent条件下的特征列集的算法。给出的算法易于在计算机上实现并适合应用于广泛的微分问题，如微分方程对称计算，各种微分关系的自动推理等问题。     

An algorithmic method for showing existence of nontrivial non-classical symmetries of partial differential equations without solving determining equations

In this paper, based on differential characteristic set theory and the associated algorithm (also called Wu?s method), an algorithmic method is presented to decide on the existence of a nontrivial non-classical symmetry of a given partial differential equation without solving the corresponding nonlinear determining system. The theory and algorithm give a partial answer for the open problem posed by P.A. Clarkson and E.L. Mansfield in [21] on non-classical symmetries of partial differential equations. As applications of our algorithm, non-classical symmetries and corresponding invariant solutions are found for several evolution equations.     

微分特征列法在拟微分算子和Lax表示中的应用

微分特征列法用于拟微分算子和非线性发展方程Lax表示的计算.首先,利用微分特征列法和微分带余除法计算拟微分算子的逆和方根,由于不必求解常微分方程组,并将解代入,因此,使得计算得以简化.其次,利用微分特征列法,约化从广义Lax方程和Zakharov-Shabat推出的非线性偏微分方程,并得到相应的非线性发展方程.在Mathematica计算机代数系统上,编写了相关程序,从而可以利用计算机辅助完成一些非线性发展方程Lax表示的计算.     

判定线性偏微分方程组解的完备性的一个符号计算方法

从微分代数的角度出发，借助于吴微分特征集理论，对于线性偏微分方程组，给出了判定它的解的完备性的一个符号计算方法。这个算法是一个机械化的算法，借助于符号计算软件Maple，可以在计算机上实现。     

Differential Elimination–Completion Algorithms for DAE and PDAE

Differential–algebraic equations (DAE) and partial differential–algebraic equations (PDAE) are systems of ordinary equations and PDAEs with constraints. They occur frequently in such applications as constrained multibody mechanics, spacecraft control, and incompressible fluid dynamics.
A DAE has differential index r if a minimum of r +1 differentiations of it are required before no new constraints are obtained. Although DAE of low differential index (0 or 1) are generally easier to solve numerically, higher index DAE present severe difficulties.
Reich et al. have presented a geometric theory and an algorithm for reducing DAE of high differential index to DAE of low differential index. Rabier and Rheinboldt also provided an existence and uniqueness theorem for DAE of low differential index. We show that for analytic autonomous first-order DAE, this algorithm is equivalent to the Cartan–Kuranishi algorithm for completing a system of differential equations to involutive form. The Cartan–Kuranishi algorithm has the advantage that it also applies to PDAE and delivers an existence and uniqueness theorem for systems in involutive form. We present an effective algorithm for computing the differential index of polynomially nonlinear DAE. A framework for the algorithmic analysis of perturbed systems of PDAE is introduced and related to the perturbation index of DAE. Examples including singular solutions, the Pendulum, and the Navier–Stokes equations are given. Discussion of computer algebra implementations is also provided.     

微分、差分方程的机械化方法

介绍了微分与差分方程机械化方法研究若干最新进展.主要结果包括: 微分、差分方程的特征列理论与算法,微分、差分方程系统的分解算法以及微分、差分方程解析解求解算法.     

基于吴方法的确定和分类(偏)微分方程古典和非古典对称新算法理论

本文基于微分形式吴方法,给出了确定和分类微分方程古典和非古典对称的统一的机械化算法理论.用该理论克服了在传统Lie算法中存在的缺陷,使确定和分类对称更系统和直接,从而扩大了对称方法的应用范围.这也是吴方法在微分领域中一个新的应用.     

Computation of differential Chow forms for ordinary prime differential ideals

In this paper, we propose algorithms for computing differential Chow forms for ordinary prime differential ideals which are given by characteristic sets. The algorithms are based on an optimal bound for the order of a prime differential ideal in terms of a characteristic set under an arbitrary ranking, which shows the Jacobi bound conjecture holds in this case. Apart from the order bound, we also give a degree bound for the differential Chow form. In addition, for a prime differential ideal given by a characteristic set under an orderly ranking, a much simpler algorithm is given to compute its differential Chow form. The computational complexity of the algorithms is single exponential in terms of the Jacobi number, the maximal degree of the differential polynomials in a characteristic set, and the number of variables.     

多项式组的特征分解

任一多项式理想的特征对是指由该理想的约化字典序Grobner基G和含于其中的极小三角列C构成的有序对(G,C).当C为正则列或正规列时,分别称特征对(G,C)为正则的或正规的.当G生成的理想与C的饱和理想相同时,称特征对(G,C)为强的.一组多项式的(强)正则或(强)正规特征分解是指将该多项式组分解为有限多个(强)正则或(强)正规特征对,使其满足特定的零点与理想关系.本文简要回顾各种三角分解及相应零点与理想分解的理论和方法,然后重点介绍(强)正则与(强)正规特征对和特征分解的性质,说明三角列、Ritt特征列和字典序Grobner基之间的内在关联,建立特征对的正则化定理以及正则、正规特征对的强化方法,进而给出两种基于字典序Grobner基计算、按伪整除关系分裂和构建、商除可除理想等策略的(强)正规与(强)正则特征分解算法.这两种算法计算所得的强正规与强正则特征对和特征分解都具有良好的性质,且能为输入多元多项式组的零点提供两种不同的表示.本文还给出示例和部分实验结果,用以说明特征分解方法及其实用性和有效性.