助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   circular matrices 的翻译结果: 查询用时:0.007秒
图标索引 在分类学科中查询
所有学科
更多类别查询

图标索引 历史查询
 

circular matrices
相关语句
  循环矩阵
     A Fast Algorithm for the Inverse of r _Circular Matrices
     r-循环矩阵求逆的快速算法
短句来源
     In this paper, by using the residue class ring of polynomial ring and the diagonalization of matrixa a fast algorithm for the inverse of r _circular matrices is derived.
     本文从多项式环的剩余类环出发,利用相似矩阵的对角化,设计了r-循环矩阵求逆的快速算法
短句来源
  “circular matrices”译为未确定词的双语例句
     Nonsingularity on Two Kinds of Block Circular Matrices
     关于两类循环分块矩阵的非异性
短句来源
  相似匹配句对
     matrices.
     矩阵的谱性质。
短句来源
     F-matrices
     F-矩阵(英文)
短句来源
     On Anti-circular Matrices and Their Diagonalization
     反循环矩阵与矩阵对角化
短句来源
     Inverse Eigenvalue Problems for r- Circular Matrices
     r-循环矩阵特征值反问题
短句来源
     Circular Economy
     让循环经济转起来
短句来源
查询“circular matrices”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  circular matrices
Circular matrices, duality theorems and the reality of Clebsch-Gordan coefficients
      
The discriminant function is given when the populations are multivariate normal with different circular matrices and its distribution is derived.
      
Assuming that the covariance matrices are circular, we make an appropriate transformation which reduces the circular matrices to canonical forms.
      


The general elements of inverse matrix of z circular matrix are extracted with the help of Vandermonde's matrix, then simplified by means of the summertric polynomial σ_1, σ_2…σ_n of the "n" radical roots of the equation, x~(?)-Z=0.

本文先利用范德蒙矩阵求得Z循环矩阵逆矩阵的一般元素,然后利用方程x~(?)-z=0的n个根的对称多项式σ_1、σ_2、…、σ_n予以简化。

This paper proposes a new approach to compute the Discrete Fourier Transform(DFT)with the power of 2 length using the efficient method to decompose γ-circular matrix.its multiplications are near to that of the Preuss algorithm,aug its additions are only 75 percent of that by the preuss algorithm.The authors implement this algorithm in Fortran 77 language on Sun-SPARC Station 2,the result shows that the new algorithm is faster than the Split-Radix algorithm when the order number(N)is below 1024.If the fixed...

This paper proposes a new approach to compute the Discrete Fourier Transform(DFT)with the power of 2 length using the efficient method to decompose γ-circular matrix.its multiplications are near to that of the Preuss algorithm,aug its additions are only 75 percent of that by the preuss algorithm.The authors implement this algorithm in Fortran 77 language on Sun-SPARC Station 2,the result shows that the new algorithm is faster than the Split-Radix algorithm when the order number(N)is below 1024.If the fixed constant multiplications are further taken into account,the new algorithm will becomes more efficient.

本文介绍一种基于γ-循环阵快速分解方法的、新的基数为2的DFT快速算法;该算法与具有最小乘法数的Preuss算法比较,新算法的乘法数接近Preuss算法,但其加法数仅为它的75%。在Sun-SPARCStation2工作站上,采用Fortran77语言编程实现,结果表明:新算法在阶数(N)小于1024时,速度比分裂基(Split—Radix)算法快。如果进一步考虑算法中的固定常数乘法,那么新算法将会更加有效。

This paper presents some ways of judging matrix nonsingularity just by using the element itself and parameter r of r-block circuiar matrix and symmetric r-block circular matrix.

分别给出了只用r-循环分块矩阵及对称r-循环分块矩阵的元素本身和参数r,便可判断其非异性的八种方法。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关circular matrices的内容
在知识搜索中查有关circular matrices的内容
在数字搜索中查有关circular matrices的内容
在概念知识元中查有关circular matrices的内容
在学术趋势中查有关circular matrices的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社