𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Stability of a partitioning algorithm for bidiagonal systems

✍ Scribed by Plamen Y. Yalamov

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
916 KB
Volume
23
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis

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 analysis is obtained for the computation of each component of the solution. 'lhen a bound for the forward error is derived. The bound is similar to the well-known bound for the forward substitution. Thus we can recommend the use of the partitioning algorithm in the same cases when the sequential Gaussian elimination can be applied.

πŸ“œ SIMILAR VOLUMES

Algorithms for partitioning a graph
Algorithms for partitioning a graph
✍ Taehoon Park; Chae Y. Lee πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 606 KB
An Adaptive Partitioning Algorithm for D
An Adaptive Partitioning Algorithm for Distributed Discrete Event Simulation Systems
✍ Azzedine Boukerche πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 277 KB

Biocomputing techniques have been proposed to solve combinatorial problems elegantly by such methods as simulated annealing, genetic algorithms and neural networks. In this context, we identify an important optimization problem arising in conservative distributed simulation, such as partitioning, sy