Stability of a partitioning algorithm fo
β
Plamen Y. Yalamov
π
Article
π
1997
π
Elsevier Science
π
English
β 916 KB
This paper presents a stability analysis of a parallel partitioning algorithm for bidiagonal systems. Usually new parallel algorithms do not have good stability properties compared to the existing sequential ones. The algorithm presented in this paper is an exception from the 'rule'. First, backward