We propose and analyze several block iteration preconditioners for the solution of elliptic problems by spectral collocation methods in a region partitioned into several rectangles. It is shown that convergence is achieved with a rate that does not depend on the polynomial degree of the spectral solution. The iterative methods here presented can be effectively implemented on multiprocessor systems due to their high degree of parallelism. © 1988 Plenum Publishing Corporation.
Domain decomposition preconditioners for the spectral collocation method
QUARTERONI, ALFIO MARIA;
1988-01-01
Abstract
We propose and analyze several block iteration preconditioners for the solution of elliptic problems by spectral collocation methods in a region partitioned into several rectangles. It is shown that convergence is achieved with a rate that does not depend on the polynomial degree of the spectral solution. The iterative methods here presented can be effectively implemented on multiprocessor systems due to their high degree of parallelism. © 1988 Plenum Publishing Corporation.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
