روش کم‌ترین مانده تعمیم یافته پیش شرط سازشده برای حل معادله انتشار‌-‌‌‌هم رفت کسری

   در این مقاله معادله انتشار‌-‌‌هم رفت با مشتق مرتبه کسری را در نظر می‌گیریم. برای به‌دست آوردن یک روش عددی، مشتقات کسری موجود در معادله با استفاده از تعاریف گرانوالد‌‌-‌لتنیکوف انتقال‌یافته جای‌گزین می‌شوند.  برای بهبود روش عددی ارائه شده، مشتقات جزئی معادله را با روش تفاضل متناهی کرانک‌-‌‌نیکلسون کسری گسسته‌سازی می‌کنیم. هم‌چنین نشان می‌دهیم این روش به‌صورت غیرمشروط پایدار است. سپس با معرفی یک ماتریس پیش‌شرط‌ ساز، روش کم‌ترین مانده تعمیم یافته (gmres) پیش‌شرط ساز شده را برای حل دستگاه معادلات جبری‌ به‌دست آمده معرفی خواهیم کرد. در پایان با هدف تایید نتایج نظری، با ارائه یک مثال روش gmres پیش‌شرط سازشده‌ ‌را آزمایش می‌کنیم.

preconditioned generalized minimal residual method for solving fractional advection-diffusion equation

introductionfractional differential equations (fdes)  have  attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. it is not always possible to find an analytical solution for such equations. the approximate solution or numerical scheme  may be a good approach, particularly, the schemes in numerical linear algebra for solving a system, , emerging  by  discretizing  the partial derivatives, with  large and sparse dimensions. in the procedure of solving a specified fde,  if the dimension of  the corresponding system of linear equations  is small,    one can use the direct methods or the classical  iterative methods for the analysis of these systems.  however,  if the dimension is large, then the proposed methods are not effective. in this case, we use variants of  the krylov subspace methods that are more robust  with respect to the computer memory and  time. the gmres (generalized minimal residual) is a well-known method  based on krylov subspace that is used to solve a system of sparse linear equations with an non-symmetric matrix.  a main drawback of iterative methods is the slowness of convergence rate which depends on the condition number of the corresponding coefficient  matrix. if the condition number of the coefficient matrix is small, then the rate of convergence will be faster. so, we try to convert the original system to another equivalent system, in which the condition number of its coefficient matrix becomes small. a preconditioner matrix is a matrix that performs this transformation.in this paper, we propose the iterative gmres method, preconditioned gmres method   and examine capability of these methods by solving the space fractional advection-diffusion equation.material and methodswe first introduce a space fractional advection-diffusion equation in the sense of the   shifted grünwald-letnikov fractional derivative. to improve the introduced numerical scheme, we discretize the partial derivatives of equation using the fractional crank-nicholson finite difference method. then we use a preconditioner matrix and present preconditioned gmres method for solving the derived linear system of algebraic equations.results and discussionin this paper, we use the gmres and preconditioned gmres to solve a linear system of equations emerging by discretizing partial derivatives appearing in  a advection-diffusion equation and  then  asset the accuracy of these methods. numerical results indicate that we derive a smaller condition number of the equivalent coefficient matrix for different values of m and n, as dimensions of the corresponding linear equations. hence the convergence rate increases and consequently the number of iterations and the calculation time decreases.conclusionthe following conclusions were drawn from this research.the gmres method is a  kyrlov subspace methods to solve large-dimensions non-symmetric system of linear equations, which will be more effective when is applied with preconditioning  techniques.one of the common ways to increase the rate of convergence of iterative methods based on the kyrlov subspace is the applying  the  preconditioned techniques.an appropriate preconditioner matrix increases the rate of convergence of  the iterative method../files/site1/files/51/%da%86%d8%b1%d8%a7%d8%ba%db%8c.pdf