On parallel computations with banded matrices
type: Item
instance of: scholarly article
title: On parallel computations with banded matrices
zbMATH Open document ID: 0831.65028
author: Isdor Sobze
author: Antoine Atinkpahoun
author: Victor Y. Pan
published in: Information and Computation
publication date: 1996-02-22T00:00:00Z
review text: Theoretical paper on the algorithmic complexity of the direct solution of banded linear systems on parallel computers. The time complexity is improved compared to previous results. It should be mentioned that for engineering problems with large and sparse matrices iterative solvers are much more efficient.
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 65F50
zbMATH DE Number: 797306
zbMATH Keywords: algorithmic complexity
zbMATH Keywords: banded linear systems
zbMATH Keywords: parallel computers
MaRDI profile type: Publication
OpenAlex ID: W2033270737
DOI: 10.1006/INCO.1995.1111
Recommended article: Q3128928
Recommended article: Parallel Algorithms for Banded Linear Systems
Recommended article: Q4886042
Recommended article: Fast parallel band matrix arithmetic
Recommended article: Q4306798
Recommended article: Q4953336
Recommended article: On some parallel banded system solvers
Recommended article: Solving banded systems on a parallel processor
Recommended article: A parallel algorithm for band linear systems
description: scientific article; zbMATH DE number 797306