Applied Numerical Mathematics最新文献

In this paper, we study a numerical scheme to solve the nonlinear Maxwell's equations. The discrete scheme is based on the triangular spectral element method (TSEM) in space and the exponential time differencing fourth-order Runge-Kutta (ETDRK4) method in time. TSEM has the advantages of spectral accuracy and geometric flexibility. The ETD method involves exact integration of the linear part of the governing equation followed by an approximation of an integral involving the nonlinear terms. The RK4 scheme is introduced for the time integration of the nonlinear terms. The stability region of the ETDRK4 method is depicted. Moreover, the contour integral in the complex plan is utilized and improved to compute the matrix function required by the implementation of ETDRK4. The numerical results demonstrate that our proposed method is of exponential convergence with the order of basis function in space and fourth order accuracy in time.

In this study, a numerical scheme to a system of second-kind linear Fredholm integral equations featuring a Green's kernel function is proposed. This involves introducing Galerkin and iterated Galerkin (IG) methods based on piecewise polynomials to tackle the integral model. A thorough analysis of convergence and error for these proposed methods is carried out. Firstly, the existence and uniqueness of solutions for the Galerkin and iterated Galerkin methods are established. Later, the order of convergence is derived using tools from functional analysis and the boundedness property of Green's kernel. The Galerkin scheme has $O\left(h^{\alpha }\right)$ order of convergence. Next, the superconvergence of the iterated Galerkin (IG) method is established. The IG method exhibits $O\left(h^{\alpha +{\alpha }^{⁎}}\right)$ order of convergence. Theoretical findings are validated through extensive numerical experiments.

In this work, we focus on a class of Ψ− fractional integro-differential equations (Ψ-FIDEs) involving Ψ-Caputo derivative. The objective of this paper is to derive the numerical solution of Ψ-FIDEs in the truncated Bell series. Firstly, Ψ-FIDEs by using the definition of Ψ− Caputo derivative is converted into a singular integral equation. Then, a computational procedure based on the Bell polynomials, Gauss-Legendre quadrature rule, and collocation method is developed to effectively solve the singular integral equation. The convergence of the approximation obtained in the presented strategy is investigated. Finally, the effectiveness and superiority of our method are revealed by numerical samples. The results of the suggested approach are compared with the results obtained by extended Chebyshev cardinal wavelets method (EChCWM).

In this paper, we consider the numerical approximation of incompressible magnetohydrodynamic (MHD) system with variable density. Firstly, we provide first- and second-order time discretization schemes based on the convective form of the Gauge-Uzawa method. Secondly, we prove that the proposed schemes are unconditionally stable. We also provide error estimates through rigorous theoretical analysis. Then, we construct a fully-discrete first-order scheme with finite elements in space and provide its stability result. Finally, we present some numerical experiments to validate the effectiveness of the proposed schemes. Furthermore, we also present the conserved scheme and its numerical results.

In this work, we investigate a linear second-order numerical method for the Allen-Cahn equation with general mobility. The proposed scheme is a combination of the two-step first- and second-order backward differentiation formulas for time approximation and the central finite difference for spatial discretization, two additional stabilizing terms are also included. The discrete maximum bound principle of the numerical scheme is rigorously proved under mild constraints on the adjacent time-step ratio and the two stabilization parameters. Furthermore, the error estimates in $H^1$-norm for the case of constant mobility and $L^{\infty }$-norm for the general mobility case, as well as the energy stability for both cases are obtained. Finally, we present extensive numerical experiments to validate the theoretical results, and develop an adaptive time-stepping strategy to demonstrate the performance of the proposed method.

In this work we solve initial-boundary value problems associated to coupled 2D parabolic singularly perturbed systems of convection-diffusion type. The analysis is focused on the cases where the diffusion parameters are small, distinct and also they may have different order of magnitude. In such cases, overlapping regular boundary layers appear at the outflow boundary of the spatial domain. The fully discrete scheme combines the classical upwind scheme defined on an appropriate Shishkin mesh to discretize the spatial variables, and the fractional implicit Euler method joins to a decomposition of the difference operator in directions and components to integrate in time. We prove that the resulting method is uniformly convergent of first order in time and of almost first order in space. Moreover, as only small tridiagonal linear systems must be solved to advance in time, the computational cost of our method is remarkably smaller than the corresponding ones to other implicit methods considered in the previous literature for the same type of problems. The numerical results, obtained for some test problems, corroborate in practice the good behavior and the advantages of the algorithm.

In this manuscript, we propose a new family of stabilized explicit parallelizable peer methods for the solution of stiff Initial Value Problems (IVPs). These methods are derived through the employment of a class of preconditioners proposed by Bassenne et al. (2021) [5] for the construction of a family of linearly implicit Runge-Kutta (RK) schemes.

In this paper, we combine the mentioned preconditioners with explicit two-step peer methods, obtaining a new class of linearly implicit numerical schemes that admit parallelism on the stages. Through an in-depth theoretical investigation, we set free parameters of both the preconditioners and the underlying explicit methods that allow deriving new peer schemes of order two, three and four, with good stability properties and small Local Truncation Error (LTE). Numerical experiments conducted on Partial Differential Equations (PDEs) arising from application contexts show the efficiency of the new peer methods proposed here, and highlight their competitiveness with other linearly implicit numerical schemes.

In this manuscript, we propose a stable algorithm for computing the zeros of Althammer polynomials. These polynomials are orthogonal with respect to a Sobolev inner product, and are even if their degree is even, odd otherwise. Furthermore, their zeros are real, distinct, and located inside the interval $(-1,1)$. The Althammer polynomial $p_n\left(x\right)$ of degree n satisfies a long recurrence relation, whose coefficients can be arranged into a Hessenberg matrix of order n, with eigenvalues equal to the zeros of the considered polynomial.

Unfortunately, the eigenvalues of this Hessenberg matrix are very ill–conditioned, and standard balancing procedures do not improve their condition numbers. Here, we introduce a novel algorithm for computing the zeros of $p_n\left(x\right)$, which first transforms the Hessenberg matrix into a similar symmetric tridiagonal one, i.e., a matrix whose eigenvalues are perfectly conditioned, and then computes the zeros of $p_n\left(x\right)$ as the eigenvalues of the latter tridiagonal matrix. Moreover, we propose a second algorithm, faster but less accurate than the former one, which computes the zeros of $p_n\left(x\right)$ as the eigenvalues of a truncated Hessenberg matrix, obtained by properly neglecting some diagonals in the upper part of the original matrix. The computational complexity of the proposed algorithms are, respectively, $O\left(\frac{n^3}{6}\right)$, and $O\left({\ell }^{2}n\right)$, with $\ell \ll n$ in general.