Parallel iterative algorithms for solving tridiagonal systems of equations are derived from the symplectic factorization of the odd-even permuted matrix of coefficients. These algorithms have halved parallel computational costs with respect to Accelerated Parallel Gauss, under weaker conditions for convergence.
Symplectic factorizations and parallel iterative algorithms for tridiagonal systems of equations
BERGAMASCHI, LUCA;
1992
Abstract
Parallel iterative algorithms for solving tridiagonal systems of equations are derived from the symplectic factorization of the odd-even permuted matrix of coefficients. These algorithms have halved parallel computational costs with respect to Accelerated Parallel Gauss, under weaker conditions for convergence.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
