apw method

In the proposed algorithm by means of singular value decomposition (SVD) of a new augmented matrix and by use of a simple and practical method to deter.

通过分析噪声误差,提出采用奇异值总体最小二乘(singularvaluedecompositiontotalleastsquares,SVDTLS)算法进行间谐波频率估计,即同时考虑矩阵方程两边的噪声干扰,采用SVDTLS算法求解该情况下的最小范数解,通过对增广矩阵进行奇异值分解(singularvaluedecomposition,SVD),采用简单实用的与信噪比相关的主奇异值个数确定方法对分解的右奇异矩阵进行存储计算,得到了较精确的间谐波频率估计结果。

Propagation properties of high-order Bessel-Gaussian beam through a misaligned first-order ABCD system have been studied by using the generalized Huygens-Fresnel diffraction integral and augmented matrix.

使用广义惠更斯-菲涅耳衍射积分和增广矩阵,研究了Bessel-Gaussian光束通过失调一阶ABCD系统的传输特性。

This paper introduces an improving method of the augmented matrix and the principal propram flow chart.

介绍了一种改进的增广矩阵法和主要的程序流程图 ,可用于线性控制系统的数字仿真 ,特别适用于病态系统。

A model reference adaptive system(MRAS) controller was designed for airborne variable pressure hydraulic power system based on augmented error stability theory,and the bad effect of inaccurate system parameter evaluation without parameter online measurement on system s steady or dynamics performance was reduced.

基于增广误差稳定性理论,为机载变压力液压泵源系统设计了模型参考自适应系统控制器,减小了控制系统中因模型软参量取值不准确且难以在线检测而对系统静态性能、动态性能造成的影响,使系统能够适应软参量,包括液压油综合体积弹性模量、系统被控高压腔容积和泄漏系数的数值变化,输出压力能够稳定、较准确地跟踪给定的参考输入。

We consider Theorem 1 to be highly significant and apply it to obtaining the rank of a certain augmentation quotient group by proposing Theorem 3 and giving its complete proof.

应用具有Np-序列有限p-群的特殊性质和重量函数,基本序列等概念以及已有的一些结果,分别研究了类为1的pk(k 2)阶A bel基本p-群和类为2的p4阶基本p-群之增广商群Qn(G)的结构,得到了当n足够大时Qn(G)作为A bel基本p-群的秩。

Let G be a finite group,ZG its integral group ring and△~n(G)the nth power of the augmentation ideal△(G),denote Q_n(G)=△~n(G)/△~(n+1)(G)the augmentation quotient groups of G.

记ZG为有限群G的整群环,△~n(G)为增广理想△(G)的n次幂,Q_n(G)=△~n(G)/△~(n+1)(G)为G的增广商群。

Let G be a finite group, ZG its integral group ring and Δ~n(G) the nth power of the augmentation ideal Δ(G), denote Q_n(G)=Δ~n(G)/Δ~ n+1 (G) the augmentation quotient groups of G.

对任意有限群G的整群环ZG,设Δn(G)是ZG的n次增广理想,记Qn(G)=Δn(G)/Δn+1(G)为G的增广商群。

Afterwards the labeling method is adopted to find the augmenting chain according to the adjacency list.

然后根据邻接表采用标号法寻找增广链,在寻找过程中采用深度优先遍历和广度优先遍历的方法把点存入栈中,并用一数组保存所经过的路径。

Network maximum flow 2F algorithm,in which the selection of augmenting chain is over random,is not stable in some degree.

网络最大流的2F算法由于对增广链的选取过于随意,造成算法不稳定,效率较低。