Prefiltration technique via aggregation for constructing low‐density high‐quality factorized sparse approximate inverse preconditionings

This paper considers a new approach to a priori sparsification of the sparsity pattern of the factorized approximate inverses (FSAI) preconditioner using the so‐called vector aggregation technique. The suggested approach consists in construction of the FSAI preconditioner to the aggregated matrix with a prescribed sparsity pattern. Then small entries of the computed ‘aggregated’ FSAI preconditioning matrix are dropped, and the resulting pointwise sparsity pattern is used to construct the low‐density block sparsity pattern of the FSAI preconditioning matrix to the original matrix. This approach allows to minimize (sometimes significantly) the construction costs of low‐density high‐quality FSAI preconditioners. Numerical results with sample matrices from structural mechanics and thin shell problems are presented. Copyright © 2002 John Wiley & Sons, Ltd.     

Sparse generalized Fourier transforms

Block-diagonalization of sparse equivariant discretization matrices is studied. Such matrices typically arise when partial differential equations that evolve in symmetric geometries are discretized via the finite element method or via finite differences. By considering sparse equivariant matrices as equivariant graphs, we identify a condition for when block-diagonalization via a sparse variant of a generalized Fourier transform (GFT) becomes particularly simple and fast. Characterizations for finite element triangulations of a symmetric domain are given, and formulas for assembling the block-diagonalized matrix directly are presented. It is emphasized that the GFT preserves symmetric (Hermitian) properties of an equivariant matrix. By simulating the heat equation at the surface of a sphere discretized by an icosahedral grid, it is demonstrated that the block-diagonalization is beneficial. The gain is significant for a direct method, and modest for an iterative method. A comparison with a block-diagonalization approach based upon the continuous formulation is made. It is found that the sparse GFT method is an appropriate way to discretize the resulting continuous subsystems, since the spectrum and the symmetry are preserved. AMS subject classification (2000)  43A30, 65T99, 20B25     

统计优化迭代法测量质子交换波导折射率分布

提出了一种用于拟合测量渐变波导的折射率分布的新的理论处理。该方法把统计优化手段导入循环迭代法 ,可适用于费米函数这一类曲线变化范围大、且有多个自变量的函数。实验上用焦磷酸质子交换制备了LiNbO3波导样品 ,用该方法对退火后的折射率分布作了测量拟合 ,折射率拟合值与实验值的均方差为± 8.2× 10 - 4。     

Finite valued feedback laws and piecewise classical solutions

Often, in engineering literature, we find control systems in which the open loop inputs are piecewise constant and take values in a finite set. Such open loop inputs cause the system to have fairly regular solutions. On the other hand, when acting in closed loop, feedback laws taking values in a finite set may not be reinterpreted as open loop inputs of the considered type. In fact, pathological behaviours such as the accumulation of discontinuities may appear (Zeno phenomenon). We give some conditions which can be used as tools for building finite valued feedback laws not causing such pathological behaviours.     

Linear Ramsey numbers of sparse graphs

The Ramsey number R(G₁,G₂) of two graphs G₁ and G₂ is the least integer p so that either a graph G of order p contains a copy of G₁ or its complement G^c contains a copy of G₂. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory     

A Comparative Study on Dynamic and Static Sparsity Patterns in Parallel Sparse Approximate Inverse Preconditioning

Sparse approximate inverse (SAI) techniques have recently emerged as a new class of parallel preconditioning techniques for solving large sparse linear systems on high performance computers. The choice of the sparsity pattern of the SAI matrix is probably the most important step in constructing an SAI preconditioner. Both dynamic and static sparsity pattern selection approaches have been proposed by researchers. Through a few numerical experiments, we conduct a comparable study on the properties and performance of the SAI preconditioners using the different sparsity patterns for solving some sparse linear systems. This revised version was published online in July 2006 with corrections to the Cover Date.     

Infinite classes of anti‐mitre and 5‐sparse Steiner triple systems

In this paper, we present three constructions for anti‐mitre Steiner triple systems and a construction for 5‐sparse ones. The first construction for anti‐mitre STSs settles two of the four unsettled admissible residue classes modulo 18 and the second construction covers such a class modulo 36. The third construction generates many infinite classes of anti‐mitre STSs in the remaining possible orders. As a consequence of these three constructions we can construct anti‐mitre systems for at least 13/14 of the admissible orders. For 5‐sparse STS(υ), we give a construction for υ ≡ 1, 19 (mod 54) and υ ≠ 109. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 237–250, 2006     

一维问题的一种积分形式的流量重构算法

1引言我们考虑如下一维二阶椭圆边界值问题(-(β(x)p′)(x))′=f(x),x∈(a,b) p(a)=p(b)=0(1))其中β=β(x)是一恒正函数,且β∈H~1(a,b),f∈L~2(a,b)．事实上,在此条件下,我们可保证p∈H~2(a,b)(见[1],[2])．(1)之弱形式为：求p∈H_0~1(a,b)使得a(p,q)=(f,q),(?)q∈H_0~1(a,b),(2)其中a(p,q)=(?)_a~bβp′q′dx,(f,g)=(?)_a~bfqdx．给定(a,b)的一个分割α=x_0＜x_1＜…＜x_(n-1)＜x_n=b,令h=(?)(x_i-x_(i-1)),(?)_i表示通常相应于节点x_i的形状函数,即(?)_i是连续的分段线性函数且满足(?)_i(x_k)=δ_(ik),这里δ_(ik)=(?)i,k=0,1,…,n．又记V_h~0=span{(?)_1,(?)_2,…,(?)_(n-1)),取V_h~0作为p的逼近空间,则求解(1)的标准有限元格式为：求ph∈V_h~0使得     

FRS-XRSA与SAXS研究硬弹性聚丙烯的结晶度、取向与超结构Ⅲ应变与回复

应用全倒易空间Ｘ 射线散射理论分析（ＦＲＳ ＸＲＳＡ）与ＳＡＸＳ研究了ＨＥＰＰ在应变（ε）与回复（Ｒ）过程中结晶、取向与超结构的变化．结果指出，ε可以诱发结晶，但当ε≥３０％后，结晶度（ＸＷＣ）趋于不变：ε可以导致晶粒破碎；ε与Ｒ对取向分布与平均取向基本上无影响，这符合片晶平行分离模型，而非叶簧弯曲模型；发现，在ε≤３０％时，层状片晶的分离为主要过程，而当ε＞３０％后，则分离的片晶会发生断层滑移；ε可以诱发微孔，类似地当ε＞２０％，微孔尺寸亦趋不变．从凝聚态结构阐明了ＨＥＰＰ在ε Ｒ过程中不同阶段的结构变化     

磷钼杂多化合物脱硫热力学可行性与硫磺生成机理研究

长期以来杂多化合物一直被用作特定反应的催化剂 ,尚无直接利用其氧化还原性能进行污染物治理研究的先例 [1] .由于磷和钼在我国均为丰产元素 ,相应的杂多化合物又具有稳定的化学性能 ,寻找其新的应用领域无疑具有特别重要的意义 .本文对与此相关的脱硫热力学可行性与硫磺生成机理问题进行研究 ,以期为应用开发奠定理论基础 .1　实验部分1 .1　仪器和试剂　 31 4型硫离子选择电极 (江苏电分析仪器厂 ) ;DSC- 7型微分量热仪 (美国 Perkin-Elmer公司 ) ;Finber 1 0 0 0型能谱分析仪 (配置 Pioneer KYKY2 80 0型扫描电镜 ) ;UJ33a型电位…