Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices

Incomplete LU factorization preconditioning techniques often have difficulty on indefinite sparse matrices. We present hybrid reordering strategies to deal with such matrices, which include new diagonal reorderings that are in conjunction with a symmetric nondecreasing degree algorithm. We first use the diagonal reorderings to efficiently search for entries of single element rows and columns and/or the maximum absolute value to be placed on the diagonal for computing a nonsymmetric permutation. To augment the effectiveness of the diagonal reorderings, a nondecreasing degree algorithm is applied to reduce the amount of fill-in during the ILU factorization. With the reordered matrices, we achieve a noticeable improvement in enhancing the stability of incomplete LU factorizations. Consequently, we reduce the convergence cost of the preconditioned Krylov subspace methods on solving the reordered indefinite matrices.     

IFS attractors and Cantor sets

We build a metric space which is homeomorphic to a Cantor set but cannot be realized as the attractor of an iterated function system. We give also an example of a Cantor set K in R³ such that every homeomorphism f of R³ which preserves K coincides with the identity on K.     

Bounds on the maximum numbers of clear two-factor interactions for 2^{(n_1 + n_2 ) - (k_1 + k_2 )} fractional factorial split-plot designs

Fractional factorial split-plot (FFSP) designs have an important value of investigation for their special structures. There are two types of factors in an FFSP design: the whole-plot (WP) factors and sub-plot (SP) factors, which can form three types of two-factor interactions: WP2fi, WS2fi and SP2fi. This paper considers FFSP designs with resolution III or IV under the clear effects criterion. It derives the upper and lower bounds on the maximum numbers of clear WP2fis and WS2fis for FFSP designs, and gives some methods for constructing the desired FFSP designs. It further examines the performance of the construction methods.     

Two inequalities involving Hadamard products of positive semi-definite Hermitian matrices

We extend two inequalities involving Hadamard products of positive definite Hermitian matrices to positive semi-definite Hermitian matrices. Simultaneously, we also show the sufficient conditions for equalities to hold. Moreover, some other matrix inequalities are also obtained. Our results and methods are different from those which are obtained by S. Liu in [J. Math. Anal. Appl. 243:458–463(2000)] and B.-Y. Wang et al. in [Lin. Alg. Appl. 302–303: 163–172(1999)].     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

Integral Inequalities and Global Solutions of Semilinear Evolution Equations

A criterion for the nonexplosion of solutions to semilinear evolution equations on Banach spaces is proved. The result is obtained by applying a modification of the Bihari type inequality to the case of a weakly singular nonlinear integral inequality.     

一种新型彩色三维光学成像系统

提出一种新型三维彩色光学数字成像系统。此系统利用投影结构光对现实世界中的物体进行数字化，同时得到对应的彩色纹理。详细介绍了系统的硬件设计和软件体系结构设计，得到物体彩色纹理的两种不同方法；直接获取和从编码条纹中提取，给出了用该系统得到的实验结果并简单评价了系统的性能。此系统在反求工程、影视制作、三维游戏制作、医学应用等方面有远大的应用前景。     

SiOx纳米管的制备及其发光特性

以液态金属镓为媒介,利用热蒸发法合成大量非晶SiOx纳米管,这些纳米管管径均匀分布,平均约80 nm,长度大于10μm,且管内外径比例较小．分析发现,在实验过程中,熔入金属镓液滴中的硅元素和氧元素结合并从液滴的表面饱和析出,形成以镓为中心的非晶SiOx纳米管状结构．在室温中,利用260 nm的激发光源激发SiOx纳米管,发现在蓝光波段附近发出强而稳定的PL谱线,这可能与样品中的氧缺陷和空位有关．     

A Modified Quasi-Newton Method for Structured Optimization with Partial Information on the Hessian

This paper develops a modified quasi-Newton method for structured unconstrained optimization with partial information on the Hessian, based on a better approximation to the Hessian in current search direction. The new approximation is decided by both function values and gradients at the last two iterations unlike the original one which only uses the gradients at the last two iterations. The modified method owns local and superlinear convergence. Numerical experiments show that the proposed method is encouraging comparing with the methods proposed in [4] for structured unconstrained optimization Presented at the 6th International Conference on Optimization: Techniques and Applications, Ballarat, Australia, December 9–11, 2004