Parallel algorithms for the solution of narrow banded systems
Applied Numerical Mathematics
Iterative solution methods
On the Stability of a Partitioning Algorithm for Tridiagonal Systems
SIAM Journal on Matrix Analysis and Applications
Scaling for Numerical Stability in Gaussian Elimination
Journal of the ACM (JACM)
A Parallel Method for Tridiagonal Equations
ACM Transactions on Mathematical Software (TOMS)
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
Stability of a Parallel Partitioning Algorithm for Special Classes of Banded Linear Systems
NAA '00 Revised Papers from the Second International Conference on Numerical Analysis and Its Applications
Stability of a Parallel Partitioning Algorithm for Special Classes of Banded Linear Systems
NAA '00 Revised Papers from the Second International Conference on Numerical Analysis and Its Applications
| Hi-index | 0.00 |
The main results of a componentwise error analysis for a parallel partitioning algorithm [7] in the case of banded linear systems are presented. It is shown that for some special classes of matrices, i.e. diagonally dominant (row or column), symmetric positive definite, and M-matrices, the algorithm is numerically stable. In the case when the matrix of the system does not belong to the considered classes is presented a stabilized version of the algorithm.