On parallel computations with banded matrices

From MaRDI portal





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.











This page was built for publication: On parallel computations with banded matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1898464)