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

图标索引 历史查询
 

cyclic reduction
相关语句
  循环约化
     Symmetric Domain Decomposition and Cyclic Reduction:A Fast Parallel Algorithm on MIMD Computer
     对称区域分裂与循环约化:MIMD计算机上的一种快速并行算法
短句来源
     In this paper,we provide a new parallel method which can reduce computing complication, a large stride alternating cyclic reduction method,based on cyclic reduction method to solve tridiagonal equations.
     本文针对三对角方程组的直接并行解法奇偶约化方法 ,提出计算复杂度比原方法降低的大步长的循环约化交替方法。
短句来源
  “cyclic reduction”译为未确定词的双语例句
     The main process for industrial production of hydrogen peroxide is to subject anthraquinone to cyclic reduction and oxidation. Pd/γ-Al2O3 catalyst is used in hydrogenation.
     目前,工业上主要使用蒽醌法制双氧水,采用Pd/γ-Al2O3作为催化剂。
短句来源
     PARALLEL SPLITTING ITERATION BASED ON INCOMPLETE BLOCK CYCLIC REDUCTION
     基于不完全块循环约化的并行分裂迭代
短句来源
     For the particularity of this approach, the calculation of correlative integral on fictitious domain is described in detail. The cyclic reduction procedure for linear system is deduced integrally.
     基于本文讨论的虚拟区域方法的特殊性,对虚拟区域上的相关积分的数值求解过程进行了详细的描述,对所使用的大型稀疏矩阵的快速直接解法——循环消去法也进行了详细的推导。
短句来源
  相似匹配句对
     D—CYCLIC CRAPHS
     D—Cyclic图
短句来源
     On D-cyclic in Graph
     关于图中的支配圈
短句来源
     PARALLEL SPLITTING ITERATION BASED ON INCOMPLETE BLOCK CYCLIC REDUCTION
     基于不完全块循环约化的并行分裂迭代
短句来源
     On reduction strategy
     浅谈化归策略
短句来源
     Reduction of Phenomenology
     现象学的还原
短句来源
查询“cyclic reduction”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  cyclic reduction
Our algorithm is quite competitive with the Gaussian elimination, cyclic reduction, specialLU factorization, reversed triangular factorization, and Toeplitz factorization methods.
      
Lastly, a comparison of bounds for odd-even cyclic reduction and prefix summing is given.
      
In particular, two common direct methods for solving such systems are considered: odd-even cyclic reduction and prefix summing.
      
In this paper we propose a further improvement of the above method, based on a point-wise evaluation/interpolation at a suitable set of Fourier points, of the functional relations defining each step of cyclic reduction (Bini and Meini,1996).
      
Improved cyclic reduction for solving queueing problems
      
更多          


The solution of Toeplitz and Circulant tridiagonal linear systems are considered in this paper.This kind of systems frequently arises in practical applications mainly related to solving differential equations by discrete numerical methods.The recursive doubling and cyclic reduction for these systems involve two phases:elimination and substitution, and the dominant work of these algorithms is in performing the elimination process,while with the algorithms presented in this paper only performing the second...

The solution of Toeplitz and Circulant tridiagonal linear systems are considered in this paper.This kind of systems frequently arises in practical applications mainly related to solving differential equations by discrete numerical methods.The recursive doubling and cyclic reduction for these systems involve two phases:elimination and substitution, and the dominant work of these algorithms is in performing the elimination process,while with the algorithms presented in this paper only performing the second phase,the substitution,is necessary. Thus our methods are more efficient than those mentioned above.

本文考虑ToepIitz和循环三对角线性方程组的并行求解问题。这类方程组常在主要与用离散数值方法解微分方程有关的实际应用中提出来。解这类方程组的递推倍增和循环化简方法包含两大步骤:消去和代入,且主要工作量在消去过程中。本文提出的方法只需进行第二步,即代入的工作,因此,我们的方法比上述方法都更有效。

An efficient method for multiple-scale problems is presented, which extends the authors'modified Temam scheme on the staggered mesh [5] to nonuniform staggered mesh. The nonuniform mesh is generated by a continuous coordinate transformation without singlarity according to boundary layer thickness so as to ensure accuracy. The constraint condition, i. e.continuity equation, is realized by the pressure correction projection method; the related Poisson equation on nonuniform mesh is solved by the generalized cyclic...

An efficient method for multiple-scale problems is presented, which extends the authors'modified Temam scheme on the staggered mesh [5] to nonuniform staggered mesh. The nonuniform mesh is generated by a continuous coordinate transformation without singlarity according to boundary layer thickness so as to ensure accuracy. The constraint condition, i. e.continuity equation, is realized by the pressure correction projection method; the related Poisson equation on nonuniform mesh is solved by the generalized cyclic reduction program from FISHPACK. Numerical simulation of driven flow in a square cavity was done for steady-state solutions for Re=100, 400, 1000, 5000. These solutions accurately match those given in literature; for high Reynold numbers, tertiary vortices near the corners in the cavity are resolved. These results shows that with suitable nonuniform mesh, the above method remarkably improves computational efficiency.

给出一种有效求解多重尺度问题的计算方法,把作者在交错网格上的修正Temam格式[5]推广到非均匀交错网格,网格分布是根据边界层厚度由无奇异连续坐标变换来实现,以保证计算精度,连续方程约束用压力修正投影法来实现.所导致的非均匀网格上的Poisson方程用FISHPACK中的广义循环约减法程序求解。对驱动方腔流动进行了数值模拟,给出了Re数为100,400,1000,5000的定常结果.这些结果定量上与文献中的结果一致,在Re数较大时分辨出三级涡,但计算效率有显著提高。

Cyclic reduction methods is highly parallel methods for solving block tridiagonal systems;this paper extends cyclic reduction algorithms to block tridiagonal M-matrix systems.When A is a M-matrix block tridiagonal systems,we apply incomplete block cyclic reduction to get a precondition,then get a solution with generalized PCG methods.After applying block cyclic reduction for M-matrix, this paper put forward a new splitting methods and demonstrates this splitting iteration converge.The converge...

Cyclic reduction methods is highly parallel methods for solving block tridiagonal systems;this paper extends cyclic reduction algorithms to block tridiagonal M-matrix systems.When A is a M-matrix block tridiagonal systems,we apply incomplete block cyclic reduction to get a precondition,then get a solution with generalized PCG methods.After applying block cyclic reduction for M-matrix, this paper put forward a new splitting methods and demonstrates this splitting iteration converge.The converge speed is faster than Jacobi iteration.Because this spiltting process applies block cyclic reduction,this process is highly parallel.

对M阵用块循环约化后,给出新的分裂方式,该分裂构造的选代收敛,其收敛速度比Jacobi等一般迭代收敛快,且有很好的并行性.

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

 


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

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