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.

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.

Linear numerical calculation method for obtaining critical point,pore fluid,and framework parameters of gas-bearing media

Up to now, the primary method for studying critical porosity and porous media are experimental measurements and data analysis. There are few references on how to numerically calculate porosity at the critical point, pore fluid-related parameters, or framework-related parameters. So in this article, we provide a method for calculating these elastic parameters and use this method to analyze gas-bearing samples. We first derive three linear equations for numerical calculations. They are the equation of density p versus porosity Ф, density times the square of compressional wave velocity p Vp^2 versus porosity, and density times the square of shear wave velocity pVs^2 versus porosity. Here porosity is viewed as an independent variable and the other parameters are dependent variables. We elaborate on the calculation steps and provide some notes. Then we use our method to analyze gas-bearing sandstone samples. In the calculations, density and P- and S-velocities are input data and we calculate eleven relative parameters for porous fluid, framework, and critical point. In the end, by comparing our results with experiment measurements, we prove the viability of the method.

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.

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.

Robust entry guidance using multi-segment linear pseudospectral model predictive control

This paper presents a robust entry guidance algorithm for the high lift-to-drag ratio entry vehicle that employs the recently developed pseudospectral model predict control in a segmented manner. Here, the guidance commands are the longitudinal lift-to-drag (L/D) and bank reversal commands, which are calculated by successively solving multiple segment linear algebraic equations. These equations are derived using the linear pseudospectral method, control parametrization and calculus of variations. The method uses orthogonal polynomials and computes the updates through a series of analytical formulae, which makes it accurate and computationally effective. Moreover, it is able to adjust the number of bank reversals by providing the precise bank reversal point so as to fully exploit the potential of lateral maneuver. The method also employs proportional navigation and polynomial guidance after the last bank reversal to meet multiple terminal constraints. High-fidelity numerical simulations with various destinations are carried out to demonstrate its applicability. Furthermore, Monte Carlo simulations are also conducted to show that the proposed algorithm consistently offers very stable and robust performances and has superior performances in computational efficiency, guidance accuracy and lateral trajectory shaping capability in comparison with other typical methods. © 1990-2011 Beijing Institute of Aerospace Information.

Robust H_∞ Control for Uncertain Markovian Jump Linear Time-Delay Systems

This paper studies the robust stochastic stabilization and robust H∞ control for linear time-delay systems with both Markovian jump parameters and unknown norm-bounded parameter uncertainties. This problem can be solved on the basis of stochastic Lyapunov approach and linear matrix inequality (LMI) technique. Sufficient conditions for the existence of stochastic stabilization and robust H∞ state feedback controller are presented in terms of a set of solutions of coupled LMIs. Finally, a numerical example is included to demonstrate the practicability of the proposed methods.

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.

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.

Solitary Wave in Linear ODE with Variable Coefficients

In this paper, the linear ordinary differential equations with variable coefficients are obtained from thecontrolling equations satisfied by wavelet transform or atmospheric internal gravity waves, and these linear equationscan be further transformed into Weber equations. From Weber equations, the homoclinic orbit solutions can be derived,so the solitary wave solutions to linear equations with variable coefficients are obtained.

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.

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.

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.

Cryptanalysis of Cryptosystems Based on General Linear Group

Advances in quantum computers threaten to break public key cryptosystems such as RSA, ECC, and EIGamal on the hardness of factoring or taking a discrete logarithm, while no quantum algorithms are found to solve certain mathematical problems on non-commutative algebraic structures until now. In this background, Majid Khan et al.proposed two novel public-key encryption schemes based on large abelian subgroup of general linear group over a residue ring. In this paper we show that the two schemes are not secure. We present that they are vulnerable to a structural attack and that, it only requires polynomial time complexity to retrieve the message from associated public keys respectively. Then we conduct a detailed analysis on attack methods and show corresponding algorithmic description and efficiency analysis respectively. After that, we propose an improvement assisted to enhance Majid Khan's scheme. In addition, we discuss possible lines of future work.

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.

AN IMPROVED RECURSIVE DOUBLING ALGORITHM FOR THE PARALLEL SOLUTION OF LINEAR RECURRENCE R

An improved recursive doubling algorithm for solving linear recurrence R <n,1>is given,whose parallel time complexity is (τ++τ.) logn when n processors are available,achieving the lower bound in array processor type computation.

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）.

Linear Complementary Method for Moving Boundary Problems with Phase Transformation

In this paper, the linear complementary method for moving boundary problems with phase transformation is presented, in which a pair of unknown vectors of heat source with phase transforming and the temperature field can be solved exactly, and a large amount of iterative calculations can be avoided.