1) minimal uniton number
极小uniton数
1.
It is proved that the minimal symplectic uniton number of φ is not larger than N,and the minimal uniton number of φ is not larger than 2N-1.
研究从连通复流形M到辛群Sp(N)的多重调和映射,将调和映射的结论推广到多重调和映射上,证明了到辛群的多重调和映射的极小辛-uniton数不大于N,而极小uniton数不大于2N-1。
2) minimal symplectic uniton number
极小辛-uniton数
1.
It is proved that the minimal symplectic uniton number of φ is not larger than N,and the minimal uniton number of φ is not larger than 2N-1.
研究从连通复流形M到辛群Sp(N)的多重调和映射,将调和映射的结论推广到多重调和映射上,证明了到辛群的多重调和映射的极小辛-uniton数不大于N,而极小uniton数不大于2N-1。
3) uniton number
uniton数
1.
By using the simplified method of factorization given by Valli, and the correspondence between the harmonic map φ∶S 2→U(N) and U(N) uniton bundle ν(φ) with energy corresponding to the bundles second Chern class, which is established by Anand, the energy in a case φ∶S 2→U(N) is investigated in order to estimate the energy of a uniton using the uniton number.
采用Valli提出的简化的因子分解方法以及Anand建立的调和映射 φ∶S2 →U(N )与U (N) uniton丛ν(φ) 之间的对应 ,其中丛ν(φ)具有和丛的第二陈类相对应的能量 ,对如何利用uniton数来估计uniton的能量进行了研究 ,证明了Uhlenbeck的因式分解也是一种借助能量减少的因式分解 ,并给出了一种利用uniton数来估计uni ton的能量的方法 。
4) least norm
范数极小
1.
In this algorithm, three objectives, such as minimum cross-entropy, least norm and maximum entropy, were combined and then a novel dynamic weight-coefficient mechanism was adopted.
算法中折衷考虑了图像重建中最小交叉熵、范数极小化以及最大熵3个目标,并建立了一种新的动态权系数迭代法。
5) minimal algebra
极小代数
1.
In this paper,A new algorithm for shortest path problem by using the minimal algebra method { R,⊕,⊙ } has been given.
定义二个运算⊕,⊙,构成一个极小代数｛R,⊕,⊙｝,在其上定义矩阵运算,将网络最短路问题的求解转化为矩阵的乘积。
2.
This paper introduces the concept of minimal algebra and explores vector s linear correlation and strong linear independence in the sense of minimal algebra.
首先引入了极小代数的概念 ,研究了极小代数意义下向量的线性相关性及强线性相关
6) Minimal multiplicity
极小重数
补充资料：数不胜数
1.数也数不清。形容很多。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条