![](https://scdn.x-mol.com/css/images/icon-new-link.png)
样式: 排序: IF: - GO 导出 标记为已读
-
A rapid semi-analytical approach for modeling traffic flow on changing road conditions and its application Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-11 Jie Chen, Jinde Cao, Maobin Hu
Road traffic conditions exhibit spatial and temporal variations influenced by factors such as construction, speed limits, and accidents. Accurate and efficient modeling of vehicular flow on changing road conditions is crucial for understanding intricate traffic phenomena and analyzing dynamic characteristics in real-world scenarios. In this paper, we develop a rapid numerical approach that computes
-
Deep Policy Iteration for high-dimensional mean field games Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-11 Mouhcine Assouli, Badr Missaoui
This paper introduces Deep Policy Iteration (DPI), a novel approach that integrates the strengths of Neural Networks with the stability and convergence advantages of Policy Iteration (PI) to address high-dimensional stochastic Mean Field Games (MFG). DPI overcomes the limitations of PI, which is constrained by the curse of dimensionality to low-dimensional problems, by iteratively training three neural
-
Simultaneous state and fault estimation: A prescribed-time unknown input observer approach Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-11 Jiahui Geng, Ning Xu, Xudong Zhao, Ze Tang, Jiancheng Zhang
In this paper, a prescribed-time unknown input observer (PTUIO) is developed for the simultaneous state and fault estimation. Firstly, for the uncertain system containing both the actuator fault and the sensor fault, a series of reformulations are proposed, which provides a more straightforward way to estimate the state and the faults. Subsequently, based on the reformulations, a PTUIO is developed
-
Hopf bifurcation and patterns formation in a diffusive two prey-one predator system with fear in preys and help Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-10 Debjit Pal, Santu Ghorai, Dipak Kesh, Debasis Mukherjee
Recognizing the relationship between the spatial patterns in species concentrations and ecological heterogeneity is crucial for understanding demographics and species governance in a given domain, as ecological patterning processes are believed to be imitated in real ecosystems. In this present article, we have considered a two-prey-one-predator system with Holling type-II functional response where
-
A Gramian matrix approach to synthesizing finite-frequency H2 controller Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-10 Hongzheng Quan, Xiujuan Lu, Chenxiao Cai, Yun Zou, James Lam
This paper studies the control problem for linear continuous-time systems over a finite-frequency range. Using the finite-frequency Gramian matrix approach, a necessary and sufficient condition is obtained for the characterization of the finite-frequency performance of a Hurwitz stability system. With such a characterization, a sufficient condition for the solvability of the finite-frequency control
-
A novel fractional Moreau's sweeping process with applications Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-10 Zakaria Faiz, Shengda Zeng, Hicham Benaissa
We investigate a novel category of Caputo fractional Moreau's sweeping process, formulated in a real Hilbert space, by the inclusion below Our primary focus is to develop a framework for proving the unique solvability of the fractional Moreau's sweeping processes, namely, we deliver a fractional version of the Moreau's type catching-up algorithm for the sweeping process being considered. Moreover,
-
Risk-sensitive benchmarked portfolio optimization under non-linear market dynamics Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-09 Ravi Shankar, Mayank Goel
We discuss a continuous-time portfolio optimization problem to beat a stochastic benchmark. The model considers non-linear stochastic differential equations (SDEs) to model the dynamics of assets and economic factors. Unlike existing literature on risk-sensitive criteria, the proposed framework allows the model to capture the non-linearity in assets and factors dynamics. This article contributes to
-
An extended prediction for uncertain LTI systems subject to input delays and unknown disturbances Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-09 Jin Zhang, Jing Shi, Chen Peng
This paper develops an extended prediction for uncertain linear time-invariant (LTI) systems with input delays and unknown disturbances. The developed prediction employs more information of the disturbances that allows to reject perfectly constant disturbances and to lead to better attenuation performance with smaller ultimate bounds for the time-varying disturbances. The assumption from the existing
-
A new approach to b-coloring of regular graphs Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-09 Magda Dettlaff, Hanna Furmańczyk, Iztok Peterin, Adriana Roux, Radosław Ziemann
Let be a graph and a proper -coloring of , i.e., for every edge from . A proper -coloring is a b-coloring if there exists a vertex in every color class that contains all the colors in its closed neighborhood. The maximum number of colors admitting b-coloring of is the b-chromatic number .
-
A Nordhaus-Gaddum type problem for the normalized Laplacian spectrum and graph Cheeger constant Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-08 J. Nolan Faught, Mark Kempton, Adam Knudson
For a graph on vertices with normalized Laplacian eigenvalues and graph complement , we prove that We do this by way of lower bounding and where and denote the isoperimetric number and Cheeger constant of , respectively.
-
Bipartite cacti with extremal matching energy Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-08 Jinfeng Liu, Fei Huang
Let be the number of matchings containing edges in a graph . Define a quasi-order ⪰ by if holds for all . Let be the set of all bipartite cacti with cycles and a given bipartition , where , . We determine the extremal graphs minimize the matching energy in for .
-
Power-enhanced residual network for function approximation and physics-informed inverse problems Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-08 A. Noorizadegan, D.L. Young, Y.C. Hon, C.S. Chen
In this study, we investigate how the updating of weights during forward operation and the computation of gradients during backpropagation impact the optimization process, training procedure, and overall performance of the neural network, particularly the multi-layer perceptrons (MLPs). This paper introduces a novel neural network structure called the Power-Enhancing residual network, inspired by highway
-
Fixed-time bipartite synchronization of nonlinear impulsive time-varying signed networks with delays Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-08 Yao Xu, Xinzhi Liu, Lu Zhang, Wenxue Li, Yongbao Wu, Yang Liu
This paper investigates the fixed-time bipartite synchronization issue of nonlinear impulsive time-varying signed networks with time delays. Under the average impulsive interval method, two Lyapunov lemmas are given to ensure the fixed-time stability of nonlinear impulsive time-varying systems. The new settling-time estimations are accurately calculated in terms of the influences of the stabilizing
-
Structure preserving algorithms with adaptive time step for Birkhoffian systems Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-03 Xinlei Kong, Yinjie Song, Huibin Wu
Structure preserving algorithms with adaptive time step are systematically developed for Birkhoffian systems. The development mainly consists of construction, implementation, and application of this kind of algorithms. The construction is based on a direct discretization of the Pfaff–Birkhoff principle in which time is treated as a dynamical variable particularly. The resulting discrete Birkhoffian
-
On spanning laceability of bipartite graphs Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-03 Eminjan Sabir, Jixiang Meng, Hongwei Qiao
Let be a balanced bipartite graph with bipartition . For a positive integer and two vertices and , a bi--path-system of is a subgraph consisting of internally disjoint -paths. Moreover, a bi--path-system is called a spanning bi--path-system if spans . If there is a spanning bi--path-system between any and then is said to be spanning -laceable. In this paper, we provide a synthesis of sufficient conditions
-
Decomposability of regular graphs to 4 locally irregular subgraphs Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-03 Jakub Przybyło
A locally irregular graph is a graph whose adjacent vertices have distinct degrees. It was conjectured that every connected graph is edge decomposable to 3 locally irregular subgraphs, unless it belongs to a certain family of exceptions, including graphs of small maximum degrees, which are not decomposable to any number of such subgraphs. Recently Sedlar and Škrekovski exhibited a counterexample to
-
Orthogonal gamma-based expansion for the CIR's first passage time distribution Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-03 Elvira Di Nardo, Giuseppe D'Onofrio, Tommaso Martini
In this paper we analyze a method for approximating the first-passage time density and the corresponding distribution function for a CIR process. This approximation is obtained by truncating a series expansion involving the generalized Laguerre polynomials and the gamma probability density. The suggested approach involves a number of numerical issues which depend strongly on the coefficient of variation
-
Efficiency analysis for the Perron vector of a reciprocal matrix Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-01 Susana Furtado, Charles R. Johnson
In prioritization schemes, based on pairwise comparisons, such as the Analytical Hierarchy Process, it is necessary to extract a cardinal ranking vector from a reciprocal matrix that is unlikely to be consistent. It is natural to choose such a vector only from efficient ones. One of the most used ranking methods employs the (right) Perron eigenvector of the reciprocal matrix as the vector of weights
-
Orientations without forbidden patterns on three vertices Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-01 Santiago Guzmán-Pro, César Hernández-Cruz
Given a set of oriented graphs, a graph is a -graph if it admits an -free orientation. Skrien showed that proper-circular arc graphs, nested interval graphs and comparability graphs, correspond to -graph classes for some set of orientations of . Building on these results, we exhibit the list of all -graph classes when is a set of oriented graphs on three vertices. Structural characterizations for these
-
Distributed finite-time secure filtering for T-S fuzzy systems under hybrid cyber-attacks: Application to tunnel diode circuits Appl. Math. Comput. (IF 3.5) Pub Date : 2024-07-01 Zehua Ye, Xinran Xu, Dan Zhang, Jun Cheng, Huaicheng Yan
The distributed secure filtering issue of Takagi-Sugeno (T-S) fuzzy systems (TSFSs) under hybrid attacks is investigated in the framework of finite-time boundedness (FTB). The state is estimated via a wireless sensor network (WSN) in a distributed way, where each sensor collects information from the system independently, and transmits it to the remote local estimator through the measurement information
-
Discrete energy balance equation via a symplectic second-order method for two-phase flow in porous media Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-28 Giselle Sosa Jones, Catalin Trenchea
We propose and analyze a second-order partitioned time-stepping method for a two-phase flow problem in porous media. The algorithm is a refactorization of Cauchy's one-leg -method: the implicit backward Euler method on , and a linear extrapolation on . In the backward Euler step, the decoupled equations are solved iteratively, with the iterations converging linearly. In the absence of the chain rule
-
Mosquito suppression via Filippov incompatible insect technique Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-28 Doaa M. Fawzy, Ayman A. Arafa, A. Elsaid, W.K. Zahra
Mosquito-borne diseases persist as a global health challenge despite ongoing control efforts, necessitating the exploration of alternative control approaches. This research proposes a Filippov incompatible insect technique (IIT) model with a threshold policy control for suppressing mosquito population. The model implements biological and chemical control strategies only when wild mosquito density surpasses
-
Deep learning-based estimation of time-dependent parameters in Markov models with application to nonlinear regression and SDEs Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-28 Andrzej Kałuża, Paweł M. Morkisz, Bartłomiej Mulewicz, Paweł Przybyłowicz, Martyna Wia̧cek
We present a novel deep-learning method for estimating time-dependent parameters in Markov processes through discrete sampling. Departing from conventional machine learning, our approach reframes parameter approximation as an optimization problem using the maximum likelihood approach. Experimental validation focuses on parameter estimation in multivariate regression and stochastic differential equations
-
The Gauss-cos model for the autocorrelation function of fertility rate Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-27 Zongmin Wu, Ran Yang
Based on the fertility data, we derive a Gauss-cosh model for autocorrelation functions in the Fourier transform space by adopting the mass-point accumulation principle of the Grassmann space to the amplitude-frequency to study the evolution of population in social problems. By using the Gauss-cosh model in the Fourier transform space, a Gauss-cos model for autocorrelation functions is suggested on
-
A high order accurate space-time trajectory reconstruction technique for quantitative particle trafficking analysis Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-27 Eloina Corradi, Maurizio Tavelli, Marie-Laure Baudet, Walter Boscheri
The study of moving particles (e.g. molecules, virus, vesicles, organelles, or whole cells) is crucial to decipher a plethora of cellular mechanisms within physiological and pathological conditions. Powerful live-imaging approaches enable life scientists to capture particle movements at different scale from cells to single molecules, that are collected in a series of frames. However, although these
-
Fixed-time adaptive neural tracking control for high-order nonlinear switched systems with input saturation and dead-zone Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-26 Huanqing Wang, Zhu Meng
This article investigates the problem of tracking control for high-order switched nonlinear systems with input saturation and dead-zone. The uncertain nonlinear functions are estimated via applying radial basis function neural networks (RBF NNs). An improved transformation approach is designed to simplify the design complexity caused by input nonlinearities. In particular, a novel filter is presented
-
Promoting cooperation through dynamic trustworthiness in spatial public goods games Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-25 Mengshu Zhang, Tianyu Ren, Xiao-Jun Zeng, Jia Li
The established imitation protocol mandates that participants observe and learn strategies from the most successful individuals in their vicinity. Previous studies have highlighted the critical role of this protocol in understanding the mechanisms that drive the evolution of cooperation. Nevertheless, individuals often exhibit a natural reluctance to adopt substantial changes rapidly. In this context
-
Analytical properties and the box-counting dimension of nonlinear hidden variable recurrent fractal interpolation functions constructed by using Rakotch's fixed point theorem Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-24 ChungIl Ro, CholHui Yun
Rakotch contraction is a generalization of Banach contraction, which implies that in the case of using Rakotch's fixed point theorem, we can model more objects than using Banach's fixed point theorem. Moreover, hidden variable recurrent fractal interpolation functions (HVRFIFs) with Hölder function factors are more general than the fractal interpolation functions (FIFs), recurrent FIFs and hidden variable
-
An adaptive energy-based sequential method for training PINNs to solve gradient flow equations Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-21 Jia Guo, Haifeng Wang, Chenping Hou
Recent developments in numerous scientific computing fields have been made possible by physics-informed neural networks (PINNs), a class of machine learning techniques that incorporate physical knowledge into neural networks. However, PINNs still encounter difficulties in simulating a kind of partial differential equations (PDEs), i.e. gradient flow equations of complex dynamic systems. Through analysis
-
Non-fragile projective synchronization of delayed discrete-time neural networks via generalized weighted summation inequality Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-21 K. Sri Raja Priyanka, G. Nagamani
This paper explores the problem of exponential projective synchronization (EPS) for delayed discrete-time uncertain neural networks (NNs) subject to non-fragile state feedback control. To attain less conservative results, some generalized weighted summation inequalities are proposed, which encompass Jensen-based summation inequality (JBSI) as its special case. By constructing suitable Lyapunov-Krasovskii
-
Superconvergent scheme for a system of Green nonlinear Fredholm integral equations Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-21 Rakesh Kumar, B.V. Rathish Kumar
This study investigates a system of second-kind nonlinear Fredholm integral equations (SSNFIEs) featuring a Green's type kernel function. To solve this integral equations (IEs), we introduce Galerkin and iterated Galerkin (IG) methods based on piecewise polynomials. Convergence and error analysis are conducted for these methods, and we demonstrate superconvergence for the IG method. Numerical tests
-
Graphs with large (1,2)-rainbow connection numbers Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-19 Trung Duy Doan, Thi Thanh Chau Do, Ingo Schiermeyer
Let be an edge-colored graph. If every subpath of length at most within a path in a graph consists of uniquely colored edges, then is called an -rainbow path. A connected graph is deemed -rainbow connected if there exists at least one 2-rainbow path connecting two distinct vertices within . The minimum number of colors needed to attain -rainbow connectedness in a connected graph , represented as ,
-
An innovative joint-space dynamic theory for mobile multi-axis system with unilateral constraint Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-17 Hao Xu, Hehua Ju, Meng Yu
The wheel-ground unilateral constraint is essential in establishing the complete mobile multi-axis system dynamics. To reduce the calculation complexity and improve the dynamic performance, an innovative joint-space dynamic theory for mobile multi-axis systems with unilateral constraints is proposed. This present study builds on our existing explicit dynamics studies of tree-chain rigid multi-axis
-
A uniform non-linear subdivision scheme reproducing polynomials at any non-uniform grid Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-15 Sergio López-Ureña
In this paper, we introduce a novel non-linear uniform subdivision scheme for the generation of curves in , . This scheme is distinguished by its capacity to reproduce second-degree polynomial data on non-uniform grids without necessitating prior knowledge of the grid specificities. Our approach exploits the potential of annihilation operators to infer the underlying grid, thereby obviating the need
-
A Gegenbauer polynomial-based numerical technique for a singular integral equation of order four and its application to a crack problem Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-15 Abhishek Yadav, Amit Setia, Concetta Laurita
Strongly singular integral equations of order four have applications in fracture mechanics, and Gegenbauer polynomials have never been used to solve these equations. This motivated us to develop a Gegenbauer polynomial-based Galerkin method to solve a singular integral equation of order four. We first prove the problem's well-posedness. Then, we show the theoretical convergence of the numerical scheme
-
Modelling and analysis of production management system using vacation queueing theoretic approach Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-15 K. Ambika, K.V. Vijayashree, B. Janani
This paper explores a queueing model in a production management context, featuring periods of working vacations and Bernoulli vacation. When there are no pending orders, the manufacturing unit transits into a maintenance phase, also termed as working vacation, during which production continues, albeit at a slower rate. This diminished productivity could result in longer lead times and potential customer
-
Robust H∞ sliding mode control for delay-dependent uncertain T-S fuzzy descriptor stochastic Markovian jump systems with mode-dependent time-varying delays Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-14 Yi Chen, Juan Zhou
In this article, the admissibility analysis and robust sliding mode control (SMC) are studied for uncertain T-S fuzzy singular stochastic Markovian jump systems (SSMJSs) with mode-dependent time-varying delays. The novelty of the article lies in designing a new fuzzy integral sliding manifold function to eliminate the strict assumptions on the system matrices and the limitations caused by the previous
-
Impact of message fatigue in information-disease coupled dynamics on temporal simplicial networks Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-14 Xuemei You, Xiaonan Fan, Yinghong Ma, Zhiyuan Liu, Ruifeng Zhang
During information diffusion, individuals typically experience fatigue and mental exhaustion due to repeated exposure to similar information, which is a state called message fatigue. To address message fatigue in information diffusion and group interactions, we developed a novel coupled information-disease spreading model within the framework of multiplex temporal networks. Here, the information network
-
Evaluation and threshold-based mutual supervision promotes the evolution of cooperation on interdependent networks Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-14 Jinlong Ma, Hongfei Zhao
Inspired by the pivotal role of supervision mechanisms in promoting and maintaining cooperative behavior in human society, we propose a mutual supervision mechanism to explore the evolution of cooperation on an interdependent network. The mechanism adjusts the game type of supervised nodes when their evaluation value falls below a critical threshold. Monte Carlo simulations reveal that the mutual supervision
-
Designing adaptive continuous event-triggered consensus protocol for nonlinear multi-agent systems with a nonautonomous leader Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-14 Xin Wang, DongSheng Yang, Weihua Li, Jia Qin
This article investigates the leader-follower consensus (LFC) issue for a class of Lipschitz-type nonlinear multi-agent systems (NMASs) that include one leader and multiple followers. To enable the leader to denote a flexible noncooperative reference trajectory, it is considered that the leader's control input (LCI) exists and cannot be obtained by other followers. A novel robust distributed adaptive
-
The number of connected sets in Apollonian networks Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-13 Zuwen Luo, Kexiang Xu
A vertex subset in a graph that induces a connected subgraph is referred to as a connected set. Counting the number of connected sets in a graph is generally a #P-complete problem. In our recent work [Graphs Combin. (2024)], a linear recursive algorithm was designed to count in any Apollonian network. In this paper we extend our research by establishing a tight upper bound on in Apollonian networks
-
Enumeration of spanning trees containing a perfect matching in linear polygonal chains Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-12 Jingchao Lai, Rongkun Zhu
The enumerative problem of spanning trees of graphs is one of the fundamental problems in the field of graph theory, which has attracted the attention of mathematicians and physicists. For a connected graph , let be a spanning tree of . In this paper, we call to be a - of if contains a perfect matching. Recently, Li and Yan (Applied Mathematics and Computation, 456 (2023), 128125.) gave an explicit
-
Improved uniform error bounds of a Lawson-type exponential wave integrator method for the Klein-Gordon-Dirac equation Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-12 Jiyong Li, Xianfen Wang, Qianyu Chen, Shuo Deng
For the Klein-Gordon-Dirac equation (KGDE) with small coupling constant , we propose a Lawson-type exponential wave integrator Fourier pseudo-spectral (LEWIFP) method and establish the improved uniform error bounds in the time domain at . We first convert the KGDE to a coupled system and then consider LEWIFP method for the coupled system. The LEWIFP method is proved to be time symmetric which is an
-
A novel finite-time stability criteria and controller design for nonlinear impulsive systems Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-08 Mengqing Cheng, Junsheng Zhao, Xiangpeng Xie, Zong-yao Sun
The issue of a novel finite-time stability and stabilization design for a class of nonlinear impulsive systems is discussed in this paper. In previous finite-time control designs for impulsive systems, the convergence rate of these control strategies is even less rapid than the exponential convergence rate when the initial state is distant from the origin. To overcome this problem, two sufficient conditions
-
Dynamic output feedback based fault tolerant control for continuous-time switched affine systems via reduced-order observer Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-08 Fang Liao, Yanzheng Zhu, Xiao He, Donghua Zhou
In this study, the issue on dynamic output feedback fault-tolerant controller design is addressed for a class of continuous-time switched affine systems in the presence of actuator faults. The existence of affine terms gives rise to the lack of a common equilibrium point and further makes it more difficult to propose the desired output-feedback-based fault-tolerant control scheme. Firstly, the actuator
-
Complete synchronization of delayed discrete-time fractional-order competitive neural networks Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-08 Wei-Wei Chen, Hong-Li Li
In this paper, we explore complete synchronization for the delayed discrete-time fractional-order competitive neural networks (DDFCNNs). Firstly, several definitions with respect to Caputo fractional-order difference are given. Next, a novel method for proving Caputo fractional difference inequality of -norm function is given, then by making use of the inequality we prove and Hanalay inequality, some
-
Matrix norm methods for zero-sum fuzzy matrix games with payoffs of triangular fuzzy numbers Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-07 Burhaneddin İzgi, Hale Gonce Kocken, Murat Özkaya
In this paper, we mainly consider the solution of two-person zero-sum fuzzy matrix games with payoffs of triangular fuzzy numbers. Contrary to the literature, we focus on developing the methods to solve the game directly based on only the norms of the payoff matrix holistically, without solving a linear programming problem or handling sub-games created by taking the components of fuzzy numbers separately
-
Withdrawn: Transient modeling of natural gas in pipeline networks by two non-iterative explicit and implicit finite volume methods Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-07 Seyed Mohammad Ahmadi, Morteza Behbahani-Nejad, Younes Shekari
The Publisher regrets that this article is an accidental duplication of an article that has already been published in < Applied Mathematics and Computation, 478 (2024) 128793>, . The duplicate article has therefore been withdrawn.
-
Generalized polynomial chaos expansions for the random fractional Bateman equations Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-04 Marc Jornet
Bateman equations model mass balance in a linear radioactive decay chain of isotopes. A generalization of this model may be based on the introduction of a fractional derivative, to include memory effects, and on the incorporation of randomness in the input parameters (decay rate and initial concentrations), since it is not possible to predict when a particular nuclide will decay from a quantum-mechanical
-
Multiplicative hyperbolic split quaternions and generating geometric hyperbolical rotation matrices Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-04 Zehra Özdemir, Hazal Ceyhan
With the help of split quaternions, rotational motion in Lorentz space can be studied. This rotation corresponds to the rotations on the hyperboloids. The aim of this study is to define and examine hyperbolic rotations in the new geometry space. We describe new quaternions that are called multiplicative hyperbolic split quaternions, in this study. We also defined the geometric hyperbolic scalar product
-
On r-hued coloring of connected P5-free tripartite graphs Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-04 Yaxin Shi, Fengxia Liu, HongJian Lai
A -coloring of a graph is a proper -vertex coloring such that any vertex is adjacent to vertices with at least min. The minimum integer such that has a -coloring is called the -hued chromatic number of and denoted by . A graph does not have an induced subgraph isomorphic to is a -free graph. It is not known whether it is valid that among all -free graphs. In [Discrete Math. 342(2019)1904-1911], an
-
Error analysis of a fully discrete PFEM for the 2D/3D unsteady incompressible MHD equations Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-04 Kaiwen Shi, Haiyan Su, Xinlong Feng
The aim of this article is to present a penalty finite element method (PFEM) in fully discrete form for the unsteady incompressible magnetohydrodynamic (MHD) equations. The proposed method is applied to address the incompressible constraint “div=0”. The backward Euler scheme is used for temporal discretization, and the finite element pair is used for spatial discretization, which satisfies the discrete
-
Exponential synchronization of complex networks with unmeasured coupling delays via impulsive observer and impulsive control Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-04 Yao Chu, Xiaodi Li, Xiuping Han
In this article, exponential synchronization problem of complex networks with coupling delays using an impulsive observer and impulsive control is studied. Different from traditional network synchronization schemes, the state of the observer is fed back to the network nodes to achieve synchronization. The observer and controller, modeled by impulsive differential equations, are more secure and efficient
-
Transient modeling of natural gas in pipeline networks by two non-iterative explicit and implicit finite volume methods Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-04 Seyed Mohammad Ahmadi, Morteza Behbahani-Nejad, Younes Shekari
This paper describes two non-iterative explicit and implicit finite volume methods (FVM) to calculate the unsteady characteristics of natural gas in distribution systems. The proposed finite volume model could be used to solve the gas network as a whole for each time step. The main advantage of this approach is that it can analyze gas distribution networks with less computational cost. In addition
-
Reinforcement learning-based secure synchronization for two-time-scale complex dynamical networks with malicious attacks Appl. Math. Comput. (IF 3.5) Pub Date : 2024-06-03 He Huang, Jiawei Xu, Jing Wang, Xiangyong Chen
This paper studies the secure synchronization problem for two-time-scale complex dynamical networks with unknown dynamics information and malicious attacks. The challenge is that under complex dynamic networks with unknown dynamic information, all system matrices are unknown. To ameliorate this conundrum, we design a reinforcement learning algorithm, conjoined with a full-order processing of singularly
-
Energy management for object tracking under the energy-harvesting: Hierarchical reinforcement learning method Appl. Math. Comput. (IF 3.5) Pub Date : 2024-05-31 Jiajia Li, Xin Tian, Guoliang Wei
This paper explores the target localization problem with signal transmitters which are powered by energy harvesting (EH) devices. Due to the remote transmission and random energy harvesting, the energy supplied to transmitters to transmit information is often insufficient, resulting in packet dropout. The rate of packet dropouts is influenced mainly by the distance from the target to the transmitter
-
Numerical calculation of the extension of k-beta function and some new extensions by using two parameter k-Mittag-Leffler function Appl. Math. Comput. (IF 3.5) Pub Date : 2024-05-31 Parik Laxmi, Shilpi Jain, Praveen Agarwal, Gradimir V. Milovanović
A numerical method for efficient calculation of recently defined extension of -beta functions, based on weighted quadrature formulas of Gaussian type, is proposed. The modified moments of an even exponential weight function on , with essential singularities at ±1, are calculated in symbolic form in terms of the Meijer -function. A similar problem with respect the two-parameter Mittag-Leffler function
-
Suppressing defection by increasing temptation: The impact of smart cooperators on a social dilemma situation Appl. Math. Comput. (IF 3.5) Pub Date : 2024-05-30 Hsuan-Wei Lee, Colin Cleveland, Attila Szolnoki
In a social dilemma situation, where individual and collective interests are in conflict, it sounds a reasonable assumption that the presence of super or smart players, who simultaneously punish defection and reward cooperation without allowing exploitation, could solve the basic problem. The behavior of such a multi-strategy system, however, is more subtle than it is firstly anticipated. When exploring
-
Explicit numerical approximations for SDDEs in finite and infinite horizons using the adaptive EM method: Strong convergence and almost sure exponential stability Appl. Math. Comput. (IF 3.5) Pub Date : 2024-05-27 Ulises Botija-Munoz, Chenggui Yuan
In this paper we investigate explicit numerical approximations for stochastic differential delay equations (SDDEs) under a local Lipschitz condition by employing the adaptive Euler-Maruyama (EM) method. Working in both finite and infinite horizons, we achieve strong convergence results of the adaptive EM solution. We also obtain the order of convergence in finite horizon. In addition, we show almost
-
An improved oscillation theorem for nonlinear delay differential equations Appl. Math. Comput. (IF 3.5) Pub Date : 2024-05-27 Nurten Kılıç, Özkan Öcalan, Mustafa Kemal Yıldız
In this article, we establish a new oscillation criterion for all solutions of first order nonlinear delay differential equations. The main result improves well-known oscillation conditions in the literature. Besides, an example is presented to prove the importance of the main theorem.