Remarks on the optimal convolution kernel for CSOR waveform relaxation
type: Item
instance of: scholarly article
title: Remarks on the optimal convolution kernel for CSOR waveform relaxation
zbMATH Open document ID: 0889.65069
DOI: 10.1023/A:1018938617680
author: Min Hu
author: Ken Jackson
author: Jan Janssen
author: Stefan Vandewalle
published in: Advances in Computational Mathematics
publication date: 1998-06-02T00:00:00Z
review text: This work further examines features of the waveform relaxation method for solving large scale systems of ordinary differential equations. The main issue under examination is the convolution successive overrelaxation (CSOR) waveform algorithm for a linear initial value problem of the form \[ B u_t + A u = f ,\quad u(0)=u_0 , \tag{1} \] where \(A\) and \(B\) are square matrices, with \(B\) nonsingular. While the SOR waveform algorithm is the natural extension for (1) of the classic SOR method for linear systems, CSOR goes a step further by substituting a convolution for the multiplication of the correction terms by a parameter. When applied to the discretisation of the heat equation with spatial mesh-size \(h\), the asymptotic convergence factor of CSOR is \(1-O(h)\), for small \(h\), while for the standard SOR waveform method the factor is \(1-O(h^2)\). This apparent theoretical advantage of CSOR makes the results presented in the paper especially interesting. Both the continuous and discretised in time CSOR approaches are examined and the existence under suitable hypotheses of convolution kernels for them is reviewed, as well as their convergence properties. For (1) with \(B=I\), the optimal convolution kernel with point relaxation is explicitly determined. One of the main results in the paper is that for such systems, if a strictly stable multistep is chosen for the time discretisation of (1), then the corresponding optimal kernels converge pointwise to the optimal continuous kernel, as the time step tends to \(0\). The quantitative behaviour of this result is examined in the case of the heat equation, with standard approximations both in space and time. In the closing section, results are proved that extend those regarding the existence of convolutions kernels and their convergence properties are established as well.
Mathematics Subject Classification ID: 65L05
Mathematics Subject Classification ID: 35K05
Mathematics Subject Classification ID: 65M20
Mathematics Subject Classification ID: 34A30
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65L06
zbMATH DE Number: 1084019
zbMATH Keywords: iterative methods
zbMATH Keywords: waveform relaxation
zbMATH Keywords: multistep method
zbMATH Keywords: large scale systems
zbMATH Keywords: convolution successive overrelaxation waveform algorithm
zbMATH Keywords: SOR
zbMATH Keywords: heat equation
zbMATH Keywords: convergence
zbMATH Keywords: optimal convolution kernel
reviewed by: Juan Pedro Milaszewicz
MaRDI profile type: Publication
full work available at URL: a:1018938617680
OpenAlex ID: W2112930934
Recommended article: Remarks on the convergence of waveform relaxation method
Recommended article: Convergence Analysis of Schwarz Waveform Relaxation with Convolution Transmission Conditions
Recommended article: Optimal Convolution SOR Acceleration of Waveform Relaxation with Application to Parallel Simulation of Semiconductor Devices
Recommended article: On SOR Waveform Relaxation Methods
Recommended article: Parameter optimization in the regularized Shannon's kernels of higher-order discrete singular convolutions
Recommended article: On the convergence of the discretized multi-splitting waveform relaxation algorithm
Recommended article: On optimal kernel choice for deconvolution
Recommended article: Convolution sampling and reconstruction of signals in a reproducing kernel subspace
Recommended article: Q3779708
Recommended article: Stability and efficiency of waveform relaxation methods
description: scientific article; zbMATH DE number 1084019