A P-Stable Linear Multistep Method For Solving General Third Order Ordinary Differential Equations

A P-stable linear multistep method for solving general third order initial value problems of ordinary differential equations without first reducing the problems into a system of first order equations is considered. The approach for the development of this method is essentially based on collocation of the differential system generated from a basis function. A predictor for the evaluation of $y_{n+k}$ for an odd $k\ge 3$ in the main method is also proposed. The two resulting methods, the corrector and the predictor are P-stable for $k = 3$ . These as a block are tested on a number of problems to show their efficiency. When the methods (the corrector and the predictor) are evaluated at $x = x_{n+3}$ identical schemes are obtained as special cases of the methods, while the set of first and second derivatives obtained from the corrector are different from those obtained from the predictor.     

Linear Differential Operators for Polynomial Equations

Given a squarefree polynomial P ∈ k₀[ x,y ], k₀a number field, we construct a linear differential operator that allows one to calculate the genus of the complex curve defined by P =  0 (when P is absolutely irreducible), the absolute factorization of P over the algebraic closure of k₀, and calculate information concerning the Galois group of P over ___ k₀(x) as well as overk₀ (x).     

Factoring and Solving Linear Partial Differential Equations

The problem of factoring a linear partial differential operator is studied. An algorithm is designed which allows one to factor an operator when its symbol is separable, and if in addition the operator has enough right factors then it is completely reducible. Since finding the space of solutions of a completely reducible operator reduces to the same for its right factors, we apply this approach and execute a complete analysis of factoring and solving a second-order operator in two independent variables. Some results on factoring third-order operators are exhibited.AMS Subject Classifications: 35A25, 35C05, 35G05.     

Minimal Realization of Completely Decidable Linear Differential Equations

For a linear system S in total differentials (Pfaff system), proposed was a procedure of constructing its minimal realization S ₀, that is, the Pfaff vector equation such that its phase space has the least dimensionality if the set of its output functions coincides with the family of the outputs of S.     

Solving Third Order Differential Equations with Maximal Symmetry Group

The largest group of Lie symmetries that a third-order ordinary differential equation (ode) may allow has seven parameters. Equations sharing this property belong to a single equivalence class with a canonical representative v ^′′′(u)=0. Due to this simple canonical form, any equation belonging to this equivalence class may be identified in terms of certain constraints for its coefficients. Furthermore a set of equations for the transformation functions to canonical form may be set up for which large classes of solutions may be determined algorithmically. Based on these steps a solution algorithm is described for any equation with this symmetry type which resembles a similar scheme for second order equations with projective symmetry group. Received March 9, 2000; revised June 8, 2000     

Formal Solutions of Linear Ordinary Differential Equations Containing m-Hypergeometric Series

Let a linear homogeneous ordinary differential equation with polynomial coefficients over a field be given. For a singular point of the equation, the fundamental system of formal solutions that contain a finite number of power series with coefficients belonging to the algebraic extension of can be constructed by known algorithms. In this paper, an algorithm is suggested for construction of a space of formal solutions such that all series containing in these solutions have m-hypergeometric coefficients. The implementation of the algorithm in the computer algebra system Maple is discussed.     

Interior Penalties for Summation-by-Parts Discretizations of Linear Second-Order Differential Equations

This work focuses on simultaneous approximation terms (SATs) for multidimensional summation-by-parts (SBP) discretizations of linear second-order partial differential equations with variable coefficients. Through the analysis of adjoint consistency and stability, we present several conditions on the SAT penalties for general operators, including those operators that do not have nodes on their boundary or do not correspond with a collocation discontinuous Galerkin method. Based on these conditions, we generalize the modified scheme of Bassi and Rebay and the symmetric interior penalty Galerkin method to SBP-SAT discretizations. Numerical experiments are carried out on unstructured grids with triangular elements to verify the theoretical results.     

Haar小波求解线性分数阶微积分方程

分数阶微积分方程的应用逐渐受到广大研究者的重视.论文以Haar小波基函数来逼近线性分数阶微积分方程,通过数值算例的数值解与精确解进行比较,结果表明论文方法是有效的且具有较高的精度.     

基于等倾线法实现高阶非线性微分方程求解

该文提出基于二阶线性系统等倾线法绘制相平面原理，实现高阶非线性微分方程的求解，并与龙格-库塔法等解析法相比具有计算简单、结果精度高的特点。     

Equivalence Classes,Symmetries and Solutions of Linear Third-order Differential Equations

 The subject of this article are third-order differential equations that may be linearized by a variable change. To this end, at first the equivalence classes of linear equations are completely described. Thereafter it is shown how they combine into symmetry classes that are determined by the various symmetry types. An algorithm is presented allowing it to transform linearizable equations by hyperexponential transformations into linear form from which solutions may be obtained more easily. Several examples are worked out in detail. Received February 18, 2002; revised May 10, 2002 Published online: October 24, 2002     

基于δ法求解高阶时变非线性微分方程

该文基于二阶线性微分方程δ法绘制相平面原理,提出一种新颖而简单计算圆弧圆心和半径的方法实现高阶时变非线性微分方程相平面的作图,从而得到求解高阶时变非线性微分方程时域解的算法,并与龙格-库塔法等解析法相比具有计算简单、结果精度高的特点。     

Satellite Unknowns in Irreducible Differential Systems

In this paper, the concept of satellite unknowns in differential systems with selected unknowns is considered in the context of irreducible systems. It is proved that any unselected unknown in an irreducible differential system is linearly satellite for any nonempty set of selected unknowns. An algorithm for factorization of differential systems is proposed that is not always applicable but executable in polynomial time. Cases where the algorithm cannot be applied are also recognized in polynomial time.     

Local Discontinuous Galerkin Methods for Partial Differential Equations with Higher Order Derivatives

In this paper we review the existing and develop new local discontinuous Galerkin methods for solving time dependent partial differential equations with higher order derivatives in one and multiple space dimensions. We review local discontinuous Galerkin methods for convection diffusion equations involving second derivatives and for KdV type equations involving third derivatives. We then develop new local discontinuous Galerkin methods for the time dependent bi-harmonic type equations involving fourth derivatives, and partial differential equations involving fifth derivatives. For these new methods we present correct interface numerical fluxes and prove L ² stability for general nonlinear problems. Preliminary numerical examples are shown to illustrate these methods. Finally, we present new results on a post-processing technique, originally designed for methods with good negative-order error estimates, on the local discontinuous Galerkin methods applied to equations with higher derivatives. Numerical experiments show that this technique works as well for the new higher derivative cases, in effectively doubling the rate of convergence with negligible additional computational cost, for linear as well as some nonlinear problems, with a local uniform mesh.     

The Control Problem for Stage-by-Stage Changing Linear Systems of Loaded Differential Equations

We consider the control problem for stage-by-stage changing linear differential equations and the optimal control problem with a quality criterion defined for the entire time interval. We formulate necessary and sufficient conditions for complete controllability and the existence of a program control and motion. We construct an explicit form of the control action for the control problem and propose a method for solving the optimal control problem. We give a solution of the control problem for a specific loaded system.