 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   循环约化 的翻译结果: 查询用时：0.525秒 在分类学科中查询 所有学科 数学 更多类别查询 历史查询  循环约化  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. 本文针对三对角方程组的直接并行解法奇偶约化方法 ,提出计算复杂度比原方法降低的大步长的循环约化交替方法。 短句来源 相似匹配句对
 RECYCLE 循环再利用 短句来源 The Doming cycle “Deming”循环 短句来源 The Commutants of Reductive Algebras 约化代数的换位 短句来源 Properties of Reducible operators 约化算子的性质 短句来源 Symmetric Domain Decomposition and Cyclic Reduction:A Fast Parallel Algorithm on MIMD Computer 对称区域分裂与循环约化:MIMD计算机上的一种快速并行算法 短句来源 查询“循环约化”译词为用户自定义的双语例句

我想查看译文中含有：的双语例句  cyclic reduction
 Block Cyclic Reduction (BCR) method and Fourier Method. The ordering of tridiagonal matrices in the cyclic reduction method for Poisson's equation Discretization of the Poisson equation on a rectangle by finite differences using the standard five-point stencil yields a linear system of algebraic equations, which can be solved rapidly by the cyclic reduction method. Our orderings are also applicable to the solution of Helmholtz's equation by cyclic reduction, and to related numerical schemes, such as FACR methods. The first algorithm delivers an asymptotic speedup by a factor ofp on ap-processor computer if compared to the scalar algorithm, whereas the second algorithm delivers a speedup by a factor of roughlyp/2, which is also typical for cyclic reduction. 更多 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... 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. 对Ｍ阵用块循环约化后，给出新的分裂方式，该分裂构造的选代收敛，其收敛速度比Ｊａｃｏｂｉ等一般迭代收敛快，且有很好的并行性． A fast parallel algorithm is given,it would be used to solve the partial differential equations in a symmetric domain with MIMD computer The basic idea includes: first by using symmetric domain decomposition concept, the original problem defined in ΩR n is decomposed 2 p(1≤P≤n) subproblems defined in Ω 1(Ω) and mapped into multiprocess unit of MIMD computer,for which the parallel operation is easily realized on assignment level and task level;and then the cyclic reduction--fast speed Fourier transform... A fast parallel algorithm is given,it would be used to solve the partial differential equations in a symmetric domain with MIMD computer The basic idea includes: first by using symmetric domain decomposition concept, the original problem defined in ΩR n is decomposed 2 p(1≤P≤n) subproblems defined in Ω 1(Ω) and mapped into multiprocess unit of MIMD computer,for which the parallel operation is easily realized on assignment level and task level;and then the cyclic reduction--fast speed Fourier transform (FFT) or cyclic reduction--precondition iteration would be used to solve each of the sburbles These two processes have very high ratio of vectors The method used is called SDD CR method, with which the overall parallel of operation, task, command and data could be effectively implemented at all levels 介绍一种适合于 MIMD计算机解对称区域上偏微分方程的快速并行算法。其基本思想是 :先利用对称区域分裂原理 ,将一个定义在Ω Rn 上的原问题分裂成Ω上某子区域Ω1 ( Ω)上的 2 P( 1≤ P≤ n)个子问题 ,并映射到 MIMD计算机的多处理单元上 ,如此极易组织作业级与任务级并行 ;然后用循环约化——快速 Fourier变换或循环约化——预条件迭代解各子问题 ,两种过程都有很高的向量化率。称这种算法为对称区域分裂与循环约化方法 ,它能有效地实现作业、任务、指令和数据各个级别的全面并行 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.Combining with Dawning 2000,the distributed large scale parallel computer system,we will give its parallel algorithm and good numerical solution for the distributed memory system. 本文针对三对角方程组的直接并行解法奇偶约化方法 ,提出计算复杂度比原方法降低的大步长的循环约化交替方法。结合大规模分布式并行计算机系统曙光 2 0 0 0 ,给出其分布式并行算法及数值实验结果 相关查询

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

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索 2008 CNKI－中国知网 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社