Oettli, MichaelSameh, Ahmed2020-09-022020-09-021997https://hdl.handle.net/11299/215355A row partitioning approach for general, nonsingular narrow-banded linear systems is described which yields a stable and naturally parallel algorithm suitable for parallel computers. The system matrix is partitioned into a series of rectangular smaller matrices with only a small set of global unknowns which interface consecutive submatrices. The solution of a system for this small set of unknowns yields the solution of the original gystem with almost perfect parallelism.en-USbanded linear systemsdomain decompositionparallel computationReport