In this work, an explicit solution of the initial-boundary value problem for a multidimensional time-fractional differential equation is constructed. The possibility of obtaining this equation from an integro-differential wave equation with a Mittag–Leffler–type memory kernel is shown. An explicit solution to the problem under consideration is obtained using the Laplace and Fourier transforms, the properties of the Fox H-functions and the convolution theorem.
The work is devoted to developing the parallel algorithms for solving the initial boundary problem for the time-fractional diffusion equation. After applying the finite-difference scheme to approximate the basis equation, the problem is reduced to solving a system of linear algebraic equations for each subsequent time level. The developed parallel algorithms are based on the Thomas algorithm, parallel sweep algorithm, and accelerated over-relaxation method for solving this system. Stability of the approximation scheme is established. The parallel implementations are developed for the multicore CPU using the OpenMP technology. The numerical experiments are performed to compare these methods and to study the performance of parallel implementations. The parallel sweep method shows the lowest computing time.
This paper is devoted to the development of a parallel algorithm for solving the inverse problem of identifying the space-dependent source term in the two-dimensional fractional diffusion equation. For solving the inverse problem, the regularized iterative conjugate gradient method is used. At each iteration of the method, we need to solve the auxilliary direct initial-boundary value problem. By using the finite difference scheme, this problem is reduced to solving a large system of a linear algebraic equation with a block-tridiagonal matrix at each time step. Solving the system takes almost the entire computation time. To solve this system, we construct and implement the direct parallel matrix sweep algorithm. We establish stability and correctness for this algorithm. The parallel implementations are developed for the multicore CPU using the OpenMP technology. The numerical experiments are performed to study the performance of parallel implementations.
31 May 2017 in Mathematical Modelling of Natural Phenomena
In the paper we prove the theorems of conditional stability of the solution of the inverse problem of determining the potential a(x) of the Schrödinger equation iu t + Δu + a(x)u = 0, in the multidimensional case x ∈ R n , in non-stationary and spectral formulations. The method of proof in the non-stationary formulation is based on the Carleman type a priori weight estimates with operator coefficients. The stability of the solution of the inverse problem in the spectral formulation is investigated using the connection of this formulation with the corresponding formulation of the inverse dynamic problem.
1 November 2022 in Lobachevskii Journal of Mathematics
In this article, it is proved a theorem on the unique generalized solvability to a nonlocal boundary value problem for the three-dimensional Tricomi equation in a prismatic unbounded domain. The proof of the theorem is based on the Fourier transform, ‘‘\(\varepsilon\)-regularization’’ methods and a priori estimates.
This work was devoted to the construction of a numerical algorithm for solving the initial boundary value problem for the subdiffusion equation with nonlocal boundary conditions. For the case of not strongly regular boundary conditions, the well-known methods cannot be used. We applied an algorithm that consists of reducing the nonlocal problem to a sequential solution of two subproblems with local boundary conditions. The solution to the original problem was summed up from the solutions of the subproblems. To solve the subproblems, we constructed implicit difference schemes on the basis of the L1 formula for approximating the Caputo fractional derivative and central difference for approximating the space derivatives. Stability and convergence of the schemes were established. The Thomas algorithm was used to solve systems of linear algebraic equations. Numerical experiments were conducted to study the constructed algorithm. In terms of accuracy and stability, the algorithm performs well. The results of experiments confirmed that the convergence order of the method coincides with the theoretical one, $ O(\tau^{2-\alpha}+h^2) $.