Divide and Conquer for the Solution of Banded Linear Systems of Equations

Authors:
M. Hegland
Affiliations:
-
Venue:
PDP '96 Proceedings of the 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96)
Year:
1996

Citing 0
Cited 4

A comparison of parallel solvers for diagonally dominant and general narrow-banded linear systems

Parallel numerical linear algebra
A Comparison of Parallel Solvers for Diagonally Dominant and General Narrow-Banded Linear Systems II

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Domain decomposition solution of nonlinear two-dimensional parabolic problems by random trees

Journal of Computational Physics
Block transmissions over doubly selective channels: iterative channel estimation and turbo equalization

EURASIP Journal on Advances in Signal Processing - Special issue on advanced equalization techniques for wireless communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm for the solution of banded linear systems is presented and discussed which combines stability with scalability. This is achieved by implementing divide and conquer for Gaussian elimination with partial pivoting. Earlier divide and conquer algorithms for Gaussian elimination have problems with instabilities and can even break down as they implement a more restricted form of pivoting.The key observation used for the implementation is the invariance of LU factorization with partial pivoting under permutations. Theoretical analysis shows that the algorithm has low redundancy, a high degree of parallelism and relatively low communication.