Between Dec 19, 2024 and Jan 2, 2025, datasets can be submitted to DRUM but will not be processed until after the break. Staff will not be available to answer email during this period, and will not be able to provide DOIs until after Jan 2. If you are in need of a DOI during this period, consider Dryad or OpenICPSR. Submission responses to the UDC may also be delayed during this time.
 

The Design of a Parallel Method for the Solution of a General, Narrow Banded Linear Systems

Oettli, Michael
Sameh, Ahmed
1997
Thumbnail Image

View/Download File

97-006.pdf (2.74 MB)

Persistent link to this item

https://hdl.handle.net/11299/215355
Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

The Design of a Parallel Method for the Solution of a General, Narrow Banded Linear Systems

Authors

Published Date

1997

Publisher

Type

Report

Abstract

A 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.

Keywords

Description

Related to

Replaces

License

Collections

Computer Science & Engineering (CS&E) Technical Reports

Series/Report Number

Technical Report; 97-006

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Other identifiers

Suggested citation

Oettli, Michael; Sameh, Ahmed. (1997). The Design of a Parallel Method for the Solution of a General, Narrow Banded Linear Systems. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215355.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.