Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/77175
PIRA download icon_1.1View/Download Full Text
Title: A parallel iterative algorithm for differential linear complementarity problems
Authors: Wu, SL
Chen, X 
Issue Date: 2017
Source: SIAM journal on scientific computing, 2017, v. 39, no. 6, p. A3040-A3066
Abstract: We propose a parallel iterative algorithm for solving the differential linear complementarity problems consisting of two systems, a linear ODE system and a linear complementarity system (LCS). At each iteration we proceed in a system decoupling way: by using a rough approximation of the state variable obtained from the previous iteration, we solve the LCS; then we solve the ODE system and update the state variable for preparing for the next iteration, by using the obtained constraint variable as a known source term. The algorithm is highly parallelizable, because at each iteration the computations of both the LCS and the ODE system at all the time points of interest can start simultaneously. The parallelism for solving the LCS is natural and for the ODE system it is achieved by using the Laplace inversion technique. For the P-matrix LCS, we prove that the algorithm converges superlinearly with arbitrarily chosen initial iterate and for the Z-matrix LCS the algorithm still converges superlinearly if we use the initial value as the initial iterate. We show that this algorithm is superior to the widely used time-stepping method, with respect to robustness, flexibility, and computation time.
Keywords: Convergence analysis
Dynamic complementarity problems
Iterations
Parallel computation
Publisher: Society for Industrial and Applied Mathematics
Journal: SIAM journal on scientific computing 
ISSN: 1064-8275
EISSN: 1095-7197
DOI: 10.1137/16M1103749
Rights: © 2017 Society for Industrial and Applied Mathematics
The following publication Wu, S. L., & Chen, X. (2017). A parallel iterative algorithm for differential linear complementarity problems. SIAM Journal on Scientific Computing, 39(6), A3040-A3066 is available at https://doi.org/10.1137/16M1103749
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
16m1103749.pdf2.19 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

71
Last Week
0
Last month
Citations as of Oct 2, 2022

Downloads

5
Citations as of Oct 2, 2022

SCOPUSTM   
Citations

3
Last Week
0
Last month
Citations as of Oct 6, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.