Fast enclosure for the minimum norm least squares solution of the matrix equation AXB = C

Fast algorithms for enclosing the minimum norm least squares solution of the matrix equation AXB = C are proposed. To develop these algorithms, theories for obtaining error bounds of numerical solutions are established. The error bounds obtained by these algorithms are verified in the sense that all the possible rounding errors have been taken into account. Techniques for accelerating the enclosure and obtaining smaller error bounds are introduced. Numerical results show the properties of the proposed algorithms. Copyright © 2015 John Wiley & Sons, Ltd.     

Classification of Graeco‐Latin Cubes

A q‐ary code of length n, size M, and minimum distance d is called an code. An code with is said to be maximum distance separable (MDS). Here one‐error‐correcting () MDS codes are classified for small alphabets. In particular, it is shown that there are unique (5, 5³, 3)₅ and (5, 7³, 3)₇ codes and equivalence classes of (5, 8³, 3)₈ codes. The codes are equivalent to certain pairs of mutually orthogonal Latin cubes of order q, called Graeco‐Latin cubes.     

角锥棱镜谐振腔激光模式模拟研究

为了探究角锥棱镜谐振腔激光模式,以角锥-平面镜腔为例,将角锥棱镜等效为衍射光栅,考虑角锥镜棱宽在谐振腔中的衍射效应以及二面角误差引起的附加相位分布对谐振腔激光模式的影响,在光学谐振腔理论的基础上,建立了求解本征模式的理论分析模型.采用快速傅里叶法数值模拟不同腔长、角锥镜棱宽和二面角误差情况下该无源谐振腔激光输出模式分布情况.结果表明,在腔长30 cm、角锥镜棱宽小于75μm、二面角误差在-10′~5′之间时,可实现光斑完整的圆形分布输出模式,且有较好的光束质量;棱宽不小于0.4 mm,二面角误差在-40′~10′之间时,光斑为TEM 03阶横模,光场呈六瓣分布;当角锥镜棱宽为0.4 mm、二面角误差为3′,腔长从30~90 cm范围内增加时,该谐振腔输出的激光模式从TEM 03转换成TEM 10.     

Cu2O立方体的快速制备及模板法制备CuxS纳米笼子

首先以NaBH₄作为强还原剂在CuSO₄溶液中快速形成Cu₂O晶核, 然后以葡萄糖为温和的还原剂和保护剂, 由晶核生长成Cu₂O立方体, 并以其为模板制备中空的球状Cu_xS纳米笼子. 利用透射电子显微镜(TEM), 扫描电子显微镜(SEM), X射线衍射仪(XRD)和紫外-可见(UV-Vis)分光光度计对产物进行表征. 葡萄糖和铜盐的物质的量的比、加热状况、pH等反应条件影响Cu₂O的形貌. Cu_xS纳米笼子的外壳厚度由参与反应的Cu₂O和Na₂S的物质的量的比决定.     

竖壁传热对方腔内Benard对流的影响

本文采用具有QUICK差分格式的SIMPLE算法对边界竖壁传热的方腔内空气Benard对流进行了数值计算,根据计算结果探讨了竖壁传热对Benard对流的影响.计算表明,在所考虑的几何和物理条件下,所有竖壁绝热时,腔内流体形成平行与短轴的多个涡卷;竖壁存在传热时,腔内流体形成平行于长轴的两个涡卷,并且平行于长轴竖壁的传热热流方向相反时,涡卷的旋转方向也相反;垂直于长轴蛏壁的传热对近壁附近的流动有一定影响.     

Helly-type theorems for hollow axis-aligned boxes

A hollow axis-aligned box is the boundary of the cartesian product of compact intervals in . We show that for , if any of a collection of hollow axis-aligned boxes have non-empty intersection, then the whole collection has non-empty intersection; and if any of a collection of hollow axis-aligned rectangles in have non-empty intersection, then the whole collection has non-empty intersection. The values for and for are the best possible in general. We also characterize the collections of hollow boxes which would be counterexamples if were lowered to , and to , respectively.

     

Slope enclosures for functions given by two or more branches

In this paper, we consider the automatic computation of slope enclosures for continuous real functions given by two or more branches, such as piecewise defined nonsmooth functions. We show that a commonly used formula found in the literature does not always provide a slope enclosure for such functions. Furthermore, we prove a similar formula that always holds. AMS subject classification (2000)  65G20     

Dynamic data structures for fat objects and their applications

We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in or . Our planar structures are actually fitted for a more general class of objects – (β,δ)-covered objects – which are not necessarily convex, see definition below. These structures are more efficient than alternative known structures, because they exploit the fatness of the objects. We then apply these structures to obtain efficient solutions to two problems: (i) finding a perfect containment matching between a set of points and a set of convex fat objects, and (ii) finding a piercing set for a collection of convex fat objects, whose size is optimal up to some constant factor.     

On a sub-supersolution method for the prescribed mean curvature problem

The paper is about a sub-supersolution method for the prescribed mean curvature problem. We formulate the problem as a variational inequality and propose appropriate concepts of sub-and supersolutions for such inequality. Existence and enclosure results for solutions and extremal solutions between sub-and supersolutions are established.     

素数立方阶群局部传递的图

目的是研究局部传递图的性质和分类.运用置换群和陪集图的理论,获得了关于素数立方阶群局部传递图的完全分类,证明了这些图是一些互不相交的关于素数立方阶群边传递图的并.