Skip to main content
Conference ProceedingsOPEN ACCESS

Stability issues of the Wang's partitioning algorithm for banded and tridiagonal linear systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1685 LNCS 1149-1152
DOI: 10.1007/3-540-48311-x_161
0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The main results of a componentwise error analysis for a parallel partitioning algorithm [4] in the cases of banded and tridiagonal 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 numericaly stable. © Springer-Verlag Berlin Heidelberg 1999.

Cite

CITATION STYLE

APA

Pavlov, V., & Yalamov, P. (1999). Stability issues of the Wang’s partitioning algorithm for banded and tridiagonal linear systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1685 LNCS, pp. 1149–1152). Springer Verlag. https://doi.org/10.1007/3-540-48311-x_161

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free