NANAMay 17, 2018

Numerical solution of time-fractional Burgers equation in reproducing kernel space

arXiv:1805.069533 citationsh-index: 18
Originality Synthesis-oriented
AI Analysis

This work provides a numerical method for solving a specific fractional PDE, but it is incremental as it applies existing reproducing kernel techniques to a new equation type.

The authors developed an iterative reproducing kernel method for solving the one-dimensional time-fractional Burgers equation with variable coefficients, proving convergence and demonstrating high efficiency through numerical experiments.

In this paper, we present an iterative reproducing kernel method for numerical solution of one dimensional fractional Burgers equation with variable coefficient. Convergence analysis is constructed theoretically. Numerical experiments show that approximate solution uniformly converges to exact solution. The results demonstrate that the given method very efficient and convenient for fractional Burgers equation.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes