Some Properties of Solutions to the Novikov Equation with Weak Dissipation Terms

In this paper, we investigate the Novikov equation with weak dissipation terms. First, we give the local well-posedness and the blow-up scenario. Then, we discuss the global existence of the solutions under certain conditions. After that, on condition that the compactly supported initial data keeps its sign, we prove the infinite propagation speed of our solutions, and establish the large time behavior. Finally, we also elaborate the persistence property of our solutions in weighted Sobolev space.     

Best interpolation in seminorm with convex constraints

Implicit and explicit characterizations of the solutions to the following constrained best interpolation problem $$\min \left\{ {\left\| {Tx - z} \right\|:x \in C \cap A^{ - 1} d} \right\}$$ are presented. Here,T is a densely-defined, closed, linear mapping from a Hilbert spaceX to a Hilbert spaceY, A: X→Z is a continuous, linear mapping withZ a locally, convex linear topological space,C is a closed, convex set in the domain domT ofT, andd∈AC. For the case in whichC is a closed, convex cone, it is shown that the constrained best interpolation problem can generally be solved by finding the saddle points of a saddle function on the whole space, and, if the explicit characterization is applicable, then solving this problem is equivalent to solving an unconstrained minimization problem for a convex function.     

Comparison of the elastic and inelastic scatterings between152Sm+12C and148 Nd+16O

Angular distributions of elastic and inelastic scattering have been measured for¹⁵²Sm+¹²C at 63.2 MeV and¹⁴⁸Nd+¹⁶O at 90.9 MeV. An evident interference pattern in the inelastic scattering has been observed for the first time in a strong Coulomb coupling system.We are indebted to Dr. S. Pieper for supplying the Ptolemy Program. One of us (Chenglie Jiang) would like to acknowledge the Argonne National Laboratory for the opportunity given, to perform theoretical calculations with the code Ptolemy during his visit there. Thanks are also due to Mr. H. Folger (GSI, Germany) for supplying the targets. This work was supported in part by China National Nature Science Fundation.     

Realization of fixed point sets

Letf:XX be a selfmap of a compact connected polyhedron, andA a nonempty closed subset ofX. In this paper, we shall deal with the question whether or not there is a mapg:XX homotopic tof such that the fixed point set Fixg ofg equalsA. We introduce a necessary condition for the existence of such a mapg. It is shown that this condition is easy to check, and hence some sufficient conditions are obtained.Partially supported by the Natural Science Foundation of Liaoning University.     

Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals

In this paper we study a particular class of primal-dual path-following methods which try to follow a trajectory of interior feasible solutions in primal-dual space toward an optimal solution to the primal and dual problem. The methods investigated are so-called first-order methods: each iteration consists of a long step along the tangent of the trajectory, followed by explicit recentering steps to get close to the trajectory again. It is shown that the complexity of these methods, which can be measured by the number of points close to the trajectory which have to be computed in order to achieve a desired gain in accuracy, is bounded by an integral along the trajectory. The integrand is a suitably weighted measure of the second derivative of the trajectory with respect to a distinguished path parameter, so the integral may be loosely called a curvature integral.