微分代数方程去奇异化分析

利用去奇异化方法讨论了拟线性微分代数方程在奇点邻域内光滑解的性质.通过尺度参数的微分同胚变换,将拟线性微分代数方程转化为相应的常微分方程,从而构造出在孤立奇点邻域内的初始微分代数方程的光滑解,给出解存在的充分条件,并进一步讨论了解的性质.     

几类微分-代数方程的神经网络求解法

在非线性科学中，寻求微分方程的近似解析解一直是重要的研究课题和研究热点.利用人工神经网络原理，结合最优化方法，研究了几类微分-代数方程的近似解析解，包括指标1，2，3型Hessenberg方程及指标3型Euler-Lagrange方程，得到了方程近似解析解的表达式.通过与精确解或Runge-Kutta(龙格-库塔)数值计算结果对比，表明神经网络方法的结果有很高的精度.     

THE EXISTENCE AND UNIQUENESS OF THE SOLUTIONS OF DAES

1Intr0ducti0nDifferential-algebraicequations(DAEs)areveryusefu1inwidefields(cf.[1]).Bydifferential-algebraicequations,wemeanthoseequati0nswhosepartsof"derivative"cann0tbeexpressedexplicitly.Forexample,weconsidertheimplicitdifferentialequationwithmappingFsm00thssufficient1y.Itisusuallyreferredt0adifferential-algebraicequation(DAE)whentherank0fD.F(t,x,p)islessthann,wheretheremightbesomepurea1gebraic,whichwecallc0nstraintequations.TheDAEs,inparticular,theexistenceanduniquenessofitssolutions…     

Interval bounds on the solutions of semi-explicit index-one DAEs. Part 1: analysis

This article presents two methods for computing interval bounds on the solutions of nonlinear, semi-explicit, index-one differential-algebraic equations (DAEs). Part 1 presents theoretical developments, while Part 2 discusses implementation and numerical examples. The primary theoretical contributions are (1) an interval inclusion test for existence and uniqueness of a solution, and (2) sufficient conditions, in terms of differential inequalities, for two functions to describe componentwise upper and lower bounds on this solution, point-wise in the independent variable. The first proposed method applies these results sequentially in a two-phase algorithm analogous to validated integration methods for ordinary differential equations. The second method unifies these steps to characterize bounds as the solutions of an auxiliary system of DAEs. Efficient implementations of both are described using interval computations and demonstrated on numerical examples.     

Interval bounds on the solutions of semi-explicit index-one DAEs. Part 2: computation

This article presents two methods for computing interval bounds on the solutions of nonlinear, semi-explicit, index-one differential-algebraic equations (DAEs). Part 1 presents theoretical developments, while Part 2 discusses implementation and numerical examples. The primary theoretical contributions are (1) an interval inclusion test for existence and uniqueness of a solution, and (2) sufficient conditions, in terms of differential inequalities, for two functions to describe componentwise upper and lower bounds on this solution, point-wise in the independent variable. The first proposed method applies these results sequentially in a two-phase algorithm analogous to validated integration methods for ordinary differential equations (ODEs). The second method unifies these steps to characterize bounds as the solutions of an auxiliary system of DAEs. Efficient implementations of both are described using interval computations and demonstrated on numerical examples.     

Distributional solution theory for linear DAEs

A solution theory for switched linear differential–algebraic equations (DAEs) is developed. To allow for non–smooth coordinate transformation, the coefficients matrices may have distributional entries. Since also distributional solutions are considered it is necessary to define a suitable multiplication for distribution. This is achieved by restricting the space of distributions to the smaller space of piecewise–smooth distributions. Solution formulae for two special DAEs, distributional ordinary differential equations (ODEs) and pure distributional DAEs, are given. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Optimal Control of Differential–Algebraic Equations of Higher Index,Part 2: Necessary Optimality Conditions

This paper deals with optimal control problems described by higher index DAEs. We introduce a class of problems which can be transformed to index one control problems. For these problems we show in the accompanying paper that, if the solutions to the adjoint equations are well–defined, then the first-order approximations to the functionals defining the problem can be expressed in terms of the adjoint variables. In this paper we show that the solutions to the adjoint equations are essentially bounded measurable functions. Then, based on the first order approximations, we derive the necessary optimality conditions for the considered class of control problems. These conditions do not require the transformation of the DAEs to index-one system; however, higher-index DAEs and their associated adjoint equations have to be solved.     

Improved relaxations for the parametric solutions of ODEs using differential inequalities

A new method is described for computing nonlinear convex and concave relaxations of the solutions of parametric ordinary differential equations (ODEs). Such relaxations enable deterministic global optimization algorithms to be applied to problems with ODEs embedded, which arise in a wide variety of engineering applications. The proposed method computes relaxations as the solutions of an auxiliary system of ODEs, and a method for automatically constructing and numerically solving appropriate auxiliary ODEs is presented. This approach is similar to two existing methods, which are analyzed and shown to have undesirable properties that are avoided by the new method. Two numerical examples demonstrate that these improvements lead to significantly tighter relaxations than previous methods.     

Trajectory sensitivity analysis of hybrid systems with sliding motion

This paper concerns hybrid control systems exhibiting the sliding motion. It is assumed that the system’s motion on the switching surface is described by index-2 differential–algebraic equations (DAEs), which guarantee the accurate tracking of the sliding motion surface. For those systems the sensitivity analysis is performed with the help of solutions to system’s linearized equations. The paper states conditions under which the solutions to the linearized equations for original DAEs and the solutions to linearized equations for underlying ordinary differential equations (ODEs) exhibit similar properties. Due to the presence of sliding motion, we restrict the class of admissible control functions to piecewise differentiable functions. The presented sensitivity analysis might be useful in deriving the weak maximum principle for optimal control problems with hybrid systems exhibiting sliding motion and in establishing the global convergence of algorithms for solving those problems.     

Generalized McCormick relaxations

Convex and concave relaxations are used extensively in global optimization algorithms. Among the various techniques available for generating relaxations of a given function, McCormick’s relaxations are attractive due to the recursive nature of their definition, which affords wide applicability and easy implementation computationally. Furthermore, these relaxations are typically stronger than those resulting from convexification or linearization procedures. This article leverages the recursive nature of McCormick’s relaxations to define a generalized form which both affords a new framework within which to analyze the properties of McCormick’s relaxations, and extends the applicability of McCormick’s technique to challenging open problems in global optimization. Specifically, relaxations of the parametric solutions of ordinary differential equations are considered in detail, and prospects for relaxations of the parametric solutions of nonlinear algebraic equations are discussed. For the case of ODEs, a complete computational procedure for evaluating convex and concave relaxations of the parametric solutions is described. Through McCormick’s composition rule, these relaxations may be used to construct relaxations for very general optimal control problems.     

Averaging for switched DAEs

Switched differential-algebraic equations (switched DAEs) are suitable for modeling many practical systems, e.g. electrical circuits. When the switching is periodic and of high frequency, the question arises whether the solutions of switched DAEs can be approximated by an average non-switching system. It is well known that for a quite general class of switched ordinary differential equations (ODEs) this is the case. For switched DAEs, due the presence of the so-called consistency projectors, it is possible that the limit of trajectories for faster and faster switching does not exist. Under certain assumptions on the consistency projectors a result concerning the averaging for switched DAEs is presented. (© 2013 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

预测校正公式求解指标2微分代数方程

1．前言微分代数方程（EEES）是经常出现于实际问题中的一类方程．其数值求解已成为常微分方程数值求解领域十分活跃的一个方向．目前微分代数方程求解的数值方法主要是nunge－Kutta型方法及BDF方法．Runge－Kutta型方法在网,问中有详细的介绍．Hairer等人据此编制了软件RADAU,而目前使用最广泛的软件还是PetZold等编制的DASSL．DASSL使用的方法为BDF方法,它在微分代数方程中的应用最早可以追述到Gear的开创性工作问．BDF方法一个很大的优点是刚性稳定．然而对于非刚性的微分代数方程,刚性稳定已不是主要考虑的因素．因此…     

An efficient asymptotically correct error estimator for collocation solutions to singular index-1 DAEs

A computationally efficient a posteriori error estimator is introduced and analyzed for collocation solutions to linear index-1 DAEs (differential-algebraic equations) with properly stated leading term exhibiting a singularity of the first kind. The procedure is based on a modified defect correction principle, extending an established technique from the context of ordinary differential equations to the differential-algebraic case. Using recent convergence results for stiffly accurate collocation methods, we prove that the resulting error estimate is asymptotically correct. Numerical examples demonstrate the performance of this approach. To keep the presentation reasonably self-contained, some arguments from the literature on DAEs concerning the decoupling of the problem and its discretization, which is essential for our analysis, are also briefly reviewed. The appendix contains a remark about the interrelation between collocation and implicit Runge-Kutta methods for the DAE case.     

The computation of consistent initial values for nonlinear index-2 differential–algebraic equations

The computation of consistent initial values for differential–algebraic equations (DAEs) is essential for starting a numerical integration. Based on the tractability index concept a method is proposed to filter those equations of a system of index-2 DAEs, whose differentiation leads to an index reduction. The considered equation class covers Hessenberg-systems and the equations arising from the simulation of electrical networks by means of Modified Nodal Analysis (MNA). The index reduction provides a method for the computation of the consistent initial values. The realized algorithm is described and illustrated by examples.     

A normal form for pure differential algebraic systems

In this paper linear time-invariant differential algebraic equations (DAEs) are studied; the focus is on pure DAEs which are DAEs without an ordinary differential equation (ODE) part. A normal form for pure DAEs is given which is similar to the Byrnes-Isidori normal form for ODEs. Furthermore, the normal form exhibits a Kalman-like decomposition into impulse-controllable- and impulse-observable states. This leads to a characterization of impulse-controllability and observability.     

Completions of nonlinear DAE flows based on index reduction techniques and their stabilization

Differential algebraic equations (DAEs) define a differential equation on a manifold. A number of ways have been developed to numerically solve some classes of DAEs. Motivated by problems in control theory, numerical simulation, and the use of general purpose modeling environments, recent research has considered the embedding of the DAE solutions of a general DAE into the solutions of an ODE where the added dynamics have special properties. This paper both provides new results on the linear time-varying case and considers the important nonlinear case.     

计算微分代数系统稳定域的迭代Lyapunov函数方法

用迭代Lyapunov函数方法对微分代数系统稳定域进行了研究,根据所研究的微分代数系统形式,构造一个Lyapunov函数,然后对这个Lyapunov函数进行逐次迭代,给出了微分代数系统稳定域逐次扩大的迭代算法,数值实验表明迭代Lyapunov函数方法应用于微分代数系统稳定域的估计比单个Lyapunov函数具有良好的优越性。     

Constraint preserving integrators for general nonlinear higher index DAEs

Summary. In the last few years there has been considerable research on numerical methods for differential algebraic equations (DAEs) where is identically singular. The index provides one measure of the singularity of a DAE. Most of the numerical analysis literature on DAEs to date has dealt with DAEs with indices no larger than three. Even in this case, the systems were often assumed to have a special structure. Recently a numerical method was proposed that could, in principle, be used to integrate general unstructured higher index solvable DAEs. However, that method did not preserve constraints. This paper will discuss a modification of that approach which can be used to design constraint preserving integrators for general nonlinear higher index DAEs. Received August 25, 1993 / Revised version received April 7, 1994     

The Index of an Infinite Dimensional Implicit System

The idea of the index of a differential algebraic equation (DAE) (or implicit differential equation) has played a fundamental role in both the analysis of DAEs and the development of numerical algorithms for DAEs. DAEs frequently arise as partial discretizations of partial differential equations (PDEs). In order to relate properties of the PDE to those of the resulting DAE it is necessary to have a concept of the index of a possibly constrained PDE. Using the finite dimensional theory as motivation, this paper will examine what one appropriate analogue is for infinite dimensional systems. A general definition approach will be given motivated by the desire to consider numerical methods. Specific examples illustrating several kinds of behavior will be considered in some detail. It is seen that our definition differs from purely algebraic definitions. Numerical solutions, and simulation difficulties, can be misinterpreted if this index information is missing.     

The index of general nonlinear DAEs

Summary. In the last few years there has been considerable research on differential algebraic equations (DAEs) where is identically singular. Much of the mathematical effort has focused on computing a solution that is assumed to exist. More recently there has been some discussion of solvability of DAEs. There has historically been some imprecision in the use of the two key concepts of solvability and index for DAEs. The index is also important in control and systems theory but with different terminology. The consideration of increasingly complex nonlinear DAEs makes a clear and correct development necessary. This paper will try to clarify several points concerning the index. After establishing some new and more precise terminology that we need, some inaccuracies in the literature will be corrected. The two types of indices most frequently used, the differentiation index and the perturbation index, are defined with respect to solutions of unperturbed problems. Examples are given to show that these indices can be very different for the same problem. We define new "maximum indices," which are the maxima of earlier indices in a neighborhood of the solution over a set of perturbations and show that these indices are simply related to each other. These indices are also related to an index defined in terms of Jacobians. Received November 15, 1993 / Revised version received December 23, 1994