Parallel solution of linear recurrence systems

被引:0
|
作者
Paprzycki, M [1 ]
Stpiczynski, P [1 ]
机构
[1] MARIE CURIE SKLODOWSKA UNIV, NUMER ANAL DEPT, INST MATH, PL-20031 LUBLIN, POLAND
来源
ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK | 1996年 / 76卷
关键词
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The paper describes some recently proposed divide-and-conquer parallel algorithms for solving linear recurrence systems. Such systems arise in many computational problems. A special case - solving linear systems with constant coefficients - is also discussed. As an example of an application of such linear systems, parallel algorithms for finding trigonometric sums are presented.
引用
收藏
页码:5 / 8
页数:4
相关论文
共 50 条