TY - JOUR
T1 - The performance of preconditioned waveform relaxation techniques for pseudospectral methods
AU - Burrage, K.
AU - Jackiewicz, Zdzislaw
AU - Renaut, Rosemary
PY - 1996/1/1
Y1 - 1996/1/1
N2 - Waveform relaxation techniques for the pseudospectral solution of the heat conduction problem are discussed. The pseudospectral operator occurring in the equation is preconditioned by transformations in both space and time. In the spatial domain, domain stretching is used to more equally distribute the grid points across the domain, and hence improve the conditioning of the differential operator. Preconditioning in time is achieved either by an exponential or a polynomial transformation. Block Jacobi solutions of the systems are obtained and compared. The preconditioning in space by domain stretching determines the effectiveness of waveform relaxation in this case. Preconditioning in time is also effective in reducing the number of iterations required for convergence. The polynomial transformation is preferred, because it removes the requirement of a matrix exponential calculation in the time-stepping schemes and, at the same time, is no less effective than the direct exponential preconditioning.
AB - Waveform relaxation techniques for the pseudospectral solution of the heat conduction problem are discussed. The pseudospectral operator occurring in the equation is preconditioned by transformations in both space and time. In the spatial domain, domain stretching is used to more equally distribute the grid points across the domain, and hence improve the conditioning of the differential operator. Preconditioning in time is achieved either by an exponential or a polynomial transformation. Block Jacobi solutions of the systems are obtained and compared. The preconditioning in space by domain stretching determines the effectiveness of waveform relaxation in this case. Preconditioning in time is also effective in reducing the number of iterations required for convergence. The polynomial transformation is preferred, because it removes the requirement of a matrix exponential calculation in the time-stepping schemes and, at the same time, is no less effective than the direct exponential preconditioning.
UR - http://www.scopus.com/inward/record.url?scp=0007128857&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0007128857&partnerID=8YFLogxK
U2 - 10.1002/(SICI)1098-2426(199603)12:2<245::AID-NUM7>3.0.CO;2-Q
DO - 10.1002/(SICI)1098-2426(199603)12:2<245::AID-NUM7>3.0.CO;2-Q
M3 - Article
AN - SCOPUS:0007128857
SN - 0749-159X
VL - 12
SP - 245
EP - 263
JO - Numerical Methods for Partial Differential Equations
JF - Numerical Methods for Partial Differential Equations
IS - 2
ER -