Short Note: A Note on Nonstandard Finite Difference Schemes for Reaction–Diffusion Equations Having Linear Advection

Nonstandard modified upwind difference scheme for one dimensional nonlinear reaction–diffusion equation with linear advection is given in this note. The use of a positivity condition allows the determination of a functional relation between the time and space step sizes, and it is weaker than that of the corresponding simple upwind difference scheme. Error estimate in the discrete l ^∞ norm is provided under suitable assumptions.     

Multi-Level Spliting Methods Solving Difference Equations

Ｍｕｌｔｉ┐ＬｅｖｅｌＳｐｌｉｔｉｎｇＭｅｔｈｏｄｓＳｏｌｖｉｎｇＤｉｆｅｒｅｎｃｅＥｑｕａｔｉｏｎｓ＊）ＬｉＦｅｎｇ（李锋）ＬｉＲｏｎｇｈｕａ（李荣华）（ＩｎｓｔｉｔｕｔｅｏｆＭａｔｈｅｍａｔｉｃｓ，ＪｉｌｉｎＵｎｉｖｅｒｓｉｔｙ，Ｃｈａｎｇｃｈｕ...     

Domain Decomposition Method Modified by Characteristic Finite Element Procedure for System of Parabolic Equations with Discontinuous Coefficients

In this work, system of parabolic equations with discontinuous coefficients is studied. The domain decomposition method modified by a characteristic finite element procedure is applied. A function is defined to approximate the fluxes on inner boundaries by using the solution at the previous level. Thus the parallelism is achieved. Convergence analysis and error estimate are also presented.     

Energy estimates and numerical verification of the stabilized Domain Decomposition Finite Element/Finite Difference approach for time-dependent Maxwell’s system

We rigorously derive energy estimates for the second order vector wave equation with gauge condition for the electric field with non-constant electric permittivity function. This equation is used in the stabilized Domain Decomposition Finite Element/Finite Difference approach for time-dependent Maxwell’s system. Our numerical experiments illustrate efficiency of the modified hybrid scheme in two and three space dimensions when the method is applied for generation of backscattering data in the reconstruction of the electric permittivity function.     

Consistent Numerical Schemes for Solving Nonlinear Inverse Source Problems with Gradient-Type Algorithms and Newton–Kantorovich Methods

In this paper, algorithms of solving an inverse source problem for systems of production–destruction equations are considered. Numerical schemes that are consistent to satisfy Lagrange’s identity for solving direct and adjoint problems are constructed. With the help of adjoint equations, a sensitivity operator with a discrete analog is constructed. It links perturbations of the measured values with those of the sought-for model parameters. This operator transforms the inverse problem to a quasilinear system of equations and allows applying Newton–Kantorovich methods to it. A numerical comparison of gradient algorithms based on consistent and inconsistent numerical schemes and a Newton–Kantorovich algorithm applied to solving an inverse source problem for a nonlinear Lorenz model is done.     

Fast Algorithms for Solving the Inverse Scattering Problem for the Zakharov–Shabat System of Equations and Their Applications

Mathematical Notes - The problem of numerical solution of a nonlinear Schrödinger equation is considered from the point of view of applications to the compensation of signal distortions in a...     

A Note on Preconditioned Conjugate Gradients for Solving Singular Systems

The polynomial accelerations are very efficient methods for solving largesparse linear systems.In[2]we discussed the general polynomial accelerationmethods based on basic iteration methods for solving singular systems,especi-ally,the Chebyshev semi-iteration and the preconditioned conjugate gradientacceleration.In[4]E.F.Kaasschieter discussed the preconditioned conjugategradients for solving singular systems of which the coefficient matrices aresingular Stieljes matrices by using incomplete Cholesky decomposition as     

Meromorphic Functions of Finite φ-order and Linear Askey–Wilson Divided Difference Equations

The growth of meromorphic solutions of linear difference equations containing Askey–Wilson divided difference operators is estimated. The φ-order is used as a general growth indicator,which covers the growth spectrum between the logarithmic order ρlog(f) and the classical order ρ(f)of a meromorphic function f.     

Difference Schemes on Nonuniform Grids for the Two-Dimensional Convection–Diffusion Equation

New second-order accurate monotone difference schemes on nonuniform spatial grids for two-dimensional stationary and nonstationary convection–diffusion equations are proposed. The monotonicity and stability of the solutions of the computational methods with respect to the boundary conditions, the initial condition, and the right-hand side are proved. Two-sided and corresponding a priori estimates are obtained in the grid norm of C. The convergence of the proposed algorithms to the solution of the original differential problem with the second order is proved.     

The Chebyshev–Shamanskii Method for Solving Systems of Nonlinear Equations

We present a method, based on the Chebyshev third-order algorithm and accelerated by a Shamanskii-like process, for solving nonlinear systems of equations. We show that this new method has a quintic convergence order. We will also focus on efficiency of high-order methods and more precisely on our new Chebyshev–Shamanskii method. We also identify the optimal use of the same Jacobian in the Shamanskii process applied to the Chebyshev method. Some numerical illustrations will confirm our theoretical analysis.     

Nonmonotone Self-adaptive Levenberg–Marquardt Approach for Solving Systems of Nonlinear Equations

The well-known Levenberg–Marquardt method is used extensively to solve systems of nonlinear equations. An extension of the Levenberg–Marquardt method based on new nonmonotone technique is described. To decrease the total number of iterations, this method allows the sequence of objective function values to be nonmonotone, especially in the case where the objective function is ill-conditioned. Moreover, the parameter of Levenberg–Marquardt is produced according to the new nonmonotone strategy to use the advantages of the faster convergence of the Gauss–Newton method whenever iterates are near the optimizer, and the robustness of the steepest descent method in the case in which iterates are far away from the optimizer. The global and quadratic convergence of the proposed method is established. The results of numerical experiments are reported.     

Unconditionally Stable Algorithm for Solving the Three-Dimensional Nonstationary Navier–Stokes Equations

We propose an unconditionally stable method for solving the three-dimensional nonstationary Navier–Stokes equations in the velocity–pressure variables. The method is based on a conservative finite-difference scheme and the simultaneous solution of the momentum and continuity equations at each time layer. The velocity and pressure fields are calculated by using a parallel algorithm for solving systems of linear equations by the Gauss method.     

Numerical Method for Solving an Inverse Problem for Laplace’s Equation in a Domain with an Unknown Inner Boundary

Computational Mathematics and Mathematical Physics - An inverse problem for Laplace’s equation in a doubly connected two-dimensional domain is considered. Given Dirichlet and Neumann data...     

A High-Order Finite Difference Scheme for 3D Unsteady Convection Diffusion Reaction Equations北大核心CSCD

针对三维非稳态对流扩散反应方程,构造了一种高精度紧致有限差分格式,对空间的离散采用四阶紧致差分方法,对时间的离散采用Taylor级数展开和余项修正技术,所提格式在时间上的精度为二阶、在空间上的精度为四阶。利用Fourier稳定性分析法证明了该格式是无条件稳定的。最后给出数值算例验证了理论结果。     

On Two Iterative Least-Squares Finite Element Schemes for the Incompressible Navier–Stokes Problem

This paper is mainly devoted to a comparative study of two iterative least-squares finite element schemes for solving the stationary incompressible Navier–Stokes equations with velocity boundary condition. Introducing vorticity as an additional unknown variable, we recast the Navier–Stokes problem into a first-order quasilinear velocity–vorticity–pressure system. Two Picard-type iterative least-squares finite element schemes are proposed to approximate the solution to the nonlinear first-order problem. In each iteration, we adopt the usual L ² least-squares scheme or a weighted L ² least-squares scheme to solve the corresponding Oseen problem and provide error estimates. We concentrate on two-dimensional model problems using continuous piecewise polynomial finite elements on uniform meshes for both iterative least-squares schemes. Numerical evidences show that the iterative L ² least-squares scheme is somewhat suitable for low Reynolds number flow problems, whereas for flows with relatively higher Reynolds numbers the iterative weighted L ² least-squares scheme seems to be better than the iterative L ² least-squares scheme. Numerical simulations of the two-dimensional driven cavity flow are presented to demonstrate the effectiveness of the iterative least-squares finite element approach.     

A Mesh Free Stochastic Algorithm for Solving Diffusion–Convection–Reaction Equations on Complicated Domains

A mesh free stochastic algorithm for solving transient diffusion–convection–reaction problems on domains with complicated structure is suggested. For the solutions of this kind of equations exact representations of the survival probabilities, the probability densities of the first passage time and position on a sphere are obtained. Based on these representations we construct a stochastic algorithm which is simple in implementaion for solving one- and three-dimensional diffusion–convection–reaction equations. The method is continuous both in space and time, and its advantages are particularly well manifested in solving problems on complicated domains, calculating fluxes to parts of the boundary, and other integral functionals, for instance, the total concentration of the particles which have been reacted to a time instant t.     

Multisplitting Iteration Schemes for Solving a Class of Nonlinear Complementarity Problems

We consider several synchronous and asynchronous multisplitting iteration schemes for solving aclass of nonlinear complementarity problems with the system matrix being an H-matrix.We establish theconvergence theorems for the schemes.The numerical experiments show that the schemes are efficient forsolving the class of nonlinear complementarity problems.