Re: Parallel algorithm for tridiagonal matrix
- From: arpiruk@xxxxxxxxx
- Date: Thu, 23 Aug 2007 04:46:07 -0700
It looks to me like each line is uncoupled from the others. Thus, you
have 1000^2 independent systems of size 1000, and parallelism is easy.
You are absolutely right. However, the data is also distributed.
I am using 2D grid topology.
Nx (dimension of problem in x) is distributed on Px processors.
So they dont have the complete line.
.
- Follow-Ups:
- Re: Parallel algorithm for tridiagonal matrix
- From: Dave Dodson
- Re: Parallel algorithm for tridiagonal matrix
- References:
- Parallel algorithm for tridiagonal matrix
- From: arpiruk
- Re: Parallel algorithm for tridiagonal matrix
- From: William R. Frensley
- Re: Parallel algorithm for tridiagonal matrix
- From: arpiruk
- Re: Parallel algorithm for tridiagonal matrix
- From: Dave Dodson
- Parallel algorithm for tridiagonal matrix
- Prev by Date: Updating the Householder QR factorization
- Next by Date: Re: Parallel algorithm for tridiagonal matrix
- Previous by thread: Re: Parallel algorithm for tridiagonal matrix
- Next by thread: Re: Parallel algorithm for tridiagonal matrix
- Index(es):