Search

In recent years, various types of methods have been proposed to approximate the Caputo fractional derivative numerically. A common challenge of the methods is the non-local property of the Caputo fractional derivative which leads to the slow and memory consuming methods. Diffusive representation of fractional derivative is an efficient tool to overcome the mentioned challenge. This paper presents two new diffusive representations to approximate the Caputo fractional derivative of order 0 < α < 1. An error analysis of the newly presented methods together with some numerical examples is provided at the end. [ABSTRACT FROM AUTHOR]

This study presents some new iterative algorithms based on the gradient method to solve general constrained systems of conjugate transpose matrix equations for both real and complex matrices. In addition, we analyze the convergence properties of these methods and provide numerical techniques to determine the solutions. The effectiveness of the proposed iterative methods is demonstrated through various numerical examples employed in this study. [ABSTRACT FROM AUTHOR]

Lattice Boltzmann method (LBM) is a powerful fluid flow solver. Using this method to solve other PDEs might be a difficult task. The first challenge is to find a suitable local equilibrium distribution function (EDF) capable of recovering the desired PDE. The next difficulty arises from the explicit nature of LBM. The conditional stability of the LBM algorithm affects the numerical solution accuracy. Damped Kuramoto–Sivashinsky (DKS) equation is a fourth–order PDE that recently challenged many numerical methods' abilities. This equation is highly sensitive to a parameter that causes three states of solutions in a small interval of freedom. In this paper, we challenged LBM to solve the two–dimensional DKS equation by finding EDF using the Chapman–Enskog analysis up to the fourth–order. Also, the von Neumann analysis and a simple genetic algorithm are applied to find reliable values for the free parameters. Furthermore, a modification on image-based ghost node method is proposed for implementation of the boundary conditions in the complex geometries. [ABSTRACT FROM AUTHOR]

The divergence-free generalized moving least squares (Div-Free GMLS) approximation has recently been utilized to solve some incompressible fluid flows problems. In our recent work (Mohammadi and Dehghan (2021) [28]), we have presented its formulation more precisely, and also the error estimates of derivatives have been carried out in L ∞ (Ω) , where Ω ⊂ R d is a bounded set satisfying an interior cone condition. However, the error estimates of this vector-valued approximation in Sobolev spaces are not done. So, in this paper we make the error estimates of Div-Free GMLS derivatives approximations in L q (Ω) , where 1 ≤ q ≤ ∞ , using a stable local divergence-free polynomial reproduction property. Note that, the method is a direct approximants of exact derivatives of a divergence-free vector field, which possesses the optimal rates of convergence. This vector-valued technique can also be developed to find the numerical solution of the incompressible fluid flows problems easier than the other available mesh-dependent methods. Finally, we have shown how the proposed approximation can recover the velocity field variable of the well-known Darcy's problem in a two-dimensional space. • The error analysis of the div-free GMLS derivatives approximations has been released on the Sobolev spaces. • The method can approximate the vector field satisfying the div-free property with the order of O (h m + 1 − | α |). • The developed vector-valued approximation satisfies analytically the div-free property for all polynomials belong to P m. • We have shown how the div-free GMLS approximation can recover the velocity field variable related to the Darcy's problem. [ABSTRACT FROM AUTHOR]

Based on the Combined Real part and Imaginary part (CRI) method for solving linear systems Wang et al. (2017) [50] , we solve generalized Lyapunov matrix equation A X + X A T + ∑ j = 1 m K j X K j T = C , where A , K j (j = 1 ,... , m) , C ∈ C n × n are known and X ∈ C n × n must be determined. The convergence of the CRI iteration method is proved and an upper bound on the convergence rate is derived and then minimized. Numerical results show that the CRI iteration method is efficient for this matrix equation. [ABSTRACT FROM AUTHOR]

Wormhole propagation, arising in petroleum engineering, is used to describe the distribution of acid and the increase of porosity in carbonate reservoir under the dissolution of injected acid and plays a very important role in the product enhancement of oil and gas reservoirs. In this paper, a fully mixed virtual element method (VEM) is employed to discretize this problem, in which mixed VEM is used not only for the Darcy flow equations but also for approximation the concentration equation by introducing an auxiliary flux variable to guarantee full mass conservation. The stability, existence and uniqueness of solution of the associated mixed VEM are proved by fixed point theory. Also, we obtain unconditionally optimal error estimate for concentration and auxiliary flux variable of convection-diffusion equation, as well as for the velocity and pressure of Darcy equations in the L 2 norm. Finally, several numerical experiments are presented to support the theoretical analysis of convergence and to illustrate the applicability for solving actual problems. [ABSTRACT FROM AUTHOR]

A truly meshless numerical procedure to simulate stochastic elliptic interface problems is developed. The meshless method is based on the generalized moving least squares approximation. This method can be implemented in a straightforward manner and has a very good accuracy for solving this kind of problems. Several realistic examples are presented to investigate the efficiency of the new procedure. Furthermore, compared with other meshless methods that have been developed, the present technique needs less CPU time. [ABSTRACT FROM AUTHOR]

The very recently introduced Virtual Element Method (VEM) is a numerical method for solving partial differential equations that was created out of the mimetic difference method, but was later reformulated into the Galerkin framework. It is a generalization of the standard Finite Element Method (FEM) to general meshes made up by arbitrary polyhedra. The greatest advantage of VEM is its ability to deal with very complex geometries, i.e., made up by elements of any number of edges not necessarily convex, hanging nodes, flat angles, collapsing nodes, etc., while retaining the same approximation properties of FEM. In this article, the C 0 -virtual element method is formulated and analyzed to solve generalized Swift-Hohenberg equation on polygonal meshes. The Swift-Hohenberg equation as a central nonlinear model in modern physics has a gradient flow structure. Here, we present the spatial VE discretization based on a mixed formulation for the nonlinear Swift-Hohenberg equation as a class of fourth-order gradient flow problems. For time discretization, we use Crank-Nicolson so that the resulting scheme is unconditionally stable and second-order in time. By following the algebraic implementation of the discrete system, we provide numerical tests validating the theoretical estimates and plotting two-dimensional pattern formation problems. [ABSTRACT FROM AUTHOR]

Recently, the reduced order model (ROM) has been applied to reduce the computational cost of numerical methods. Merging this approach with the lattice Boltzmann method (LBM) as a powerful mesoscale fluid solver seems promising. Dealing with this idea requires a matrix form for the LBM. This matrix form must represent all the LBM's algorithm steps (including boundary condition implementation) to just one specific matrix-vector relation. Furthermore, the LBM contains some nonlinear parts inside the equilibrium distribution function (EDF), which must be treated with a nonlinear ROM like the discrete empirical interpolation method (DEIM). So, in this paper, we discuss proper orthogonal decomposition (POD)-ROM LBM in the general form, present an appropriate matrix form for the LBM as explained, and implement POD or DEIM on that matrix form. In the end, the ability of this scheme is challenged with solving the urban air pollutant transition problem over some canyons areas as a practical problem. [ABSTRACT FROM AUTHOR]

This research work presents a newly truly meshless approach based upon the integrated radial basis functions (IRBFs) technique to study the fractional modified anomalous sub‐diffusion equation. First, the temporal direction is discretized by a finite difference method with second‐order accuracy. The stability analysis and convergence of the proposed time‐discrete formulation are investigated, theoretically. Then, the spatial direction is approximated by the IRBFs methodology. In this approach, the largest‐order derivative is approximated by a linear combination of RBFs and then the lower‐order derivative and also the unknown function are constructed by repeated integration. According to this procedure, the existing derivatives in the main fractional PDE are approximated smoothly. Furthermore, to show the efficiency of the developed numerical procedure, we employed some non‐rectangular computational domains to obtain the numerical results. On the other hand, the mentioned model is solved in one‐ two‐, and three dimensional cases. The numerical results confirm the ability and efficiency of the new numerical method for solving time fractional PDEs on complex computational domains. [ABSTRACT FROM AUTHOR]

In this research the numerical solution of nonlinear degenerate parabolic equations is investigated by a new sixth‐order finite difference weighted essentially nonoscillatory (WENO) based on exponential polynomials. In smooth regions, the new scheme, named as EPWENO6, can achieve the maximal approximation order while in critical points it does not lose its accuracy. In order to better approximation near steep gradients without spurious oscillations, the EPWENO6 scheme is designed by the exponential polynomials that are incorporated into the WENO reconstruction. In design of nonlinear weights that play a very important role in WENO reconstructions, a global smoothness indicator using generalized undivided differences is introduced. To analyze the convergence order of the EPWENO6 method in full detail, the Lagrange‐type exponential functions have been used. By comparing the EPWENO6 scheme and other existing WENO schemes for solving degenerate parabolic equations, it can be seen that the new scheme offers better results while its computational cost is less. To illustrate the effectiveness of the proposed scheme, a number of numerical experiments are considered. [ABSTRACT FROM AUTHOR]

The current work concerns to develop a new local meshless procedure to simulate the one-, two- and three-dimensional space Galilei invariant fractional advection-diffusion (GI-FAD) equations. The fractional derivative is discretized by a second-order finite difference formula. The unconditional stability and rate of convergence of the time-discrete scheme are analytically studied. Then, we employ the shape functions of moving Kriging interpolation for the differential quadrature (DQ) method. According to this combination, we can derive a new local meshless technique. At the end, some examples are solved to confirm the theoretical results and efficiency of the proposed meshless method. [ABSTRACT FROM AUTHOR]

In this article, we proposed an enhancement to the convergence rate of Landweber's method by incorporating the concept of momentum acceleration. Landweber's method is commonly used to solve least squares problems of the form min x ‖ A x − b ‖. Our approach is based on Landweber's method, which is acknowledged as a particular case of the methodologies outlined in Ding and Chen (2006). Through optimizing the momentum parameter, we were able to demonstrate the superior performance of the momentum-accelerated Landweber method. Specifically, we established that when A is a nonsquare m × n matrix with Rank (A) = n and σ min (A) ≠ σ max (A) , the momentum-accelerated Landweber method with the optimal parameter consistently outperforms the standard Landweber method. Our numerical experiments have confirmed the theoretical findings, demonstrating a notable improvement in the convergence rate of the Landweber method. [ABSTRACT FROM AUTHOR]

This study presents some new iterative algorithms based on the gradient method to solve general constrained systems of conjugate transpose matrix equations for both real and complex matrices. In addition, we analyze the convergence properties of these methods and provide numerical techniques to determine the solutions. Then we prove that the optimal parameters of the new algorithm satisfy a constrained optimization problem. The effectiveness of the proposed iterative methods is demonstrated through various numerical examples employed in this study and compared the results by some existing algorithms. [ABSTRACT FROM AUTHOR]

This paper introduces an extension of a fully discrete matrix–vector form (MVF) for the lattice Boltzmann method (LBM) to handle the multiple relaxation time parameter (MRT) LBM. The proposed approach offers a more efficient and practical framework for simulating fluid flows, with the added benefit of being able to handle complex geometries using the image-based ghost (IBG) method. The advantages and limitations of this approach are discussed, including its simplicity in linear algebraic extension, parallel computing capability, computational speed, and memory usage. The results of numerical experiments demonstrate the improved computational efficiency of the proposed method, highlighting its potential for future applications in various fields of computational fluid dynamics. [ABSTRACT FROM AUTHOR]

In this work, we develop a Legendre spectral element method (LSEM) for solving the stochastic nonlinear system of advection–reaction–diffusion models. The used basis functions are based on a class of Legendre functions such that their mass and diffuse matrices are tridiagonal and diagonal, respectively. The temporal variable is discretized by a Crank–Nicolson finite-difference formulation. In the stochastic direction, we also employ a random variable W based on the Q-Wiener process. We inspect the rate of convergence and the unconditional stability for the achieved semi-discrete formulation. Then, the Legendre spectral element technique is used to obtain a full-discrete scheme. The error estimation of the proposed numerical scheme is substantiated based upon the energy method. The numerical results confirm the theoretical analysis. [ABSTRACT FROM AUTHOR]

• The prostate tumor growth model. • An asymptotic analysis. • A generalized moving least squares technique. • Experimental data. This paper focuses on presenting an asymptotic analysis and employing simulations of a model describing the growth of local prostate tumor (known as a moving interface problem) in two-dimensional spaces. We first demonstrate that the proposed mathematical model produces the diffuse interfaces with the hyperbolic tangent profile using an asymptotic analysis. Next, we apply a meshless method, namely the generalized moving least squares approximation for discretizing the model in the space variables. The main benefits of the developed meshless method are: First, it does not need a background mesh (or triangulation) for constructing the approximation. Second, the obtained numerical results suggest that the proposed meshless method does not need to be combined with any adaptive technique for capturing the evolving interface between the tumor and the neighboring healthy tissue with proper accuracy. A semi-implicit backward differentiation formula of order 1 is used to deal with the time variable. The resulting fully discrete scheme obtained here is a linear system of algebraic equations per time step solved by an iterative scheme based on a Krylov subspace, namely the generalized minimal residual method with zero–fill incomplete lower–upper preconditioner. Finally, some simulation results based on estimated and experimental data taken from the literature are presented to show the process of prostate tumor growth in two-dimensional tissues, i.e., a square, a circle and non-convex domains using both uniform and quasi-uniform points. [ABSTRACT FROM AUTHOR]

This article reports our explorations for solving second-order hyperbolic interface problems by immersed weak Galerkin (IWG) method on interface independent meshes. The method presented here uses IWG functions for the discretization in spatial variable. The study includes the Newmark algorithm which has been used extensively in applications. The stability analysis based on the energy method is presented for semi-discrete and fully-discrete schemes under some conditions on parameters of the Newmark algorithm. In this work, we carried out a convergence analysis and obtained optimal a priori error estimates in both energy and L 2 norms for the semi-discrete and fully-discrete schemes under piecewise H 2 regularity assumption in space and some conditions on parameters of the Newmark algorithm. We demonstrate that the maximal error in the L 2 -norm error over a finite time interval converges optimally as O (h 2 + τ r (γ)) , where r (γ) = 1 if γ ≠ 1 / 2 , r (1 / 2) = 2 , h and τ are the mesh size and the time step, respectively. Numerical examples are provided to confirm theoretical findings and illustrate the efficiency of the method for standing and traveling waves. [ABSTRACT FROM AUTHOR]

Complex linear equation systems appear in many branches of mathematical sciences and have many applications in science and engineering. Therefore, there have been developed many methods to solve them. Here a new method based on decomposition of coefficient matrix for the solution of a positive symmetric linear system is studied. Our method uses two parameters. We obtain a domain on which this new method converges without any condition. We will also discuss how to calculate optimal parameters. Moreover we will prove that there exists a region in R 2 such that DPS method is faster than CRI method (Wang et al. (2017) [48]). Finally some test problems will be given and simulation results will be reported to support the theoretical results. [ABSTRACT FROM AUTHOR]

Some matrix equations are important in application and studying in various fields of sciences. One of them is continuous-time algebraic Riccati matrix equation that is an interesting subject for many researchers in engineering and sciences specially applied mathematics. In this work we try to apply Hermitian and skew-Hermitian splitting (HSS) like method to solve this equation. Then we analyze the convergence of the new iterative method in detail. Also we try to determine the optimum parameter in our method which minimizes the upper bounds of absolute error. In the end we test the new algorithm by solving some numerical examples. [ABSTRACT FROM AUTHOR]

A numerical solution for neutral delay fractional order partial differential equations involving the Caputo fractional derivative is constructed. In line with this goal, the drift term and the time Caputo fractional derivative are discretized by a finite difference approximation. The energy method is used to investigate the rate of convergence and unconditional stability of the temporal discretization. The interpolation of moving Kriging technique is then used to approximate the space derivative, yielding a meshless numerical formulation. We conclude with some numerical experiments that validate the theoretical findings. [ABSTRACT FROM AUTHOR]

The delay PDEs are called partial functional differential equations as their unknown solutions are used in these equations as functional arguments. On the other hand, a neutral delay PDE is an especial case when the equation depends on the derivative(s) of the solution at some past stage(s). The current paper concerns to find an accurate and robust numerical solution for solving neutral delay time-space distributed-order fractional damped diffusion-wave equation based on the Galerkin meshless method. The test and trial functions for the used Galerkin method are constructed from the shape functions of reproducing kernel particle method (RKPM). For this aim, time derivative is approximated by a finite difference formula with convergence order O (τ 3 − α) where 1 < α < 2. The stability and convergence of the time-discrete formulation are studied. For the next stage and to derive a fully-discrete scheme, we employ the Galerkin RKPM method. Moreover, the error estimate of the full-discrete scheme of new technique is discussed. Finally, an example is examined to check the proposed algorithm. [ABSTRACT FROM AUTHOR]

The current paper proposes a new high-order finite difference scheme with low computational complexity to solve the space-time fractional tempered diffusion equation. At the first stage, the time derivative has been approximated by a difference scheme with second-order accuracy. Furthermore, in the next step, a compact operator has been employed to discretize the space derivative with fourth-order accuracy. After deriving the time-discrete scheme, its stability is analysed. So, a suitable term is added to the main difference scheme. By adding this term, we could construct the main ADI scheme. In the final stage, the convergence order of the full-discrete scheme based upon the ADI formulation is proved. The convergence order of the constructed technique is O ((h x α) 4 + (h y β) 4 + τ 2). The numerical results show the efficiency of the new technique. [ABSTRACT FROM AUTHOR]

This article is devoted to applying a local meshless method for specifying an unknown control parameter in one- and multi-dimensional inverse problems which are considered with a temperature overspecification condition at a specific point or an energy overspecification condition over the computational domain. Finding the unknowns in inverse problems is a challenge because these problems are modeled as non-classical parabolic problems and also have a significant role in describing physical phenomena of the real world. In this study, a combination of the meshless method of radial basis functions and finite difference method (called radial basis function-finite difference method) is used to solve inverse problems because this method has two important features. First it does not require any mesh generation. Consequently, it can be exerted to handle the high-dimensional inverse problems. Secondly, since this method is local, at each time step, a system with a sparse coefficient matrix is solved. Hence, the computational time and cost will be much low. Various numerical examples are examined, and also the accuracy and computational time required are presented. The numerical results indicate that the mentioned procedure is appropriate for the identification of the unknown parameter of inverse problems. [ABSTRACT FROM AUTHOR]

In this study, a linearized locally conservative scheme, based on using a weak Galerkin (WG)-mixed finite element method (MFEM), is developed for the Poisson–Nernst–Planck (PNP) system. In the dual-mixed formulation of the PNP equation, in addition to the three unknowns of concentrations p , n and the potential ψ , their fluxes, namely, σ p = ∇ p + p σ ψ and σ n = ∇ n − n σ ψ and σ ψ = ∇ ψ are introduced. These fluxes have an essential role in specifying the Debye layer and computing the electric current. The WG-MFEM considered here uses discontinuous functions to construct the approximation space. Also, a linearization scheme is employed to treat nonlinear terms. In the proposed method, the important physical laws of mass conservation and free energy dissipation are preserved without any restriction on the time step. Error estimates are developed and analyzed for both semi- and fully discrete WG-MFEM schemes. Furthermore, optimal error estimates (under adequate regularity assumptions on the solution) are derived. Several numerical results are provided and they demonstrate the efficiency of the proposed method and validate the convergence theorems. [ABSTRACT FROM AUTHOR]

This article is assigned to the numerical analysis of a new weak Galerkin mixed-type finite element method for the diffusion-convection-reaction problem with singular perturbation. The variational form of the considered method compared to the existing methods consists of a single variational equation, where flux is the only unknown. Hence it is sufficient to provide a weak Galerkin approximation for the flux variable, and immediately approximation of the primal unknown can be obtained by a post-processing strategy. We prove the well-posedness, stability and convergence of the weak Galerkin scheme. Eventually, some numerical experiments to support the nice efficiency of the technique and analytical results are presented. [ABSTRACT FROM AUTHOR]

An approximation based on moving least squares for vector-valued functions satisfying the divergence-free property was employed in [67] by Trask, Maxey, and Hu. They changed the traditional polynomial bases in moving least squares approximation to the vector-valued polynomial basis functions satisfying the divergence-free property for constructing a new vector-valued approximation. In this paper, we adopt [67] , but we consider another approach, i.e., a direct method based on the generalized moving least squares (GMLS) approximation for vector-valued functions, which satisfy the divergence-free property. This GMLS approximation produces diffuse or uncertain derivatives for each component of the proposed vector-valued approximation satisfying the divergence-free property. Using the new approach, the linear functionals such as the derivatives act only on each row of the vector-valued polynomial basis functions, which reduces the computational cost comparing with the divergence-free moving least squares approximation. The pointwise error estimates of the presented approximation are obtained for the bounded sub-domains in R d (d ≥ 2) with an interior cone condition. Some numerical results are provided to confirm the obtained theoretical results. As an application, the Cahn-Hilliard-Hele-Shaw (CHHS) equation is solved numerically via a stabilized semi-implicit scheme in time that holds the mass conservative and energy dissipative properties and also the GMLS approximation in space. Besides, the developed vector-valued approximation has been used to compute the Leray-Helmholtz projection of the advective velocity. [ABSTRACT FROM AUTHOR]

Recently, finding a stable and convergent numerical procedure to simulate the fractional partial differential equations (PDEs) is one of the interesting topics. Meanwhile, the fractional advection‐diffusion equation is a challenge model numerically and analytically. This paper develops a new meshless numerical procedure to simulate the fractional Galilei invariant advection‐diffusion equation. The fractional derivative is the Riemann‐Liouville fractional derivative sense. At the first stage, a difference scheme with the second‐order accuracy has been employed to get a semi‐discrete plan. After this procedure, the unconditional stability has been investigated, analytically. At the second stage, a meshless weak form based upon the interpolating stabilized element‐free Galerkin (ISEFG) method has been used to achieve a full‐discrete scheme. As for the full‐discrete scheme, the order of convergence is O(τ2+rm+1). Two examples are studied, and simulation results are reported to verify the theoretical results. [ABSTRACT FROM AUTHOR]

This manuscript is devoted to analysis of a novel meshless numerical procedure for solving the inverse tempered fractional diffusion equation. The employed numerical technique is based on a modification of element-free Galerkin (EFG) method, and the shape functions of interpolating moving least squares approximation are utilized for ingredients of the test and trial functions. At the first stage, the time derivative is discretized by a Crank–Nicolson idea to derive a semi-discrete scheme. In the next stage, the space variable is approximated by the EFG procedure. The convergence rate and stability of the time-discrete formulation are analyzed. Furthermore, the error estimate of the full-discrete plan is discussed in detail. In the end, some numerical experiments are investigated to check the theoretical results and the efficiency of the developed technique. [ABSTRACT FROM AUTHOR]

In this research, a class of radial basis functions (RBFs) ENO/WENO schemes with a Lax–Wendroff time discretization procedure, named as RENO/RWENO‐LW, for solving Hamilton–Jacobi (H–J) equations is designed. Particularly the multi‐quadratic RBFs are used. These schemes enhance the local accuracy and convergence by locally optimizing the shape parameters. Comparing with the original WENO with Lax–Wendroff time discretization schemes of Qiu for HJ equations, the new schemes provide more accurate reconstructions and sharper solution profiles near strong discontinuous derivative. Also, the RENO/RWENO‐LW schemes are easy to implement in the existing original ENO/WENO code. Extensive numerical experiments are considered to verify the capability of the new schemes. [ABSTRACT FROM AUTHOR]

In this study, we derive optimal uniform error bounds for moving least‐squares (MLS) mesh‐free point collocation (also called finite point method) when applied to solve second‐order elliptic partial integro‐differential equations (PIDEs). In the special case of elliptic partial differential equations (PDEs), we show that our estimate improves the results of Cheng and Cheng (Appl. Numer. Math. 58 (2008), no. 6, 884–898) both in terms of the used error norm (here the uniform norm and there the discrete vector norm) and the obtained order of convergence. We then present optimal convergence rate estimates for second‐order elliptic PIDEs. We proceed by some numerical experiments dealing with elliptic PDEs that confirm the obtained theoretical results. The article concludes with numerical approximation of the linear parabolic PIDE arising from European option pricing problem under Merton's and Kou's jump‐diffusion models. The presented computational results (including the computation of option Greeks) and comparisons with other competing approaches suggest that the MLS collocation scheme is an efficient and reliable numerical method to solve elliptic and parabolic PIDEs arising from applied areas such as financial engineering. [ABSTRACT FROM AUTHOR]

This article is devoted to solving numerically the nonlinear generalized Benjamin–Bona–Mahony–Burgers (GBBMB) equation that has several applications in physics and applied sciences. First, the time derivative is approximated by using a finite difference formula. Afterward, the stability and convergence analyses of the obtained time semi‐discrete are proven by applying the energy method. Also, it has been demonstrated that the convergence order in the temporal direction is O(dt). Second, a fully discrete formula is acquired by approximating the spatial derivatives via Legendre spectral element method. This method uses Lagrange polynomial based on Gauss–Legendre–Lobatto points. An error estimation is also given in detail for full discretization scheme. Ultimately, the GBBMB equation in the one‐ and two‐dimension is solved by using the proposed method. Also, the calculated solutions are compared with theoretical solutions and results obtained from other techniques in the literature. The accuracy and efficiency of the mentioned procedure are revealed by numerical samples. [ABSTRACT FROM AUTHOR]

This paper introduces a high-order numerical procedure to solve the two-dimensional distributed-order Riesz space-fractional diffusion equation. In the proposed technique, first, a second-order numerical integration rule is employed to estimate the integral of the distributed-order Riesz space-fractional derivative. Then, the time derivative is discretized by a second-order difference scheme. Finally, the spatial direction is approximated by a difference formulation with fourth-order accuracy. The stability of the semi-discrete scheme is analyzed. We conclude that the difference between two consecutive time steps i.e. U i , j n − U i , j n − 1 is nearly zero when n → ∞. So, a suitable term is added to the main difference scheme as by adding this term we could derive the main ADI scheme. Furthermore, to reduce the used CPU time, we combine the fourth-order ADI formulation with the proper orthogonal decomposition method and then we gain a POD based reduced-order compact ADI finite difference plane. In the next, the convergence order of the fully discrete formulation has been investigated. The numerical results show the efficiency of new technique. It must be noted that the finite difference method is an effective and robust numerical technique for solving nonlinear equations that the ADI approach can be combined with it to improve the numerical simulations. [ABSTRACT FROM AUTHOR]

This paper is dedicated to numerically solving the Sobolev equations that have several applications in physics and mechanical engineering. First, the temporal derivative is discretized by the Crank-Nicolson finite difference technique to obtain a semi-discrete scheme in the temporal direction. Afterward, the stability and convergence analysis of the time semi-discrete scheme are proven by applying the energy method. It also implies that the convergence order in the temporal direction is O (d t 2). Second, a fully discrete formula has been acquired by discretizing the spatial derivatives via Legendre spectral element method (LSEM). This method applies the Lagrange polynomial based on the Gauss-Legendre-Lobatto (GLL) points. Moreover, an error estimation is given for the obtained fully discrete scheme. Eventually, the two-dimensional Sobolev equations are solved by using the proposed procedure. The accuracy and efficiency of the mentioned procedure are demonstrated by several numerical examples. [ABSTRACT FROM AUTHOR]

The absolute value equation appears in various fields of applied mathematics such as operational research. Here we consider its generalized version AX + B | X | = C , where A , B , C ∈ C n × n are given, | X | = (| x i , j |) and X ∈ C n × n is an unknown matrix that must be determined. In this investigation, based on the Picard matrix splitting iteration method, we applied a matrix splitting method for solving it. We will see that under the condition σ min (A) > n σ max (| B |) , this method is convergent, where σ max (| B |) denotes the largest singular value of matrix | B | and σ min (A) denotes the smallest singular value of matrix A. Then we give some convergence theorems for our new method and analyze this procedure in detail. Then we consider a p -step iteration method for solving this equation and analyze this procedure. Numerical experiment results show the efficiency of the method. [ABSTRACT FROM AUTHOR]

In this paper stability of numerical solution of Fredholm integral equation of the first kind is studied for radial basis kernels which possess positive Fourier transform. As a result, the equivalence relation between strong and weak forms of partial differential equations (PDEs) is proved for some special radial test functions. Also the stability of boundary elements method (BEM) is proved analytically for Laplace and Helmholtz equations by obtaining Fourier transform of singular fundamental solutions applied in BEM. Analytical result presented in this paper is an extension of stability idea of radial basis functions (RBFs) used to interpolate scattered data described by Wendland in [51]. Similar to the interpolation, it is proved here mathematically that integral operators which have radial kernels with positive Fourier transform are strictly positive definite. Thanks to the stability idea presented in [51] , a positive lower bound for eigenvalues of these integral operators is found here, explicitly. [ABSTRACT FROM AUTHOR]