Crank-Nicolson Quasi-Compact Scheme for the Nonlinear Two-Sided Spatial Fractional Advection-Diffusion Equations

The higher-order numerical scheme of nonlinear advection-diffusion equations is studied in this article, where the space fractional derivatives are evaluated by using weighted and shifted Grünwald difference operators and combining the compact technique, in the time direction is discretized by the Crank-Nicolson method. Through the energy method, the stability and convergence of the numerical scheme in the sense of L2-norm are proved, and the convergence order is . Some examples are given to show that our numerical scheme is effective.

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.

Quantum-Resistant Multi-Feature Attribute-Based Proxy Re-Encryption Scheme for Cloud Services

Cloud-based services have powerful storage functions and can provide accurate computation.However,the question of how to guarantee cloud-based services access control and achieve data sharing security has always been a research highlight.Although the attribute-based proxy re-encryption(ABPRE)schemes based on number theory can solve this problem,it is still difficult to resist quantum attacks and have limited expression capabilities.To address these issues,we present a novel linear secret sharing schemes(LSSS)matrix-based ABPRE scheme with the fine-grained policy on the lattice in the research.Additionally,to detect the activities of illegal proxies,homomorphic signature(HS)technology is introduced to realize the verifiability of re-encryption.Moreover,the non-interactivity,unidirectionality,proxy transparency,multi-use,and anti-quantum attack characteristics of our system are all advantageous.Besides,it can efficiently prevent the loss of processing power brought on by repetitive authorisation and can enable precise and safe data sharing in the cloud.Furthermore,under the standard model,the proposed learning with errors(LWE)-based scheme was proven to be IND-sCPA secure.

Second-Order Accurate Structure-Preserving Scheme for Solute Transport on Polygonal Meshes

We analyze mimetic properties of a conservative finite-volume (FV) scheme on polygonal meshes used for modeling solute transport on a surface with variable elevation. Polygonal meshes not only provide enormous mesh generation flexibility, but also tend to improve stability properties of numerical schemes and reduce bias towards any particular mesh direction. The mathematical model is given by a system of weakly coupled shallow water and linear transport equations. The equations are discretized using different explicit cell-centered FV schemes for flow and transport subsystems with different time steps. The discrete shallow water scheme is well balanced and preserves the positivity of the water depth. We provide a rigorous estimate of a stable time step for the shallow water and transport scheme and prove a bounds-preserving property of the solute concentration. The scheme is second-order accurate over fully wet regions and first-order accurate over partially wet or dry regions. Theoretical results are verified with numerical experiments on rectangular, triangular, and polygonal meshes.

CONVERGENCE OF THE CRANK-NICOLSON/NEWTON SCHEME FOR NONLINEAR PARABOLIC PROBLEM

In this paper, the Crank-Nicolson/Newton scheme for solving numerically second- order nonlinear parabolic problem is proposed. The standard Galerkin finite element method based on P2 conforming elements is used to the spatial discretization of the problem and the Crank-Nieolson/Newton scheme is applied to the time discretization of the resulted finite element equations. Moreover, assuming the appropriate regularity of the exact solution and the finite element solution, we obtain optimal error estimates of the fully discrete Crank- Nicolson/Newton scheme of nonlinear parabolic problem. Finally, numerical experiments are presented to show the efficient performance of the proposed scheme.

A second-order convergent and linearized difference schemefor the initial-boundary value problemof the Korteweg-de Vries equation

To numerically solve the initial-boundary value problem of the Korteweg-de Vries equation,an equivalent coupled system of nonlinear equations is obtained by the method of reduction of order.Then,a difference scheme is constructed for the system.The new variable introduced can be separated from the difference scheme to obtain another difference scheme containing only the original variable.The energy method is applied to the theoretical analysis of the difference scheme.Results show that the difference scheme is uniquely solvable and satisfies the energy conservation law corresponding to the original problem.Moreover,the difference scheme converges when the step ratio satisfies a constraint condition,and the temporal and spatial convergence orders are both two.Numerical examples verify the convergence order and the invariant of the difference scheme.Furthermore,the step ratio constraint is unnecessary for the convergence of the difference scheme.Compared with a known two-level nonlinear difference scheme,the proposed difference scheme has more advantages in numerical calculation.

A Note on Crank-Nicolson Scheme for Burgers’ Equation

In this work we generate the numerical solutions of the Burgers’ equation by applying the Crank-Nicolson method directly to the Burgers’ equation, i.e., we do not use Hopf-Cole transformation to reduce Burgers’ equation into the linear heat equation. Absolute error of the present method is compared to the absolute error of the two existing methods for two test problems. The method is also analyzed for a third test problem, nu-merical solutions as well as exact solutions for different values of viscosity are calculated and we find that the numerical solutions are very close to exact solution.

Alternating segment explicit-implicit scheme for nonlinear third-order KdV equation

A group of asymmetric difference schemes to approach the Korteweg-de Vries （KdV） equation is given here. According to such schemes, the full explicit difference scheme and the full implicit one, an alternating segment explicit-implicit difference scheme for solving the KdV equation is constructed. The scheme is linear unconditionally stable by the analysis of linearization procedure, and is used directly on the parallel computer. The numerical experiments show that the method has high accuracy.

NEW SECRET SHARING SCHEME BASED ON LINEAR CODE

A secret sharing system can be damaged when the dealer cheating occurs.In this paper,two kinds of secret sharing schemes based on linear code are proposed.One is a verifiable scheme which each participant can verify his own share from dealer's distribution and ensure each participant to receive valid share.Another does not have a trusted center,here,each participant plays a dual-role as the dealer and shadow(or share) provider in the whole scheme.

Nonstandard Numerical Schemes for a Linear Stochastic Oscillator with Additive Noise

In order to simulate a linear stochastic oscillator with additive noise,improved nonstandard optimal(INSOPT) schemes are derived utilizing the nonstandard finite difference(NSFD)technique and the improvement technique.These proposed schemes reproduce long time features of the oscillator solution exactly.Their abilities in preserving the symplecticity,the linear growth property of the second moment and the oscillation property of the solution of the stochastic oscillator system on long time interval are studied.It can be shown that the component { x_n}_(n≥1) of the INSOPT schemes switch signs infinitely many times as n →∞,almost surely.Further,the mean-square convergence order of 1 is obtained for these INSOPT schemes.Finally,numerical experiments illustrate intuitively the results obtained in this paper.

Random Crank-Nicolson Scheme for Random Heat Equation in Mean Square Sense

The goal of computational science is to develop models that predict phenomena observed in nature. However, these models are often based on parameters that are uncertain. In recent decades, main numerical methods for solving SPDEs have been used such as, finite difference and finite element schemes [1]-[5]. Also, some practical techniques like the method of lines for boundary value problems have been applied to the linear stochastic partial differential equations, and the outcomes of these approaches have been experimented numerically [7]. In [8]-[10], the author discussed mean square convergent finite difference method for solving some random partial differential equations. Random numerical techniques for both ordinary and partial random differential equations are treated in [4] [10]. As regards applications using explicit analytic solutions or numerical methods, a few results may be found in [5] [6] [11]. This article focuses on solving random heat equation by using Crank-Nicol- son technique under mean square sense and it is organized as follows. In Section 2, the mean square calculus preliminaries that will be required throughout the paper are presented. In Section 3, the Crank-Nicolson scheme for solving the random heat equation is presented. In Section 4, some case studies are showed. Short conclusions are cleared in the end section.

A New Method to Construct Secret Sharing Schemes Based on Linear Codes

Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every linear code can be used to construct secret sharing schemes. So, we use the parity-check matrix of a linear code to construct secret sharing schemes based on linear codes. We also describe some techniques to recover the secret and determine the access structure of the new scheme. In this paper, we use the Massey＇s secret sharing scheme.

UNIFORM DIFFERENCE SCHEME FOR A SINGULARLY PERTURBED LINEAR 2ND ORDER HYPERBOLIC PROBLEM WITH ZEROTH ORDER REDUCED EQUATION

In this paper a singularly perturbed linear second order hyperbolic problem with zeroth order reduced equation is discussed. Firstly, an energy inequality of the solution and an estimate of the remainder term of the asymptotic solution are given. Then an exponentially fitted difference scheme is developed in an equidistant mesh. Finally, uniform convergence in small parameter is proved in the sense of discrete energy norm.

A HIGH ACCURACY DIFFERENCE SCHEME FOR THE SINGULAR PERTURBATION PROBLEM OF THE SECOND-ORDER LINEAR ORDINARY DIFFERENTIAL EQUATION IN CONSERVATION FORM

In this paper, combining the idea of difference method and finite element method, we construct a difference scheme for a self-adjoint problem in conservation form. Its solution uniformly converges to that of the original differential equation problem with order h3.

A symplectic finite element method based on Galerkin discretization for solving linear systems

We propose a novel symplectic finite element method to solve the structural dynamic responses of linear elastic systems.For the dynamic responses of continuous medium structures,the traditional numerical algorithm is the dissipative algorithm and cannot maintain long-term energy conservation.Thus,a symplectic finite element method with energy conservation is constructed in this paper.A linear elastic system can be discretized into multiple elements,and a Hamiltonian system of each element can be constructed.The single element is discretized by the Galerkin method,and then the Hamiltonian system is constructed into the Birkhoffian system.Finally,all the elements are combined to obtain the vibration equation of the continuous system and solved by the symplectic difference scheme.Through the numerical experiments of the vibration response of the Bernoulli-Euler beam and composite plate,it is found that the vibration response solution and energy obtained with the algorithm are superior to those of the Runge-Kutta algorithm.The results show that the symplectic finite element method can keep energy conservation for a long time and has higher stability in solving the dynamic responses of linear elastic systems.

Event-Triggered Finite-Time H∞ Filtering for Discrete-Time Nonlinear Stochastic Systems

This paper addresses the problem of event-triggered finite-time H∞ filter design for a class of discrete-time nonlinear stochastic systems with exogenous disturbances. The stochastic Lyapunov-Krasoviskii functional method is adopted to design a filter such that the filtering error system is stochastic finite-time stable (SFTS) and preserves a prescribed performance level according to the pre-defined event-triggered criteria. Based on stochastic differential equations theory, some sufficient conditions for the existence of H∞ filter are obtained for the suggested system by employing linear matrix inequality technique. Finally, the desired H∞ filter gain matrices can be expressed in an explicit form.

新型ADETCS下工业信息物理系统综合安全控制

针对一类虚假数据注入(FDI)攻击与故障共存的工业信息物理系统(ICPS),在新型自适应离散事件触发通信机制(ADETCS)下,研究了综合安全控制与通信的协同设计问题。引入ADETCS取代传统离散事件触发通信机制,构建安全与通信可自适应协同优化运行的ICPS架构;通过对ADETCS中阈值函数的优化设计,获得一种可随系统动态行为双向连续变化的新型ADETCS;在该机制下,基于主动容侵和容错的思想,通过构造Lyapunov泛函,借助新型Bessel-Legebdre不等式、锥补线性化(CCL)等少保守性技术,在统一的自适应变采样框架下,推证出鲁棒估计器与综合安全控制器的求解方法,使ICPS可同时防御FDI攻击与故障,并具有更优的自适应通信调节能力。仿真结果表明:新型ADETCS中阈值函数的巧妙设计及CCL的应用,相较现存通信机制和设计方法,可使ICPS的综合安全控制性能与资源节约获得更优的折中平衡。

基于有限域上奇异线性空间的(m+1,1)型子空间的结合方案的构造

基于有限域上的奇异线性空间,定义X为所有包含一个固定的(m-1,0)型的子空间的(m+1,1)型子空间组成的集合,根据X中任意两个子空间的和的不同类型,构造了一个X上类数为5的结合方案.此外,给出了该结合方案的所有交叉数.

一维对流扩散方程CRANK-NICOLSON特征差分格式

本文针对一维线性和非线性对流扩散方程提出了一种 Crank- Nicolson类型的特征差分格式 ,给出了该格式形成的线性代数方程组可解的一个充分条件 ,证明了该格式按离散 L 2模是收敛的 ,且其收敛阶为 O(Δt2 + h2 )

Analysis of Extended Fisher-Kolmogorov Equation in 2D Utilizing the Generalized Finite Difference Method with Supplementary Nodes

In this study,we propose an efficient numerical framework to attain the solution of the extended Fisher-Kolmogorov(EFK)problem.The temporal derivative in the EFK equation is approximated by utilizing the Crank-Nicolson scheme.Following temporal discretization,the generalized finite difference method(GFDM)with supplementary nodes is utilized to address the nonlinear boundary value problems at each time node.These supplementary nodes are distributed along the boundary to match the number of boundary nodes.By incorporating supplementary nodes,the resulting nonlinear algebraic equations can effectively satisfy the governing equation and boundary conditions of the EFK equation.To demonstrate the efficacy of our approach,we present three numerical examples showcasing its performance in solving this nonlinear problem.