Computational challenge of fractional differential equations and the potential solutions: a survey (Q1665112): Difference between revisions

Summary: We present a survey of fractional differential equations and in particular of the computational cost for their numerical solutions from the view of computer science. The computational complexities of time fractional, space fractional, and space-time fractional equations are \(O(N^2M)\), \(O(NM^2)\), and \(O(NM(M+N)\)) compared with \(O(MN)\) for the classical partial differential equations with finite difference methods, where \(M\), \(N\) are the number of space grid points and time steps. The potential solutions for this challenge include, but are not limited to, parallel computing, memory access optimization (fractional precomputing operator), short memory principle, fast Fourier transform (FFT) based solutions, alternating direction implicit method, multigrid method, and preconditioner technology. The relationships of these solutions for both space fractional derivative and time fractional derivative are discussed. The authors pointed out that the technologies of parallel computing should be regarded as a basic method to overcome this challenge, and some attention should be paid to the fractional killer applications, high performance iteration methods, high order schemes, and Monte Carlo methods. Since the computation of fractional equations with high dimension and variable order is even heavier, the researchers from the area of mathematics and computer science have opportunity to invent cornerstones in the area of fractional calculus.