Stability and Time-Step Constraints of Implicit-Explicit Runge-Kutta Methods for the Linearized Korteweg-de Vries Equation

This paper provides a study on the stability and time-step constraints of solving the linearized Korteweg-de Vries(KdV)equation,using implicit-explicit(IMEX)Runge-Kutta(RK)time integration methods combined with either finite difference(FD)or local discontinuous Galerkin(DG)spatial discretization.We analyze the stability of the fully discrete scheme,on a uniform mesh with periodic boundary conditions,using the Fourier method.For the linearized KdV equation,the IMEX schemes are stable under the standard Courant-Friedrichs-Lewy(CFL)conditionτ≤λh.Here,λis the CFL number,τis the time-step size,and h is the spatial mesh size.We study several IMEX schemes and characterize their CFL number as a function ofθ=d/h^(2)with d being the dispersion coefficient,which leads to several interesting observations.We also investigate the asymptotic behaviors of the CFL number for sufficiently refined meshes and derive the necessary conditions for the asymptotic stability of the IMEX-RK methods.Some numerical experiments are provided in the paper to illustrate the performance of IMEX methods under different time-step constraints.

A streamline diffusion nonconforming finite element method for the time-dependent linearized Navier-Stokes equations

A nonconforming finite element method of finite difference streamline diffusion type is proposed to solve the time-dependent linearized Navier-Stokes equations. The backward Euler scheme is used for time discretization. Crouzeix-Raviart nonconforming finite element approximation, namely, nonconforming （P1）2 - P0 element, is used for the velocity and pressure fields with the streamline diffusion technique to cope with usual instabilities caused by the convection and time terms. Stability and error estimates are derived with suitable norms.

High Order IMEX Stochastic Galerkin Schemes for Linear Transport Equation with Random Inputs and Diffusive Scalings

In this paper,we consider the high order method for solving the linear transport equations under diffusive scaling and with random inputs.To tackle the randomness in the problem,the stochastic Galerkin method of the generalized polynomial chaos approach has been employed.Besides,the high order implicit-explicit scheme under the micro-macro decomposition framework and the discontinuous Galerkin method have been employed.We provide several numerical experiments to validate the accuracy and the stochastic asymptotic-preserving property.

An Extended Numerical Method by Stancu Polynomials for Solution of Integro-Differential Equations Arising in Oscillating Magnetic Fields

In this study, the Bernstein collocation method has been expanded to Stancu collocation method for numerical solution of the charged particle motion for certain configurations of oscillating magnetic fields modelled by a class of linear integro-differential equations. As the method has been improved, the Stancu polynomials that are generalization of the Bernstein polynomials have been used. The method has been tested on a physical problem how the method can be applied. Moreover, numerical results of the method have been compared with the numerical results of the other methods to indicate the efficiency of the method.

The Jaffa Transform for Hessian Matrix Systems and the Laplace Equation

Hessian matrices are square matrices consisting of all possible combinations of second partial derivatives of a scalar-valued initial function. As such, Hessian matrices may be treated as elementary matrix systems of linear second-order partial differential equations. This paper discusses the Hessian and its applications in optimization, and then proceeds to introduce and derive the notion of the Jaffa Transform, a new linear operator that directly maps a Hessian square matrix space to the initial corresponding scalar field in nth dimensional Euclidean space. The Jaffa Transform is examined, including the properties of the operator, the transform of notable matrices, and the existence of an inverse Jaffa Transform, which is, by definition, the Hessian matrix operator. The Laplace equation is then noted and investigated, particularly, the relation of the Laplace equation to Poisson’s equation, and the theoretical applications and correlations of harmonic functions to Hessian matrices. The paper concludes by introducing and explicating the Jaffa Theorem, a principle that declares the existence of harmonic Jaffa Transforms, which are, essentially, Jaffa Transform solutions to the Laplace partial differential equation.

SOLVERS FOR SYSTEMS OF LARGE SPARSE LINEAR AND NONLINEAR EQUATIONS BASED ON MULTI-GPUS

Numerical treatment of engineering application problems often eventually results in a solution of systems of linear or nonlinear equations.The solution process using digital computational devices usually takes tremendous time due to the extremely large size encountered in most real-world engineering applications.So,practical solvers for systems of linear and nonlinear equations based on multi graphic process units（GPUs）are proposed in order to accelerate the solving process.In the linear and nonlinear solvers,the preconditioned bi-conjugate gradient stable（PBi-CGstab）method and the Inexact Newton method are used to achieve the fast and stable convergence behavior.Multi-GPUs are utilized to obtain more data storage that large size problems need.

DISCONTINUOUS GALERKIN FINITE ELEMENT METHOD FOR A FORWARD-BACKWARD HEAT EQUATION

A space-time finite element method,discontinuous in time but continuous in space,is studied to solve the nonlinear forward-backward heat equation.A linearized technique is introduced in order to obtain the error estimates of the approximate solutions.And the numerical simulations are given.

ZEROS OF ENTIRE SOLUTIONS TO COMPLEX LINEAR DIFFERENCE EQUATIONS

In this article, we study the complex oscillation problems of entire solutions to homogeneous and nonhomogeneous linear difference equations, and obtain some relations of the exponent of convergence of zeros and the order of growth of entire solutions to complex linear difference equations.

A SINGULAR VALUE DECOMPOSITION BASED TRUNCATION ALGORITHM IN SOLVING THE STRUCTURAL DAMAGE EQUATIONS

The structural damage identification through modal data often leads to solving a set of linear equations. Special numerical treatment is sometimes required for an accurate and stable solution owing to the ill conditioning of the equations. Based on the singular value decomposition (SVD) of the coefficient matrix, an error based truncation algorithm is proposed in this paper. By rejection of selected small singular values, the influence of noise can be reduced. A simply-supported beam is used as a simulation example to compare the results to other methods. Illustrative numerical examples demonstrate the good efficiency and stability of the algorithm in the nondestructive identification of structural damage through modal data.

LIMITING DIRECTION AND BAKER WANDERING DOMAIN OF ENTIRE SOLUTIONS OF DIFFERENTIAL EQUATIONS

In this paper, we mainly investigate entire solutions of complex differential equations with coefficients involving exponential functions, and obtain the dynamical properties of the solutions, their derivatives and primitives. With some conditions on coefficients, for the solutions, their derivatives and their primitives, we consider the common limiting directions of Julia set and the existence of Baker wandering domain.

LIMITING DIRECTIONS OF JULIA SETS OF ENTIRE SOLUTIONS TO COMPLEX DIFFERENTIAL EQUATIONS

In this paper,we mainly investigate the dynamical properties of entire solutions of complex differential equations.With some conditions on coefficients,we prove that the set of common limiting directions of Julia sets of solutions,their derivatives and their primitives must have a definite range of measure.

Geometric interpretation of several classical iterative methods for linear system of equations and diverse relaxation parameter of the SOR method

Two kinds of iterative methods are designed to solve the linear system of equations, we obtain a new interpretation in terms of a geometric concept. Therefore, we have a better insight into the essence of the iterative methods and provide a reference for further study and design. Finally, a new iterative method is designed named as the diverse relaxation parameter of the SOR method which, in particular, demonstrates the geometric characteristics. Many examples prove that the method is quite effective.

LINEAR SINGULAR INTEGRAL EQUATION ON DOMAINS COMPOSED BY BALLS

For domains composed by balls in C^n, this paper studies the boundary behaviour of Cauchy type integrals with discrete holomorphic kernels and the corresponding linear singular integral equation on each piece of smooth lower dimensional edges on the boundary of the domain.

ASYNCHRONOUS RELAXED ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS OF EQUATIONS

In this paper, the asynchronous versions of classical iterative methods for solving linear systems of equations are considered. Sufficient conditions for convergence of asynchronous relaxed processes are given for H-matrix by which nor only the requirements of [3] on coefficient matrix are lowered, but also a larger region of convergence than that in [3] is obtained.

ESTIMATES FOR THE HYPER-ORDER OF SOLUTIONS OF CERTAIN LINEAR DIFFERENTIAL EQUATIONS

In this article, the authors study the growth of certain second order linear differential equation f″＋A（z）f′＋B（z）f=0 and give precise estimates for the hyperorder of solutions of infinite order. Under similar conditions, higher order differential equations will be considered.

On the Growth of Solutions of a Class of Higher Order Linear Differential Equations with Meromorphic Coefficients

In this paper, we investigate the growth of solutions of higher order linear differential equations with meromorphic coefficients. Under certain conditions, we obtain precise estimation of growth order and hyper-order of solutions of the equation.

HIGH PERFORMANCE SPARSE SOLVER FOR UNSYMMETRICAL LINEAR EQUATIONS WITH OUT-OF-CORE STRATEGIES AND ITS APPLICATION ON MESHLESS METHODS

A new direct method for solving unsymmetrical sparse linear systems（USLS） arising from meshless methods was introduced. Computation of certain meshless methods such as meshless local Petrov-Galerkin （MLPG） method need to solve large USLS. The proposed solution method for unsymmetrical case performs factorization processes symmetrically on the upper and lower triangular portion of matrix, which differs from previous work based on general unsymmetrical process, and attains higher performance. It is shown that the solution algorithm for USLS can be simply derived from the existing approaches for the symmetrical case. The new matrix factorization algorithm in our method can be implemented easily by modifying a standard JKI symmetrical matrix factorization code. Multi-blocked out-of-core strategies were also developed to expand the solution scale. The approach convincingly increases the speed of the solution process, which is demonstrated with the numerical tests.

High-efciency improved symmetric successive over-relaxation preconditioned conjugate gradient method for solving large-scale finite element linear equations

Fast solving large-scale linear equations in the finite element analysis is a classical subject in computational mechanics. It is a key technique in computer aided engineering （CAE） and computer aided manufacturing （CAM）. This paper presents a high-efficiency improved symmetric successive over-relaxation （ISSOR） preconditioned conjugate gradient （PCG） method, which maintains lelism consistent with the original form. Ideally, the by 50% as compared with the original algorithm. the convergence and inherent paralcomputation can It is suitable for be reduced nearly high-performance computing with its inherent basic high-efficiency operations. By comparing with the numerical results, it is shown that the proposed method has the best performance.

Equivalent method for accurate solution to linear interval equations

Based on linear interval equations, an accurate interval finite element method for solving structural static problems with uncertain parameters in terms of optimization is discussed. On the premise of ensuring the consistency of solution sets, the original interval equations are equivalently transformed into some deterministic inequations. On this basis, calculating the structural displacement response with interval parameters is predigested to a number of deterministic linear optimization problems. The results are proved to be accurate to the interval governing equations. Finally, a numerical example is given to demonstrate the feasibility and efficiency of the proposed method.

GRADIENT ESTIMATES AND LIOUVILLE THEOREMS FOR LINEAR AND NONLINEAR PARABOLIC EQUATIONS ON RIEMANNIAN MANIFOLDS

In this article, we will derive local elliptic type gradient estimates for positive solutions of linear parabolic equations （△-e/et）u（x,t）＋q（x,t）u^p（x,t）=0 and nonlinear parabolic equations （△-e/et）u（x,t）＋h（x,t）u^p（x,t）=0（p 〉 1） on Riemannian manifolds.As applications, we obtain some theorems of Liouville type for positive ancient solutions of such equations. Our results generalize that of Souplet-Zhang （[1], Bull. London Math. Soc. 38（2006）, 1045-1053） and the author （[2], Nonlinear Anal. 74 （2011）, 5141-5146）.