
样式: 排序: IF: - GO 导出 标记为已读
-
LP-based mode-dependent piece-wise event-triggered finite-time L1 control for switched positive systems under MDMDT constraint Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-31 Shuo Li, Yiyun Zhang, Yongqi Jia, Zhengrong Xiang, Jinling Wang
This paper addresses the design of a finite-time (FT) L1 control utilizing an event-triggered (ET) mechanism for a category of switched positive systems (SPSs) while taking into account the constraint of mode-dependent minimum dwell time (MDMDT). First, a novel ET approach utilizing 1-norm criteria is introduced to formulate the FT control design, and a positivity condition is established. Then, a
-
Environmental feedback promotes cooperation in a spatial prisoner's dilemma game with preferential selection Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-31 Minlan Li, Chao Wang, Yanyan Han, Si-Yi Wang, Ruiwu Wang
The reciprocal influence between the environment and the cooperation level is a ubiquitous reality. Changes in cooperation levels impact environmental quality, while environmental conditions, in turn, affect individual fitness and behavior. Drawing inspiration from this inherent interplay, we investigate the role of environmental feedback on the spatial prisoner's dilemma game. We establish two discrete
-
Mitigating infection in prey through cooperative behavior under fear-induced defense Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-31 K.M. Ariful Kabir
This study investigates an eco-epidemiological model that incorporates disease dynamics in prey populations while considering the impact of predator-induced fear on prey species. A pairwise evolutionary game theory model, which incorporates prey species behavior to mitigate infection, is also examined. Prey individuals can employ two behavioral tactics, cooperation, and defection, to reduce infection
-
Adaptive FTPP control of switched stochastic nonlinearly parameterized systems with asymptotic tracking performance Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-31 Yanli Liu, Yihua Sun, Li-Ying Hao
The article discusses the asymptotic tracking control for switched stochastic systems with nonlinear parameterization. Firstly, to achieve the finite-time control, a finite-time prescribed performance function (FTPPF) is introduced into the regular control frame which refrains from the fractional-order controller design. Secondly, an error transformation is employed which renders the transition from
-
Quaternion modified conjugate gradient algorithm to solve Sylvester-type quaternion matrix equations with generalized coupled form as well as application Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-30 Yifen Ke, Xiaomin Cai, Riwei Liao, Huai Zhang
Sylvester-type matrix equations have a wide range of applications in various fields, including stability analysis, control theory, system theory, image and signal processing, and optimization problems. In this study, we aim to address the necessity of employing mathematical approaches to solve a category of Sylvester-type quaternion matrix equations with generalized coupled form. Firstly, we establish
-
Corrigendum to “Neural networks for bifurcation and linear stability analysis of steady states in partial differential equations” [Appl. Math. Comput. 483 (2024) 128985] Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-30 Muhammad Luthfi Shahab, Hadi Susanto
-
Eigenvalue bounds and Perron-Frobenius theory for nonnegative or positive interval matrices Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-29 Sarishti Singh, Geetanjali Panda
This paper introduces two classes of regular interval matrices and establishes intervals that either include or exclude the real eigenvalues of positive interval matrices. The Perron-Frobenius theory is extended to the generalized interval eigenvalue problem for nonnegative interval matrices under certain conditions. Moreover, necessary and sufficient conditions are derived for the existence of a real
-
The restrained double Roman domination and graph operations Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-27 Zhipeng Gao, Changqing Xi, Jun Yue
A restrained double Roman dominating function (RDRD-function) on a graph G is a function f:V(G)→{0,1,2,3} that satisfies two conditions: (1) If f(v)<2, then ∑u∈NG[v]f(u)≥|ANGf(v)|+2, where ANGf(v)={u∈NG(v):f(u)≥1}; (2) The subgraph induced by the vertices assigned 0 under f contains no isolated vertices. The weight of an RDRD-function f is ∑v∈V(G)f(v), and the minimum weight of an RDRD-function on
-
OP-HHO based feature selection improves the performance of depression classification framework: A gender biased multiband research Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-24 Kun Li, PeiYun Zhong, Li Dong, LingMin Wang, Luo-Luo Jiang
Depression, as a common yet severe mood disorder, can cause irreversible damage to the brain if not detected and treated in a timely manner. Unfortunately, due to the current limitations of medical and technological conditions, only a small number of patients have been able to receive appropriate treatment. Although the traditional Harris Hawk's Optimization (HHO) algorithm has a strong searching ability
-
Graphs having two main eigenvalues and arbitrarily many distinct vertex degrees Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-24 Mohammad Ghebleh, Salem Al-Yakoob, Ali Kanso, Dragan Stevanović
Arif, Hayat and Khan [J Appl Math Comput 69 (2023) 2549–2571] recently proposed the problem of finding explicit construction for (an infinite family of) graphs having at least three distinct vertex degrees and two main eigenvalues. After computationally identifying small examples of such graphs, we fully solve this problem by showing that the edge-disjoint union of an almost semiregular graph G and
-
Data-driven-based fully distributed event-triggered control for nonlinear multi-agent systems Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-24 Xiaojie Qiu, Wenchao Meng, Yingchun Wang, Qinmin Yang
This paper investigates the fully distributed control issue for nonlinear multi-agent systems (MASs) under the limited network bandwidth. A novel event-triggered MFAC framework is developed to ensure the consensus of system output signals in a fully distributed manner, in which an adaptive step-size operator is introduced to eliminate the reliance on communication topology information. To save communication
-
A note on block-transitive 2 − (v,k,1) designs Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-23 Shangzhao Li, Xiran Zhang, Jing Chen, Shaojun Dai
Let G act block-transitively on a 2−(v,12,1) design. If G is solvable, then (1) if 3|v, then v=3n, G≤AΓL(1,3n), where pn≡1(mod44); (2) if 3∤v, then v=pn, G≤AΓL(1,pn), where p≠2 and pn≡1(mod132).
-
A modulus-based framework for weighted horizontal linear complementarity problems Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-23 Francesco Mezzadri
We develop a modulus-based framework to solve weighted horizontal linear complementarity problems (WHLCPs). First, we reformulate the WHLCP as a modulus-based system whose solution, in general, is not unique. We characterize the solutions by discussing their sign pattern and how they are linked to one another. After this analysis, we exploit the modulus-based formulation to develop new solution methods
-
A note on sequences variant of irregularity strength for hypercubes Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-23 Anna Flaszczyńska, Aleksandra Gorzkowska, Mariusz Woźniak
Let f:E→{1,2,…,k} be an edge-coloring of the n-dimension hypercube Hn. By the palette at a vertex v we mean the sequence (f(e1(v)),f(e1(v)),…,f(en(v))), where ei(v) is the edge incident to v that connects vertices differing in the ith element. In this paper, we show that two colors are enough to distinguish all vertices of the n-dimensional hypercube Hn (n≥2) by their palettes. We also show that if
-
Distinguishing infinite star-free graphs Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-23 Marcin Stawiski
Call a vertex or an edge colouring of a graph distinguishing, if is not preserved by any non-identity automorphism. For a graph H, we say that a graph G is H-free if there is no induced subgraph of G, which is isomorphic to H. Gorzkowska, Kargul, Musiał and Pal proved that for every natural number n greater than 2 each finite connected K1,n-free graph on at least six vertices has a distinguishing edge
-
Effects of an update mechanism based on combinatorial memory and high-reputation learning objects on the evolution of cooperation Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-23 Qianxi Yang, Yanlong Yang
In human society, various factors influence decision-making, including memory, reputation, aspiration, etc. In recent years, research has increasingly focused on considering these factors and designing mechanisms to promote cooperation. However, few previous studies have simultaneously considered the effects of memory and reputation on cooperative evolution. Additionally, research on cooperation evolution
-
An asymptotic preserving and energy stable scheme for the Euler system with congestion constraint Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-23 K.R. Arun, A. Krishnamurthy, H. Maharna
In this work, we design and analyze an asymptotic preserving (AP), semi-implicit finite volume scheme for the scaled compressible isentropic Euler system with a singular pressure law known as the congestion pressure law. The congestion pressure law imposes a maximal density constraint of the form 0≤ϱ<1, and the scaling introduces a small parameter ε in order to control the stiffness of the density
-
Effective data reduction algorithm for topological data analysis Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-23 Seonmi Choi, Jinseok Oh, Jeong Rye Park, Seung Yeop Yang, Hongdae Yun
One of the most interesting tools that have recently entered the data science toolbox is topological data analysis (TDA). With the explosion of available data sizes and dimensions, identifying and extracting the underlying structure of a given dataset is a fundamental challenge in data science, and TDA provides a methodology for analyzing the shape of a dataset using tools and prospects from algebraic
-
Computational aspects of hyperbolic curvature flow Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-23 Monika Suchomelová, Michal Beneš, Miroslav Kolář
The article analyzes behavior of the solution of the hyperbolic curvature flow by means of a class of analytical solutions and by computational studies performed by a semi-discrete finite-volume scheme. A class of analytical solutions is derived and used for the verification of the computational algorithm by numerical convergence to it. An original tangential redistribution is proposed to stabilize
-
Observer-based non-fragile control for T-S fuzzy switched systems against cyber attacks: A double-layer PDT switching method Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-22 Pengcheng Zhang, Yajuan Liu, Shiyu Jiao, Chen Yang
This paper mainly investigates the observer-based non-fragile control issue for a class of T-S fuzzy switched systems under cyber attacks. Firstly, the system under consideration comprises a finite number of subsystems governed by the switching logic subject to the persistent dwell-time constraints, with each local subsystem represented by a T-S fuzzy model. Secondly, the switching logic with persistent
-
Null controllability of an ODE-heat system with coupled boundary and internal terms Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-22 Idriss Boutaayamou, Fouad Et-tahri, Lahcen Maniar
This paper is devoted to the theoretical and numerical analysis of the null controllability of a coupled ODE-heat system internally and at the boundary with Neumann boundary control. First, we establish the null controllability of the ODE-heat with distributed control using Carleman estimates. Then, we conclude by the strategy of space domain extension. Finally, we illustrate the analysis with some
-
Decoupled bound-preserving algorithms for compressible Darcy-Brinkman flow with advection-diffusion transport problem in fractured media Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-21 Wei Liu, Kai Li
A coupling of compressible Darcy-Brinkman flow and advection-diffusion transport problem is considered in fractured media. Treating the fracture as hyperplane, we obtain a two-layer reduced coupled model and the whole considered media is divided into low dimensional fracture-interfaces and surrounding high dimensional subdomains. To improve efficiency, two decoupled algorithms are constructed to solve
-
1-Planar graphs with no 5-cycles are 5-degenerate Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-20 Qingqin Wu, Weifan Wang, Jiangxu Kong
A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. A graph is k-degenerate if each of its subgraphs contains a vertex of degree no greater than k. It was known that 1-planar graphs are 7-degenerate. In this paper, we show that every 1-planar graph without 5-cycles is 5-degenerate, which extends some known results on the 5-degeneracy of some 1-planar
-
k-path-edge-connectivity of the complete balanced bipartite graph Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-20 Yaoping Wang, Shasha Li, Zeng Zhao
Given a graph G=(V,E) and a set S⊆V(G) with |S|≥2, an S-path in G is a path that connects all vertices of S. Let ωG(S) represent the maximum number of edge-disjoint S-paths in G. The k-path-edge-connectivityωk(G) of G is then defined as min{ωG(S):S⊆V(G)and|S|=k}, where 2≤k≤|V|. Therefore, ω2(G) is precisely the edge-connectivity λ(G). In this paper, we focus on the k-path-edge-connectivity of the complete
-
Interval-oriented reduced-order model for uncertain control systems Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-17 Ziyao Fan, Chen Yang
The reduced-order model (ROM), as a crucial research avenue in control system design, effectively simplifies complexity and enhances computational efficiency when handling high-dimensional models. However, considering the presence of uncertainties caused by the incompleteness of the system model and the errors induced by sensors, conventional probabilistic methods rely on a substantial number of samples
-
A Fan-type condition for cycles in 1-tough and k-connected (P2 ∪ kP1)-free graphs Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-17 Zhiquan Hu, Jie Wang, Changlong Shen
For a graph G, define μk(G):=min{maxx∈SdG(x):S∈Sk}, where Sk is the set consisting of all independent sets {u1,…,uk} of G such that some vertex, say ui (1≤i≤k), is at distance two from every other vertex in it. A graph G is called 1-tough if for each cut set S⊆V(G), G−S has no more than |S| components. Recently, Shi and Shan [19] conjectured that for each integer k≥4, being 2k-connected is sufficient
-
The outerplanar Turán number of disjoint copies of paths Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-16 Jin Li, Yongxin Lan, Changqing Xu
A graph without a copy of T as a subgraph is called T-free. The outerplanar Turán number exOP(n,T) of T represents the maximum number of edges among all n-vertex T-free outerplanar graphs. In this paper, we investigate exOP(n,rPs) and determine its exact value for r,s≥2 and n≥rs. This extends a result of Fang and Zhai (2023) [7].
-
Graphs whose the maximum size of an odd subgraph equal to [formula omitted] Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-15 Si-Ao Xu, Baoyindureng Wu
A graph is said to be odd if the degrees of all vertices are odd. A subgraph F of X is called an odd factor of X if F is odd and V(F)=V(X). Let fo′(X)=max{|S|:S⊆E(X),X[S] is odd} and fo″(X)=max{|S|:S⊆E(X),X[S] is an odd factor of X}. In 2001, Scott established that every connected graph X of even order admits a vertex partition A1,…,As such that the induced graph X[Ai] is odd for i∈{1,…,s}. It implies
-
Comparative analysis of nonlinear Urysohn functional integral equations via Nyström method Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-15 Imtiyaz Ahmad Bhat, Lakshmi Narayan Mishra, Vishnu Narayan Mishra
In this sequel, the investigation of a diverse range of Urysohn type nonlinear functional integral equations falling under the Fredholm type is examined. This equation encompasses various integral and functional equations as specific instances. By imposing smoothness conditions on the involved functions, both the solution's existence and its uniqueness using the fixed point method are established.
-
A Carleman-Picard approach for reconstructing zero-order coefficients in parabolic equations with limited data Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-15 Ray Abney, Thuy T. Le, Loc H. Nguyen, Cam Peters
We propose a globally convergent computational technique for the nonlinear inverse problem of reconstructing the zero-order coefficient in a parabolic equation using partial boundary data. This technique is called the “reduced dimensional method.” Initially, we use the polynomial-exponential basis to approximate the inverse problem as a system of 1D nonlinear equations. We then employ a Picard iteration
-
A new mathematical model and solution method for the asymmetric traveling salesman problem with replenishment arcs Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-15 K. Gulnaz Bulbul, Refail Kasimbeyli
This paper presents a new mathematical model for the Asymmetric Traveling Salesman Problem with Replenishment Arcs, an extension of the Asymmetric Traveling Salesman Problem, incorporating constraints on subpaths within the tour. Many existing modeling approaches to this problem require the generation of replenishment feasible or replenishment violation paths as a parameter set, which may lead to computational
-
Integrated mobile facility production and distribution scheduling planning; A synchronized solution framework Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-15 Reza Ramezanian, Mohammad Hosein Mahdavi, Shahrooz Shahparvari
This research explores supply chain modeling for mobile production facilities, emphasizing distribution and manufacturing processes. The focus is on a fleet of production-equipped trucks that manufacture orders during transit to customer locations. A mixed-integer linear programming (MILP) model is proposed to address the production and delivery planning problem, minimizing total costs, including production
-
Calculating the C-eigenvalues of the three-dimensional piezoelectric tensors directly Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-15 Huage Wang
In this paper, we derive explicit expressions to directly determine the C-eigenvalues and corresponding C-eigenvectors of the three-dimensional piezoelectric tensors through categorical discussions. We further validate the efficacy of this approach by solving the eigenvalues of three classic three-dimensional piezoelectric tensors using this method.
-
New stabilized mixed finite element methods for two-field poroelasticity with low permeability Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-13 Linshuang He, Luru Jing, Minfu Feng
In this paper, we develop new stabilized mixed finite element (MFE) methods for two-field Biot's model of poroelasticity. We employ the H(div)-conforming element and discontinuous element to approximate the displacement and pressure variables, and use the θ-scheme to discretize time. By adding the stabilization term based on polynomial pressure projection, the fully-discrete and stabilized MFE methods
-
Convergence analysis of an efficient multistep pseudo-spectral continuous Galerkin approach for solving Volterra integro-differential equations Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-13 Yin Yang, Pai Yao, Emran Tohidi
In this research article, we apply the multistep pseudo-spectral continuous Galerkin approach for solving the first-order Volterra integro-differential equations by the aid of the orthogonal Legendre polynomials. This approach is a recursive scheme that the accuracy of the numerical solution at the present subinterval depends on the numerical solutions at the previous subintervals. Convergence analysis
-
Stochastic stability of networked control systems with packet disordering via a gain-scheduling controller Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-13 Huihui Ji, Shengyuan Xu, He Zhang, Chenlong Li, Yuhua Xu
It is addressed the problem of almost sure stability for networked control systems (NCSs), where the order of the control signal is possible to be disordering over a communication network. A stochastic configuration network algorithm is employed to record and predict the packet order, which is random to allot input biases or weights and evaluates the output wights. Under the algorithm, a stochastic
-
Data-driven bipartite synchronization control of multi-agent systems with asymmetric input saturation over switching networks Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-13 Ziwen Shen, Tao Dong, Tingwen Huang
This paper addresses the bipartite synchronization (BS) issue of nonlinear discrete-time multi-agent systems (NDTMASs) with asymmetric input saturation in switching cooperative-competitive networks. First, a local neighborhood error system (LNES) is constructed based on the switching cooperative-competitive networks. By utilizing a hyperbolic function, we design a novel local cost function and derive
-
A composite filter-based approach to adaptive prescribed-time output-feedback control of strict-feedback nonlinear systems with output and input quantization Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-13 Chen Chen, Jinghao Li
This paper investigates the adaptive prescribed-time control problems of strict-feedback nonlinear systems with output quantization, input quantization and unknown control coefficients. Firstly, a quantized K-filter is constructed to estimate the system states. Then, a set of command filters are introduced to smooth the discontinuous stabilizing functions and reduce the computational burden. Moreover
-
Natural extension of a Lie algebra [formula omitted], realizations, invariant systems and integrability Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-13 Muhammad Ayub, Saira Bano
In the frame of Lie theory, the classical successive reduction of order for scalar ODEs is not much effective for system of differential equations due to technical hurdles. Lie algebraic approach is utilized to overcome these hurdles, then further invoked for the classification, linearization and integrability of system of differential equations. But in the case of higher dimension, this approach has
-
Controllability of piecewise linear state-delay systems Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-10 Huiping Luo, JinRong Wang
In this paper, we study the controllability of piecewise linear state-delay systems (PLSDSs). To do this, we introduce a series of new functions and give the explicit representation of the solution. Then, the Gramian and the rank criteria for the controllability of PLSDSs are established by the piecewise delayed Gramian matrix. Further, all control functions driving the solution from an initial function
-
Leveraging surrounding past strategies to maintain cooperation in the perverse prisoner's dilemma Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-10 Akihiro Takahara, Tomoko Sakiyama
In spatial game theory, developed models preserving cooperators often incorporate memory to enhance realism. This study examined the role of memory in a spatial prisoner's dilemma. In the proposed model, all players use their own and their neighbors’ past memories and current states to update strategies under specific conditions. When a player's score is lower than that of a neighbor using the same
-
A learning-based sliding mode control for switching systems with dead zone Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-09 Bo Wang, Fucheng Zou, Junhui Wu, Jun Cheng
This paper focuses on the problem of adaptive neural network sliding mode control for switching systems affected by dead zones. Distinct from existing rules defined by transition and sojourn probabilities, a broader switching rule is proposed based on duration-time-dependent sojourn probabilities. A neural network strategy for compensation is implemented to mitigate the effects of the dead zone. Moreover
-
An algebraic algorithm for the total least squares problem in commutative quaternionic theory Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-09 Tongsong Jiang, Dong Zhang, Zhenwei Guo, V.I. Vasil'ev
A commutative quaternion total least squares (CQTLS) problem is a method of solving overdetermined sets of linear equations AX≈B with errors in the matrices A and B. In the theoretical studies and numerical calculations of commutative quaternionic theory, the CQTLS problem is an extremely effective tool for the study of telecommunications, geodesy, and image processing theory. This paper, by means
-
Branch points of homotopies: Distribution and probability of failure Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-08 Jonathan D. Hauenstein, Caroline Hills, Andrew J. Sommese, Charles W. Wampler
Homotopy continuation is a standard method used in numerical algebraic geometry for solving multivariate systems of polynomial equations. Techniques such as the so-called gamma trick yield trackable homotopies with probability one. However, since numerical algebraic geometry employs numerical path tracking methods, being close to a branch point may cause concern with finite precision computations.
-
One-to-one disjoint path covers in digraphs with faulty edges Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-07 Ruixiao Jing, Yuefang Sun
Let D be a digraph of order n≥l+1, where l is a positive integer. Let S={s} and T={t}. A set of l paths {P1,P2,…,Pl} of D is a one-to-one l-disjoint directed path cover (one-to-one l-DDPC for short) for S and T, if ⋃i=1lV(Pi)=V(D), each Pi is an s−t path and V(Pi)∩V(Pj)={s,t} for i≠j. If there is a one-to-one l-DDPC in D for any disjoint source set S={s} and sink set T={t}, then D is one-to-one l-coverable
-
Time-dependent strategy for improving aortic blood flow simulations with boundary control and data assimilation Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-07 Muhammad Adnan Anwar, Jorge Tiago
Understanding time-dependent blood flow dynamics in arteries is crucial for diagnosing and treating cardiovascular diseases. However, accurately predicting time-varying flow patterns requires integrating observational data with computational models in a dynamic environment. This study investigates the application of data assimilation and boundary optimization techniques to improve the accuracy of time-dependent
-
On the eccentricity inertia indices of chain graphs Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-06 Jing Huang, Minjie Zhang
For a given graph G, the eccentricity matrix of it, written as ε(G), is created by retaining the largest non-zero entries for each row and column of the distance matrix, while filling the rest with zeros, i.e.,ε(G)uv={d(u,v),ifd(u,v)=min{ε(u),ε(v)},0,otherwise, where ε(u) denotes the eccentricity of a vertex u. The eccentricity inertia index of a graph G is represented by a triple (n+(ε(G)), n0(ε(G))
-
On discrete stochastic p-Laplacian complex-valued Ginzburg-Landau equations driven by superlinear Lévy noise Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-06 Sangui Zeng, Xiulan Yang, Jianren Long
Our work is focused on discrete stochastic p-Laplacian complex-valued Ginzburg-Landau equations influenced by superlinear Lévy noise, under the assumption that the drift and diffusion terms satisfy local Lipschitz continuity. We begin by demonstrating the existence and uniqueness of solutions, as well as the weak pullback mean random attractors of the system. Following this, we demonstrate the existence
-
Features of the interaction of paired solitary waves with the Cubic Vortical Whitham equation Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-03 Marcelo V. Flamarion, Efim Pelinovsky
In this article, we consider the cubic vortical Whitham equation with both positive and negative nonlinearity to investigate overtaking solitary wave collisions. We compute solitary waves numerically, including “thick” solitary waves. Our results show that in both cases, the geometric Lax categorization holds, however, it is independent of the magnitude of the amplitude of the solitary waves. Besides
-
Prescribed-time synchronization of hyperchaotic fuzzy stochastic PMSM model with an application to secure communications Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-03 Sangeetha Rajendran, Palanivel Kaliyaperumal
This study addresses the synchronization problem of grid-connected permanent magnet synchronous motors (PMSMs)-based wind energy conversion systems (WECSs). This study significantly enhances the existing WECSs into the four-dimensional hyperchaotic grid-connected WECSs by integrating the impact of a DC-link capacitor. Moreover, this study treats the aerodynamics of WECSs as stochastic differential
-
Radial boundary elements method, a new approach on using radial basis functions to solve partial differential equations, efficiently Appl. Math. Comput. (IF 3.5) Pub Date : 2025-01-02 Hossein Hosseinzadeh, Zeinab Sedaghatjoo
Conventionally, piecewise polynomials have been used in the boundary element method (BEM) to approximate unknown boundary values. However, since infinitely smooth radial basis functions (RBFs) are more stable and accurate than the polynomials for high dimensional domains, this paper proposes approximating the unknown values using RBFs. This new formulation is called the radial BEM. To calculate the
-
Reduced-order full information estimation observer-based dissipative control for nonlinear discrete-time switched singular systems with unknown inputs Appl. Math. Comput. (IF 3.5) Pub Date : 2024-12-31 Hongpeng Shi, Zhenli Zhao, Shuping Ma
The dissipative control problem for nonlinear discrete-time switched singular systems (NDSSSs) is investigated via a novel reduced-order observer in this paper. Firstly, based on the generalized Sylvester equations and the introduced nonlinear injection term, a novel reduced-order observer is designed for each subsystem. The designed reduced-order observer can still produce accurate full-information
-
Extended dissipative analysis of integral sliding mode control for singular interval type-2 fuzzy systems with time delay Appl. Math. Comput. (IF 3.5) Pub Date : 2024-12-30 Fangyuan Liu, Guobao Liu, Huai Liu, Shicheng Huo
This paper explores the extended dissipative analysis of integral sliding mode control in the context of singular interval type-2 (IT-2) fuzzy systems with time delays. To better align with the characteristics of type-2 fuzzy models, a suitable integral fuzzy switching surface is introduced, taking into account state-dependent input matrices. Additionally, to address conservatism resulting from time
-
Extremal function of two independent chorded cycles in a bipartite graph Appl. Math. Comput. (IF 3.5) Pub Date : 2024-12-27 Panpan Cheng, Yunshu Gao
Let G be a bipartite graph. In this paper, by constructing two extremal graphs, we completely determine the minimum number of edges of G that guaranteeing the existence of two independent chorded cycles. As a byproduct, our result also implies that G contains two independent cycles of different lengths.
-
A study on multi-information diffusion model considering dual social reinforcement effect from the perspective of evolutionary game Appl. Math. Comput. (IF 3.5) Pub Date : 2024-12-24 Yuanyuan Ma, Qiannan Zhang, Leilei Xie
The dynamic interactions of multi-information in online social networks present new challenges for understanding and forecasting information dissemination trends, especially the bounded rational decision-making of users when faced with various information. This article introduces evolutionary game theory to analyze user strategies amidst varying information. By using the Fermi function to calculate
-
A mathematical model for the bullying dynamics in schools Appl. Math. Comput. (IF 3.5) Pub Date : 2024-12-24 Nuno Crokidakis
We analyze a mathematical model to understand the dynamics of bullying in schools. The model considers a population divided into four groups: susceptible individuals, bullies, individuals exposed to bullying, and violent individuals. Transitions between these states occur at rates designed to capture the complex interactions among students, influenced by factors such as romantic rejection, conflicts
-
Supervised cooperation on interdependent public goods games Appl. Math. Comput. (IF 3.5) Pub Date : 2024-12-19 Ting Ling, Zhang Li, Minyu Feng, Attila Szolnoki
It is a challenging task to reach global cooperation among self-interested agents, which often requires sophisticated design or usage of incentives. For example, we may apply supervisors or referees who are able to detect and punish selfishness. As a response, defectors may offer bribes for corrupt referees to remain hidden, hence generating a new conflict among supervisors. By using the interdependent
-
A novel localized least-squares collocation method for coupled bulk-surface problems Appl. Math. Comput. (IF 3.5) Pub Date : 2024-12-18 Zhuochao Tang, Zhuojia Fu, Meng Chen, Leevan Ling
In this paper, we present a novel least-squares formulation of the Generalized Finite Difference Method (GFDM) and utilize its high-order schemes to solve the coupled bulk-surface reaction-diffusion equations. The coupled bulk-surface problems are composed of bulk equations and surface equations and coupled via some Robin-type boundary conditions. For differential operators on curved surfaces, we focus
-
Erratum on “Synchronization and chimeras in asymmetrically coupled memristive Tabu learning neuron network” [Appl. Math. Compt. 489 (2025) 129163] Appl. Math. Comput. (IF 3.5) Pub Date : 2024-12-18 A. Prasina, V. Samuthira Pandi, W. Nancy, K. Thilagam, K. Veena, A. Muniyappan
The errors in the recent paper [Appl. Math. Compt. 489 (2025) 129163] have been corrected in this article. We have confirmed that the modification does not impact the primary results or conclusions of Ref. Prasina et al. [1].
-
WENO based adaptive image zooming algorithm Appl. Math. Comput. (IF 3.5) Pub Date : 2024-12-18 Bojan Crnković, Jerko Škifić, Tina Bosner
Zooming or upsampling images is a common technique and an essential step in many image processing algorithms. This process introduces new information that can lead to numerical effects such as ringing artifacts, aliasing effects and blurring of the image. In this paper, we propose a polynomial interpolation algorithm based on the WENO algorithm for upsampling images, which provides high accuracy in