The delayed coupling method: An algorithm for solving banded diagonal matrix problems in parallel
Conference
·
OSTI ID:520498
- Lawrence Livermore National Lab., CA (United States)
We present a new algorithm for solving banded diagonal matrix problems efficiently on distributed-memory parallel computers, designed originally for use in dynamic alternating-direction implicit partial differential equation solvers. The algorithm optimizes efficiency with respect to the number of numerical operations and to the amount of interprocessor communication. This is called the ``delayed coupling method`` because the communication is deferred until needed. We focus here on tridiagonal and periodic tridiagonal systems.
- Research Organization:
- Los Alamos National Lab., NM (United States)
- Sponsoring Organization:
- USDOE Office of Energy Research, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 520498
- Report Number(s):
- LA-UR--97-1605; CONF-970876--1; ON: DE97008306
- Country of Publication:
- United States
- Language:
- English
Similar Records
Applications and accuracy of the parallel diagonal dominant algorithm. Contractor report
A parallel Jacobi diagonalization algorithm for a loop multiple processor system
New distributed-memory parallel algorithms for solving nonsymmetric eigenvalue problems
Technical Report
·
Sun Jan 31 23:00:00 EST 1993
·
OSTI ID:6421749
A parallel Jacobi diagonalization algorithm for a loop multiple processor system
Journal Article
·
Tue May 01 00:00:00 EDT 1984
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5925359
New distributed-memory parallel algorithms for solving nonsymmetric eigenvalue problems
Conference
·
Thu Nov 30 23:00:00 EST 1995
·
OSTI ID:125574