AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (1.9 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Theory Article | Open Access

A numerical method for parabolic complementarity problem

Haiyan Song1Fei Sun2( )
School of Computer and Data Engineering, NingboTech University, Ningbo 315100, China
School of Mathematics and Computational Science, Wuyi University, Jiangmen 529020, China
Show Author Information

Abstract

In this paper, we study the numerical solution of a parabolic complementarity problem which is a widely used model in many fields, such as option pricing, risk measures, etc. Using a power penalty method we represent the complementarity problem as a nonlinear parabolic partial differential equation (PDE). Then, we use the trapezoidal rule as the time discretization, for which we have to solve a nonlinear equation at each time step. We solve such a nonlinear equation by the fixed-point iteration and in this methodology solving a tridiagonal linear system is the major computation. We present an efficient backward substitution algorithm to handle this linear system. Numerical results are given to illustrate the advantage of the proposed algorithm (compared to the built-in command backslash in Matlab) in terms of CPU time.

References

【1】
【1】
 
 
Electronic Research Archive
Pages 1048-1064

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Song H, Sun F. A numerical method for parabolic complementarity problem. Electronic Research Archive, 2023, 31(2): 1048-1064. https://doi.org/10.3934/era.2023052

16

Views

1

Downloads

1

Crossref

1

Web of Science

1

Scopus

Received: 06 October 2022
Revised: 24 November 2022
Accepted: 30 November 2022
Published: 15 February 2023
©2023 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)