A distributed divide-and-conquer approach to the parallel tridiagonal symmetric eigenvalue problem

被引：0
|
作者：
Pavani, R
DeRos, U
机构：
来源：
HIGH-PERFORMANCE COMPUTING AND NETWORKING | 1995年 / 919卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We used a transputer network in order to solve the tridiagonal symmetric eigenvalue problem by means of a parallel divide-and-conquer algorithm. Among its features let us mention: i) its results do not depend on how tightly eigenvalues are clustered, ii) it achieves the required accuracy to any tolerance (compatible with the machine precision) for any order of the given matrix. Our algorithm was implemented in three different parallel versions. The effects of their parallelization are studied and compared.
引用
收藏
页码：717 / 722
页数：6
相关论文
共 50 条
  • [41] A divide-and-conquer approach to fragment assembly
    Otu, HH
    Sayood, K
    [J]. BIOINFORMATICS, 2003, 19 (01) : 22 - 29
  • [42] A Divide-and-Conquer Approach to Quad Remeshing
    Zhang, Muyang
    Huang, Jin
    Liu, Xinguo
    Bao, Hujun
    [J]. IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2013, 19 (06) : 941 - 952
  • [43] A Threaded Divide and Conquer Symmetric Tridiagonal Eigensolver on Multicore Systems
    Boratto, Murilo
    Alonso, Pedro
    Vidal, Antonio M.
    [J]. PROCEEDINGS OF THE INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED COMPUTING, 2008, : 464 - +
  • [44] A divide-and-conquer approach to the minimum k-way cut problem
    Kamidoi, Y
    Wakabayashi, S
    Yoshida, N
    [J]. ALGORITHMICA, 2002, 32 (02) : 262 - 276
  • [45] A new divide and conquer algorithm for real symmetric band generalized eigenvalue problem
    Wei, LF
    Li, XM
    [J]. FIFTH INTERNATIONAL CONFERENCE ON ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PROCEEDINGS, 2002, : 105 - 108
  • [46] Parallel divide and conquer approach for the protein threading problem
    Yanev, N
    Andonov, R
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2004, 16 (09): : 961 - 974
  • [47] Divide-and-conquer parallel programming with Minimally Synchronous Parallel ML
    Benheddi, Radia
    Loulergue, Frederic
    [J]. PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2008, 4967 : 1078 - 1085
  • [48] A Parallel Skeleton for Divide-and-conquer Unbalanced and Deep Problems
    Martinez, Millan A.
    Fraguela, Basilio B.
    Cabaleiro, Jose C.
    [J]. INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2021, 49 (06) : 820 - 845
  • [49] Modeling and simulation of parallel adaptive divide-and-conquer algorithms
    Barros, Fernando J.
    [J]. JOURNAL OF SUPERCOMPUTING, 2008, 43 (03): : 241 - 255
  • [50] Satin: Efficient parallel divide-and-conquer in Java']Java
    van Nieuwpoort, RV
    Kielmann, T
    Bal, HE
    [J]. EURO-PAR 2000 PARALLEL PROCESSING, PROCEEDINGS, 2000, 1900 : 690 - 699
12345