关于CVD 矩阵的n- 宽度

本文证明了d_2k =δ_2k =d^2k ≥b_2k，其中d_2k ,δ_2k , b_2k分别表示Ａ（Ｂｌ^M_p）在ｌ^N_q下的Ｋｏｌｍｏｇｏｒｏｖ，线性，Ｂｅｒｎｓｔｅｉｎ ２ｋ－宽度，ｄ^2k 表示Ａ^Ｔ（Ｂｌ^N相似文献   

转动喇曼散射截面的群论计算

本文利用群链U(4)U(3)O(3)描述双原子分子N_2和O_2振转谱的对称性质,并利用群论方法计算了N_2和O_2分子转动喇曼散射的跃迁矩阵元,给出了它们的转动喇曼散射的截面。结果与实验较好地符合。     

关于可达矩阵的求法探讨

在《离散数学》、《图论》课程中 ,用矩阵表示图时 ,涉及到一类重要的矩阵——可达矩阵 ,它是判别图中任意两点是否有通路的重要手段 ,也是求强分图的重要方法 ,但是可达矩阵的求法比较复杂 .本文针对这一问题 ,对可达矩阵的求法进行了改进 ,提出了一种简单可行的算法 .     

Transfer matrix approach of vibration isolation analysis of periodic composite structure

The transmission properties of elastic waves propagating in a three-dimensional composite structure embedded periodically with spherical inclusions are analyzed by the transfer matrix method in this paper. Firstly, the periodic composite structures are divided into many layers, the transfer matrix of monolayer structure is deduced by the wave equations, and the transfer matrix of the entire structure is obtained in the case of boundary conditions of displacement and stress continuity between layers. Then, the effective impedance of the structure is analyzed to calculate its reflectivity and transmissivity of vibration isolation. Finally, numerical simulation is carried out; the experiment results validate the accuracy and feasibility of the method adopted in the paper and some useful conclusions are obtained. Project (No. 50075029) supported by the National Natural Science Foundation of China.     

Regularization of singular systems of linear algebraic equations by shifts

Regularization of singular systems of linear algebraic equations by shifts is examined. New equivalent conditions for the shift regularizability of such systems are derived.     

基于矩阵初等变换的n元函数极值的快速判别法

给出了 n元函数极值的一个充分条件 ,并结合矩阵的初等变换建立了 n元函数极值的一种快速判别法 ,最后给出了一个例子     

A note on the complex semi‐definite matrix Procrustes problem

This note outlines an algorithm for solving the complex ‘matrix Procrustes problem’. This is a least‐squares approximation over the cone of positive semi‐definite Hermitian matrices, which has a number of applications in the areas of Optimization, Signal Processing and Control. The work generalizes the method of Allwright (SIAM J. Control Optim. 1988; 26 (3):537–556), who obtained a numerical solution to the real‐valued version of the problem. It is shown that, subject to an appropriate rank assumption, the complex problem can be formulated in a real setting using a matrix‐dilation technique, for which the method of Allwright is applicable. However, this transformation results in an over‐parametrization of the problem and, therefore, convergence to the optimal solution is slow. Here, an alternative algorithm is developed for solving the complex problem, which exploits fully the special structure of the dilated matrix. The advantages of the modified algorithm are demonstrated via a numerical example. Copyright © 2007 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     

Adaptive application of operators in standard representation

Recently adaptive wavelet methods have been developed which can be shown to exhibit an asymptotically optimal accuracy/work balance for a wide class of variational problems including classical elliptic boundary value problems, boundary integral equations as well as certain classes of noncoercive problems such as saddle point problems. A core ingredient of these schemes is the approximate application of the involved operators in standard wavelet representation. Optimal computational complexity could be shown under the assumption that the entries in properly compressed standard representations are known or computable in average at unit cost. In this paper we propose concrete computational strategies and show under which circumstances this assumption is justified in the context of elliptic boundary value problems. Dedicated to Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 41A25, 41A46, 65F99, 65N12, 65N55. This work has been supported in part by the Deutsche Forschungsgemeinschaft SFB 401, the first and third author are supported in part by the European Community's Human Potential Programme under contract HPRN-CT-202-00286 (BREAKING COMPLEXITY). The second author acknowledges the financial support provided through the European Union's Human Potential Programme, under contract HPRN-CT-2002-00285 (HASSIP) and through DFG grant DA 360/4–1.