...
首页> 外文期刊>Microprocessors and microsystems >A parallel algorithm for Lagrange interpolation on the cube-connected cycles
【24h】

A parallel algorithm for Lagrange interpolation on the cube-connected cycles

机译:立方体连接环上拉格朗日插值的并行算法

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

This paper introduces a parallel algorithm for computing an N=n2~n point Lagrange interpolation on an n-dimensional cube-connected cycles (CCC_n). The algorithm consists of three phases: initialization, main and final. While there is no computation in the initialization phase, the main phase is composed of n2~n-1 steps, each consisting of four multiplication's, four subtractions and one communication operation, and an additional step including one division and one multiplication. The final phase is carried out in two sub-phases. There are [n/2] steps in the first sub-phase, each including two additions and one communication, followed by the second sub-phase which comprises n steps each consisting of one addition and two communication operations.
机译:本文介绍了一种并行算法,用于在n维立方连接循环(CCC_n)上计算N = n2〜n点拉格朗日插值。该算法包括三个阶段:初始化,主阶段和最终阶段。在初始化阶段不进行计算时,主阶段由n2〜n-1个步骤组成,每个步骤由四个乘法,四个减法和一个通信运算组成,另外一个步骤包括一个除法和一个乘法。最后阶段分为两个子阶段。在第一子阶段中有[n / 2]个步骤,每个步骤都包括两个加法和一个通信,随后是第二子阶段,其中第二个子阶段包括n个步骤,每个步骤由一个加法和两个通信操作组成。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号