Spectrally determined growth is generic

Let be the infinitesimal generator of a -semigroup of operators in a Hilbert space. We consider the class of operators , where is bounded. It is proved that the spectrum of determines the growth of the associated semigroup for ``most" operators (in the sense of Baire category).

     

WKB-type approximations for second-order differential equations in -algebras

Rigorous asymptotic approximations of the WKB (or Liouville-Green) type are obtained for a basis of solutions to in the framework of -algebras. Both cases and are included, thus generalizing the classical theory for scalar equations developed by F.W.J. Olver to matrix as well as to infinite-dimensional equations.

     

A -functional and the rate of convergence of some linear polynomial operators

We show that the -functional

where , is equivalent to the rate of convergence of a certain linear polynomial operator. This operator stems from a Riesz-type summability process of expansion by Legendre polynomials. We use the operator above to obtain a linear polynomial approximation operator with a rate comparable to that of the best polynomial approximation.

     

Morphology and crystallization of blends of linear low density polyethylene with a semiflexible liquid crystalline polymer

The morphology and the crystallization behavior of blends of linear low density polyethylene (LLDPE) with an experimental sample of a semiflexible liquid crystalline polymer (SBH 112 by Eniricerche, Italy) have been studied by differential scanning calorimetry (DSC), polarized optical microscopy (POM) and scanning electron microscopy (SEM). The blends possess a two-phase morphology, due to immiscibility of the two components. SEM observations show that dispersion of the minor SBH phase is favored at low (相似文献   

A new algorithm for minimizing convex functions over convex sets

Let be a convex set for which there is an oracle with the following property. Given any pointz∈ℝ ⁿ the oracle returns a “Yes” ifz∈S; whereas ifz∉S then the oracle returns a “No” together with a hyperplane that separatesz fromS. The feasibility problem is the problem of finding a point inS; the convex optimization problem is the problem of minimizing a convex function overS. We present a new algorithm for the feasibility problem. The notion of a volumetric center of a polytope and a related ellipsoid of maximum volume inscribable in the polytope are central to the algorithm. Our algorithm has a significantly better global convergence rate and time complexity than the ellipsoid algorithm. The algorithm for the feasibility problem easily adapts to the convex optimization problem.     

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.     

A quadratically convergent O(\sqrt n L)-iteration algorithm for linear programming

Recently, Ye, Tapia and Zhang (1991) demonstrated that Mizuno—Todd—Ye's predictor—corrector interior-point algorithm for linear programming maintains the O( L)-iteration complexity while exhibiting superlinear convergence of the duality gap to zero under the assumption that the iteration sequence converges, and quadratic convergence of the duality gap to zero under the assumption of nondegeneracy. In this paper we establish the quadratic convergence result without any assumption concerning the convergence of the iteration sequence or nondegeneracy. This surprising result, to our knowledge, is the first instance of a demonstration of polynomiality and superlinear (or quadratic) convergence for an interior-point algorithm which does not assume the convergence of the iteration sequence or nondegeneracy.Supported in part by NSF Grant DDM-8922636 and NSF Coop. Agr. No. CCR-8809615, the Iowa Business School Summer Grant, and the Interdisciplinary Research Grant of the University of Iowa Center for Advanced Studies.Supported in part by NSF Coop. Agr. No. CCR-8809615, AFOSR 89-0363, DOE DEFG05-86ER25017 and ARO 9DAAL03-90-G-0093.Supported in part by NSF Grant DMS-9102761 and DOE Grant DE-FG05-91ER25100.     

The theoretical basis of column chromatography in multicomponent separations. Part 2: Peak capacity. Column systems with good selectivity

The selectivity of a column system, S, defined by equation 28, includes a variation coefficient (β) of plate number with capacity ratio which has a large influence on the peak capacity, as shown in Fig. 18. Some typical chromatograms are given. In order to predict S for a column system from Kovat's Index, equations 40 and 41 are given to calculate the constant of the carbon number rule for squalane at different temperatures or for different stationary phases. The specific retention value of heptane on squalane at different temperatures can be calculated from equation 42. The nonpolarity index, defined by equation 43, was used to calculate the retention value of heptane on various stationary phases. In liquid chromatography, the order of elution may be reversed by changing the composition of the eluent on the same chemically bonded silica (manufactured in China). The linear relations between the log retention values of different kinds of solutes or of a single solute on the silicas of different surface areas when using the same eluent are given.     

Determination of Pesticide Ethion by Linear Sweep Stripping Voltammetry

IntroductionOrganophosphorus pesticides( OPPs) are widelyused in agriculture as insecticides, but they are foundto contaminate agricultural products such as fruits andvegetables to variable extents. Because of their toxicproperties[1,2]and the potential r…