We develop two types of adaptive energy preserving algorithms based on the averaged vector field for the guiding center dynamics,which plays a key role in magnetized *** adaptive scheme is applied to the Gauss Legendr...
详细信息
We develop two types of adaptive energy preserving algorithms based on the averaged vector field for the guiding center dynamics,which plays a key role in magnetized *** adaptive scheme is applied to the Gauss Legendre’s quadrature rules and time stepsize respectively to overcome the energy drift problem in traditional energy-preserving *** new adaptive algorithms are second order,and their algebraic order is carefully *** results show that the global energy errors are bounded to the machine precision over long time using these adaptive algorithms without massive extra computation cost.
In this paper spectral Galerkin approximation of optimal control problem governed by fractional elliptic equation is *** deal with the nonlocality of fractional Laplacian operator the Caffarelli-Silvestre extension is...
详细信息
In this paper spectral Galerkin approximation of optimal control problem governed by fractional elliptic equation is *** deal with the nonlocality of fractional Laplacian operator the Caffarelli-Silvestre extension is *** first order optimality condition of the extended optimal control problem is derived.A spectral Galerkin discrete scheme for the extended problem based on weighted Laguerre polynomials is developed.A priori error estimates for the spectral Galerkin discrete scheme is *** experiments are presented to show the effectiveness of our methods and to verify the theoretical findings.
We present extended Galerkin neural networks (xGNN), a variational framework for approximating general boundary value problems (BVPs) with error control. The main contributions of this work are (1) a rigorous theory g...
详细信息
Boolean Network (BN) and its extension Probabilistic Boolean Network (PBN) are popular mathematical models for studying genetic regulatory networks. BNs and PBNs are also applied to model manufacturing systems, financ...
详细信息
In most electricity theft detection schemes, consumers' power consumption data is directly input into the detection center. Although it is valid in detecting the theft of consumers, the privacy of all consumers is...
详细信息
Image registration is one of the essential elements in computer vision and several practical domains. Its objective is to recover a spatial transformation that aligns images. This is frequently formulated as an optimi...
详细信息
One of the most recent developments in the field of graph theory is the analysis of networks such as Butterfly networks,Benes networks,Interconnection networks,and David-derived networks using graph theoretic *** topo...
详细信息
One of the most recent developments in the field of graph theory is the analysis of networks such as Butterfly networks,Benes networks,Interconnection networks,and David-derived networks using graph theoretic *** topological indices(TIs)have been widely used as graph invariants among various graph theoretic *** structure activity relationships(QSAR)and quantitative structure property relationships(QSPR)need the use of *** structure-based parameters,such as the degree and distance of vertices in graphs,contribute to the determination of the values of *** other recently introduced novelties,the classes of ev-degree and ve-degree dependent TIs have been extensively explored for various graph *** current research focuses on the development of formulae for different ev-degree and ve-degree dependent TIs for s−dimensional Benes network and certain networks derived from *** the end,a comparison between the values of the TIs for these networks has been presented through graphical tools.
A subset I of vertices of an undirected connected graph G is a nonseparating independent set(NSIS)if no two vertices of I are adjacent and GI is *** Z(G)denote the cardinality of a maximum NSIS of G.A nonsep...
详细信息
A subset I of vertices of an undirected connected graph G is a nonseparating independent set(NSIS)if no two vertices of I are adjacent and GI is *** Z(G)denote the cardinality of a maximum NSIS of G.A nonseparating independent set containing Z(G)vertices is called the maximum nonseparating independent *** this paper,we firstly give an upper bound for Z(G)of regular graphs and determine Z(G)for some types of circular ***,we show a relationship between Z(G)and the maximum genus M(G)of a general ***,an important formula is provided to compute Z(G),i.e.,Z(G)=Σx∈I dI(x)+2(M(G-I)-γM(G))+(ξ(G-I)-ξ(G));where I is the maximum nonseparating independent set and ξ(G)is the Betti deficiency(Xuong,1979)of G.
In this paper, we explored different ways to write the algebraic version of betweenness centrality algorithm. Particularly, we focused on Brandes’ algorithm [8]. We aimed for algebraic betweenness centrality that can...
详细信息
In this work, we discuss solutions to the abstract Cauchy problem of fuzzy conformal fractional. In addition, the method of fuzzy fractional semigroups is used to obtain analytical solutions to the fractional differen...
暂无评论