Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems

We study four measures of problem instance behavior that might account for the observed differences in interior-point method (IPM) iterations when these methods are used to solve semidefinite programming (SDP) problem instances: (i) an aggregate geometry measure related to the primal and dual feasible regions (aspect ratios) and norms of the optimal solutions, (ii) the (Renegar-) condition measure C(d) of the data instance, (iii) a measure of the near-absence of strict complementarity of the optimal solution, and (iv) the level of degeneracy of the optimal solution. We compute these measures for the SDPLIB suite problem instances and measure the sample correlation (CORR) between these measures and IPM iteration counts (solved using the software SDPT3) when these measures have finite values. Our conclusions are roughly as follows: the aggregate geometry measure is highly correlated with IPM iterations (CORR = 0.901), and provides a very good explanation of IPM iterations, particularly for problem instances with solutions of small norm and aspect ratio. The condition measure C(d) is also correlated with IPM iterations, but less so than the aggregate geometry measure (CORR = 0.630). The near-absence of strict complementarity is weakly correlated with IPM iterations (CORR = 0.423). The level of degeneracy of the optimal solution is essentially uncorrelated with IPM iterations. This research has been partially supported through the MIT-Singapore Alliance.     

An algorithm for calculating the independence and vertex-cover polynomials of a graph

The independence polynomial, ω(G,x)=∑w_kx^k, of a graph, G, has coefficients, w_k, that enumerate the ways of selecting k vertices from G so that no two selected vertices share an edge. The independence number of G is the largest value of k for which w_k≠0. Little is known of less straightforward relationships between graph structure and the properties of ω(G,x), in part because of the difficulty of calculating values of w_k for specific graphs. This study presents a new algorithm for these calculations which is both faster than existing ones and easily adaptable to high-level computer languages.     

第Ⅱ类三态叠加多模叠加态光场等幂次2m+1次方Y压缩

构造了由多模虚相干态|{iZ_j}>_q、多模虚相干态的相反态|{-iZ_j}>_q和多模真空态|{O_j}>_q这三种不同的量子光场态的线性叠加所组成的第Ⅱ类三态叠加多模叠加态光场|ψ₂⁽³⁾>_q.利用多模压缩态理论,研究了态|ψ₂⁽³⁾>_q的广义非线性等幂次2m+1次方Y压缩特性.结果发现:在压缩次数N=2m+1(m=0,1,2,3,…,…)的条件下,只要各模的初始相位和态间的初始相位差分别满足一定的取值条件,态|ψ₂⁽³⁾>_q就可呈现出周期性变化的、任意奇数次的广义非线性等幂次N次方Y压缩效应.     

Thermal Stability of Sol-Gel Hydrotalcites

Sol-Gel Hydrotalcites were synthesized using magnesium ethoxide and variable aluminum sources: aluminum acetilacetonate, aluminum chloride, aluminum nitrate and aluminum sulfate; in all cases, the gelation was done at pH 10. X-ray diffraction studies show that the crystallinity depends on the aluminum precursor used. The crystallinity was found in the order aluminum acetylcetonate>aluminum chloride>aluminum nitrate>aluminum sulfate. The precursor determines the sintering behavior as well.     

三维热传导型半导体问题的交替方向有限元方法

1　引　　言三维热传导型半导体器件瞬态问题的数学模型由四个非线性偏微分方程描述[1 ,2 ] ,记 Ω为 Ω=[0 ,1 ] 3的边界 ,三维问题-Δψ =α( p -e+ N( x) ) ,　　 ( x,t)∈Ω× [0 ,T] ,( 1 .1 ) e t= . ( De( x) e-μe( x) e ψ) -R( e,p,T) ,　 ( x,t)∈Ω× ( 0 ,T] ,( 1 .2 ) p t= . ( Dp( x) p +μp( x) p ψ) -R( e,p,T) ,　 ( x,t)∈Ω× ( 0 ,T] ,( 1 .3 )ρ( x) T t-ΔT =[( Dp( x) p +μp( x) p ψ) -( De( x) e-μe( x) e ψ) ] . ψ,　　　　　　 ( x,t)∈Ω× ( 0 ,T] . ( 1 .4 )ψ( x,t) =e( x,t) =p( …     

Number of lattice points in the hyperbolic cross

An asymptotic formula for the number of points of an arbitrary lattice in the hyperbolic cross is obtained. Translated fromMatematicheskie Zametki, Vol. 63, No. 3, pp. 363–369, March, 1998. The authors wish to thank Professors N. M. Korobov and V. I. Nechaev for their attention and useful discussions.     

模糊数值函数的H-差,H-可导性和S-可导性

本文提出了区间值函数单调的概念,并利用所定义的区间值函数刻划了模糊数值函数的H-差,H-可导性和S-可导性及其相互关系.     

Riesz-Nágy singular functions revisited

In 1952 F. Riesz and Sz.-Nágy published an example of a monotonic continuous function whose derivative is zero almost everywhere, that is to say, a singular function. Besides, the function was strictly increasing. Their example was built as the limit of a sequence of deformations of the identity function. As an easy consequence of the definition, the derivative, when it existed and was finite, was found to be zero. In this paper we revisit the Riesz-Nágy family of functions and we relate it to a system for real number representation which we call (τ,τ−1)-expansions. With the help of these real number expansions we generalize the family. The singularity of the functions is proved through some metrical properties of the expansions used in their definition which also allows us to give a more precise way of determining when the derivative is 0 or infinity.     

非定常的热传导-对流问题的非线性Galerkin混合元法(Ⅲ):时间二阶精度的全离散格式

In this paper, a fully discrete format of nonlinear Galerkin mixed element method with two-step discretization of time for the non stationary conduction-convection problems is presented. The existence and the convergence of the fully discrete mixed element solution are shown. On the basis of [9] and [10], we have proved that the schemes have second-order convergence accuracy for the time discretization.     

树的四类控制参数的束缚数

图的束缚数是图的控制数研究中的一个重要方面，它在某种程度上反映了图的控制数对边数的敏感度．本文通过对图的结构特征的分析．研究了树的四类控制参数的束缚数，即控制数，强控制数，弱控制数．分数控制数的束缚数．分别给出了其紧的上界．