Singularly perturbed reaction-diffusion problems on a k-star graph

被引:7
|
作者
Kumar, Vivek [1 ]
Leugering, Guenter [2 ]
机构
[1] Delhi Technol Univ, Dept Appl Math, Delhi 110042, India
[2] Friedrich Alexander Univ, Inst Appl Math 2, Erlangen, Germany
关键词
central finite difference schemes; k-star graph; networks; Shishkin meshes; tree-like graphs; DISCRETIZATIONS;
D O I
10.1002/mma.7749
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Singularly perturbed reaction-diffusion equations on a star graph (having k + 1 nodes and k edges) resulting in a system with k individual partial differential equations along the edges with coupling conditions at the common junction are presented. In the singular limit, as the diffusion parameter tends to zero, possibly individually along each edge, boundary layers may occur at the multiple nodes as well as at the simple nodes. Numerically, the proposed equations are solved using central finite difference schemes on properly extended Shishkin meshes. Error estimates are discussed and validated by solving a test problem on a graph with three edges (tripod). A more general graph problem with eight edges and three connecting nodes has also been solved numerically.
引用
收藏
页码:14874 / 14891
页数:18
相关论文
共 50 条