可分解矩阵

词组短语

decomposable matrix

与可分解矩阵相关的网络例句 [注：此内容来源于网络，仅供参考]

In this paper,a definition of basic elementary matrix is given and the conclusion is drawn that any matrix can be resolved into limited basic primary matrix product.

给出基本初等矩阵的定义，得出任何方阵都可分解为有限个基本初等矩阵的乘积的结论。

This paper proposes s new method to construct wavelets decomposing and reconstructing matrices of wavelet coefficients without iterative calculation in symmetrical extension for finite length signal ,and correspondingly gives the base vectors and basis images of 9/7 wavelet. The matrices can be used for image-partition processing based on wavelet method.

给出了对称延拓方式下有限长信号不需逐级计算而直接得到小波系数的分解矩阵和由这些小波系数重构原信号的重构矩阵的构造方法，并给出了常用的相应于9/7小波的分解矩阵和重构矩阵及其基向量，它们可广泛用于基于小波的图像分块处理中。

The initial homography matrix is decomposed into its parameters and the non-linear optimization process adjusts these parameters using iterative process.

此矩阵可分解成其参数，并且利用非线性的最佳化方法进行调整。

A matrix which has a set of complete eigenvector system can be similar orthogonally to a diagonal one through reduce it to Jordan's normal form, and based on this property,the reducing matrix was taken as the transformation one. Thus all eigenvalues and eigenvectors of the system can be obtained.

利用具有完全特征向量系的矩阵在约化若当标准型过程中可正交相似对角矩阵的特性，将变换矩阵取为约化若当标准型过程中的分解矩阵，从而求出所求系统的特征问题的全部特征值和相应的特征向量。

In this paper, we get several properties about this kind of matrix including three adequate conditions and two contract forms according to the important properties of regular matrix and exchangeable matrix.

利用正规矩阵和乘积可交换矩阵的重要性质，给出了亚正定矩阵的三个充分条件以及其合同矩阵的两个分解形式。

The condition for the solvability of the controllers is expressed by using the coefficient matrices of the whole system.

控制器的可解性条件由系统的系数矩阵表达，因此不需要矩阵分解，可避免由矩阵分解产生的数值问题。

And three main steps of all subspace algorithms are explored. First, using an LQ-decomposition, the projection of the row space of specific data Hankel matrices is calculated. Next, the SV-decomposition of the projection is calculated to directly lead to the observability matrices and a Kalman filter estimation of the state sequences.

概括了子空间辨识算法的三个主要运算步骤：首先由LQ分解计算特定Hankel矩阵的行空间投影；再对该投影进行SVD，获取系统的可观测矩阵及状态序列的Kalman滤波器估计；最后由可观测矩阵和／或估计的状态序列确定系统矩阵。

And three main steps of all subspace algorithms are explored. First, using an LQ-decomposition, the projection of the row space of specific data Hankel matrices is calculated. Next, the SV-decomposition of the projection is calculated to directly lead to the observability matrices and a Kalman filter estimation of the state sequences. Last, the system matrices are extracted from the observability matrices and/or the estimated state sequences.

概括了子空间辨识算法的三个主要运算步骤：首先由LQ分解计算特定Hankel矩阵的行空间投影；再对该投影进行SVD，获取系统的可观测矩阵及状态序列的Kalman滤波器估计；最后由可观测矩阵和／或估计的状态序列确定系统矩阵。

In section 3, on the base of the iterative algorithm, we obtain a new iterative algorithm which is convergent to the signal faster than the old one. In section four, if the form of φ is simple and the sampling set is the integer set Z, then a direct reconstruction formula is presented.

在第二节，我们通过计算对偶框架来重建信号，这与传统的计算对偶框架方法不一样，该算法是通过计算一个矩阵的逆矩阵来计算对偶框架，当矩阵是奇异矩阵时，可通过奇异值分解方法或截断奇异值分解算法来求矩阵的广义逆矩阵。

At last ,this pater prove that the Coxeter mat rix of A has a composition of the fundamental reflections with the condition that Q has no oriented cycles.

然后利用A 的Cartan 矩阵和对称双线性型定义了A 的基本反射，并利用数学归纳法证明了在Q 无有向圈的条件下， A 的Coxeter 矩阵可分解为基本反射的乘积。

与可分解矩阵相关的网络解释 [注：此内容来源于网络，仅供参考]

decomposability：分解性

decomplexing 解络 | decomposability 分解性 | decomposable matrix 可分解矩阵

decomposable form：可分解形式

decomposability 可分解性 | decomposable form 可分解形式 | decomposable matrix 可分解矩阵

decomposable matrix：可分解矩阵

decomposable form 可分解形式 | decomposable matrix 可分解矩阵 | decomposable operator 可分解算子

decomposable operator：可分解算子

decomposable matrix 可分解矩阵 | decomposable operator 可分解算子 | decompose 分解

decomposable：可分解的

decomposable matrix 可分解矩阵 | decomposable 可分解的 | decompose 分解;腐烂