TREANOR算法有病态吗?

文在计算“HL-1”两台电机并车过程时,、用了Treanor方法,且指出算法有病态现象。我们的分析是Treanor算法不存在病态现象,实际计算也表明Treanor算法可正确地描述并车过程。 描述两台双Y30°电机并车同步过程的微分方程为     

Equilibrium polymerization in a solvent: Solution on the Bethe lattice

The lattice model for equilibrium polymerization in a solvent proposed by Wheeler and Pfeuty is solved exactly on a Bethe lattice (core of a Caylay tree) with general coordination numberq. Earlier mean-field results are reobtained in the limitq, but the phase diagrams show deviations from them for finiteq. Whenq=2, our results turn into the solution of the one-dimensional problem. Although the model is solved directly, without the use of the correspondence between the equilibrium polymerization model and the diluten0 model, we verified that the latter model may also be solved on the Bethe lattice, its solution being identical to the direct solution in all parameter space. As observed in earlier studies of the puren0 vector model, the free energy is not always convex. We obtain the region of negative susceptibility for our solution and compare this result with mean field and renormalization group (-expansion) calculations.     

波矢空间中电磁场的几何相位

将电磁场作Fourier变换可把Maxwell方程组转写成为波矢空间中的Schrodinger型方程。然后采用Aharonov和Anandan关于态矢循环演变时相位变化的理论给出了波矢空间中电磁场的相位.其中包括几何相位。     

Exterior Problem for the Three-dimensional Euler Equations

A priori estimates for the exterior initial boundary value problems of the Euler equations are considered. The existence and uniqueness of a local solution is proved.     

Soliton solutions for quasilinear Schrödinger equations, II

For a class of quasilinear Schrödinger equations, we establish the existence of ground states of soliton-type solutions by a variational method.     

On the maximum principle for complete second-order elliptic operators in general domains

This paper is concerned with the maximum principle for second-order linear elliptic equations in a wide generality. By means of a geometric condition previously stressed by Berestycki-Nirenberg-Varadhan, Cabré was very able to improve the classical ABP estimate obtaining the maximum principle also in unbounded domains, such as infinite strips and open connected cones with closure different from the whole space. Now we introduce a new geometric condition that extends the result to a more general class of domains including the complements of hypersurfaces, as for instance the cut plane. The methods developed here allow us to deal with complete second-order equations, where the admissible first-order term, forced to be zero in a preceding result with Cafagna, depends on the geometry of the domain.     

Existence for nonoscillatory solutions of higher-order nonlinear neutral difference equations

In this paper, we consider the following forced higher-order nonlinear neutral difference equation

     

Convergence rates of cascade algorithms

We consider solutions of a refinement equation of the form

where is a finitely supported sequence called the refinement mask. Associated with the mask is a linear operator defined on by . This paper is concerned with the convergence of the cascade algorithm associated with , i.e., the convergence of the sequence in the -norm.

Our main result gives estimates for the convergence rate of the cascade algorithm. Let be the normalized solution of the above refinement equation with the dilation matrix being isotropic. Suppose lies in the Lipschitz space , where 0$"> and . Under appropriate conditions on , the following estimate will be established:

where and is a constant. In particular, we confirm a conjecture of A. Ron on convergence of cascade algorithms.

     

Differentiable conjugacy of the Poincaré type vector fields on

We prove that on , except for those germs of vector fields whose linear parts are conjugated to , any two Poincaré type vector fields are at least conjugated to each other provided their linear approximations have the same eigenvalues and the nonlinear parts are generic.

     

Maximum norm stability of difference schemes for parabolic equations on overset nonmatching space-time grids

In this paper, theoretical results are described on the maximum norm stability and accuracy of finite difference discretizations of parabolic equations on overset nonmatching space-time grids. We consider parabolic equations containing a linear reaction term on a space-time domain which is decomposed into an overlapping collection of cylindrical subregions of the form , for . Each of the space-time domains are assumed to be independently grided (in parallel) according to the local geometry and space-time regularity of the solution, yielding space-time grids with mesh parameters and . In particular, the different space-time grids need not match on the regions of overlap, and the time steps can differ from one grid to the next. We discretize the parabolic equation on each local grid by employing an explicit or implicit -scheme in time and a finite difference scheme in space satisfying a discrete maximum principle. The local discretizations are coupled together, without the use of Lagrange multipliers, by requiring the boundary values on each space-time grid to match a suitable interpolation of the solution on adjacent grids. The resulting global discretization yields a large system of coupled equations which can be solved by a parallel Schwarz iterative procedure requiring some communication between adjacent subregions. Our analysis employs a contraction mapping argument.

Applications of the results are briefly indicated for reaction-diffusion equations with contractive terms and heterogeneous hyperbolic-parabolic approximations of parabolic equations.