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

图标索引 历史查询
 

singularity of matrix
相关语句
  “singularity of matrix”译为未确定词的双语例句
     Using MMBP inputs, we analyze the performance of multiplexer, which can be applied to voice and data modeling. The singularity of matrix is avoided with the matrix analysis method, which exaggerates the queue average length as in literatures.
     在概括了当前网络业务建模的常见方法后,我们用MMBP模型对复用器建模,并用距阵分析方法分析了它的性能(队列长度分布和截尾概率),克服了以往方法因为矩阵奇异性导致队长分布夸大的缺点,并用数值实验检验了我们的结论。
短句来源
     The most difficulty in the PIM is how to avoid the singularity of matrix.
     点插值方法最大的困难在于如何处理系数矩阵奇异。
短句来源
     Discusses the effects of singularity of matrix A-λ_i I on inverse power method convergence.
     本文的目的是分析系数矩阵A-λ_il的奇异性对带原点位移的反乘幂法收敛性的影响.
短句来源
     Compared with other interpolation methods, such as MLS and PIM, FBO overcomes the difficulties arising from the singularity of matrix and only six nodes are required to establish the approximation, so that the computational effort required is reduced.
     与其它插值或拟合方法相比,分阶拟合避免了矩阵奇异产生的困难; 与最小移动二乘法(MLS)相比,分阶拟合只需用六个点来构造二次基近似函数,减小了计算量;
短句来源
     In this method,the criterions of the singularity of matrix of partial derivative and the termination of iteration in the primary algorithm were modified on the basis of the combination of Newton’s method and homotopy method.
     随后提出了循环中点求积法改进算法:即在离散Newton法与同伦方法结合的基础上修改了原算法中关于偏导矩阵奇异的判断标准和迭代终止的判断标准。
短句来源
  相似匹配句对
     Denoising by Singularity Detection
     基于奇异性检测的信号去噪新方法
短句来源
     The Study of the Singularity Signals
     奇异信号的研究
短句来源
     Detection of Singularity Signal
     奇异性信号的检测
短句来源
     Zn-Equivariant Singularity Theory
     Z_n-等变的奇点理论
短句来源
     On the Singularity of a Bordered Matrix
     加边矩阵的奇异性问题
短句来源
查询“singularity of matrix”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


Discusses the effects of singularity of matrix A-λ_i I on inverse power method convergence.After analysis, shows the first inverse iteration is fast-convergent for any matrix, and the second inverse iteration does not achieve fast-convergence for ill-conditioned or defective matrix.

本文的目的是分析系数矩阵A-λ_il的奇异性对带原点位移的反乘幂法收敛性的影响.首先建立迭代计算格式可行性的判别准则,引出迭代增长性的概念,然后分析了反迭代过程的“一次增长”性,(即第一次迭代总是“增长”的),以及病态问题和亏损情况下反迭代过程的“一次迭代”性,(即第二次迭代达不到完全“增长”.)

Discusses the effects of singularity of matrix A-λ_t I on inverse power method convergence. After analysis, shows the first inverse iteration is fast-convergent for any matrix, and the second inverse iteration does not achieve fast-convergence for ill-conditioned or defective matrix.

本文的目的是分析系数矩阵A-(?)1的奇异性对带原点位移的反乘幂法收敛性的影响。首先建立迭代计算格式可行性的判别准则,引出迭代增长性的概念,然后分析了反迭代过程的“一次增长”性,(即第一次迭代总是“增长”的),以及病态问题和亏损情况下反迭代过程的“一次迭代”性,(即第二次迭代达不到完全“增长”。)

Fit By Order (FBO) method is developed to establish the meshless approximation function at a node, in which the approximation function is first fitted by the linear basis, and then fitted by the quadric basis to minimize the error. Collocation is used to discretize the governing equation. The proposed method has several advantages. Compared with other interpolation methods, such as MLS and PIM, FBO overcomes the difficulties arising from the singularity of matrix and only six nodes are required to establish...

Fit By Order (FBO) method is developed to establish the meshless approximation function at a node, in which the approximation function is first fitted by the linear basis, and then fitted by the quadric basis to minimize the error. Collocation is used to discretize the governing equation. The proposed method has several advantages. Compared with other interpolation methods, such as MLS and PIM, FBO overcomes the difficulties arising from the singularity of matrix and only six nodes are required to establish the approximation, so that the computational effort required is reduced. Compared with Galerkin-based meshless method, the proposed method does not require any mesh, so that the computational cost is further reduced.

在子域插值的基础上提出了分阶拟合直接配点无网格方法。该方法通过分阶拟合使近似函数在节点的残差达到最小,边界条件直接引入,然后使用直接配点法求解方程。与其它插值或拟合方法相比,分阶拟合避免了矩阵奇异产生的困难;与最小移动二乘法(MLS)相比,分阶拟合只需用六个点来构造二次基近似函数,减小了计算量;而与其它基于Galerkin法的无网格法相比,分阶拟合直接配点无网格法计算量小。

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

 


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

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