Two Methods for Solving the Two‐Dimensional Black–Scholes Equation

ABSTRACT The Crank–Nicolson radial basis function (CN‐RBF) method, as a time‐stepping mesh‐less approach, is widely adopted for multi‐asset option pricing. However, its accuracy is highly dependent on shape parameters, which limits its practical applicability. To address this, we propose two polynomial‐based space‐time methods for pricing European exchange options: one is the space‐time polynomial particular solutions method, and the other is the space‐time interpolations method which directly uses polynomial functions as basis functions. These two methods treat the time variable as a common spatial variable, thereby eliminating the need for the time‐stepping process. Their implementation requires only interpolation points, simplifying the solution procedure by removing shape parameter selection and time‐step scheme dependencies. Numerical results demonstrate that both space‐time methods achieve good performance in terms of accuracy and stability.

Authors

Institutions

Publication Details

Journal
Numerical Methods for Partial Differential Equations
Published
2025-09-29
DOI
https://doi.org/10.1002/num.70042
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Two Methods for Solving the Two‐Dimensional Black–Scholes Equation

Wen Yang, Yanhua Cao
Numerical Methods for Partial Differential Equations
Matrix Theory and Algorithms
article

Two Methods for Solving the Two‐Dimensional Black–Scholes Equation

Wen Yang, Yanhua Cao
article en

Abstract

ABSTRACT The Crank–Nicolson radial basis function (CN‐RBF) method, as a time‐stepping mesh‐less approach, is widely adopted for multi‐asset option pricing. However, its accuracy is highly dependent on shape parameters, which limits its practical applicability. To address this, we propose two polynomial‐based space‐time methods for pricing European exchange options: one is the space‐time polynomial particular solutions method, and the other is the space‐time interpolations method which directly uses polynomial functions as basis functions. These two methods treat the time variable as a common spatial variable, thereby eliminating the need for the time‐stepping process. Their implementation requires only interpolation points, simplifying the solution procedure by removing shape parameter selection and time‐step scheme dependencies. Numerical results demonstrate that both space‐time methods achieve good performance in terms of accuracy and stability.

Numerical Methods for Partial Differential EquationsVol. 41(6)
East China Jiaotong University (CN)
Openalex Percentile: Top 72%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.