Pub Date : 2025-11-16DOI: 10.1016/j.amc.2025.129815
Hadi Rahbani , Hossein Abdollahzadeh Ahangar , Michael A. Henning
A set D of vertices in a graph G is a dominating set of G if every vertex not in D is adjacent to a vertex in D. The domination number, γ(G), is the minimum cardinality of a dominating set of G. The degree, , of a vertex v in G is the number of vertices adjacent to v in G. The first Zagreb index, M1(G), and the second Zagreb index, M2(G)), of G are defined by(1)respectively. We obtain new upper bounds for the first and second Zagreb indices of a tree in terms of the its order, the number of leaves and the domination number, and we characterize the extremal trees that achieve equality in the obtained bounds. These results improve results of Borovićanin and Furtula [Appl. Math. Comput. 279 (2016), 208–218].
{"title":"New upper bounds on Zagreb indices with given domination number","authors":"Hadi Rahbani , Hossein Abdollahzadeh Ahangar , Michael A. Henning","doi":"10.1016/j.amc.2025.129815","DOIUrl":"10.1016/j.amc.2025.129815","url":null,"abstract":"<div><div>A set <em>D</em> of vertices in a graph <em>G</em> is a dominating set of <em>G</em> if every vertex not in <em>D</em> is adjacent to a vertex in <em>D</em>. The domination number, <em>γ</em>(<em>G</em>), is the minimum cardinality of a dominating set of <em>G</em>. The degree, <span><math><mrow><msub><mi>deg</mi><mi>G</mi></msub><mrow><mo>(</mo><mi>v</mi><mo>)</mo></mrow></mrow></math></span>, of a vertex <em>v</em> in <em>G</em> is the number of vertices adjacent to <em>v</em> in <em>G</em>. The first Zagreb index, <em>M</em><sub>1</sub>(<em>G</em>), and the second Zagreb index, <em>M</em><sub>2</sub>(<em>G</em>)), of <em>G</em> are defined by<span><span><span>(1)</span><span><math><mtable><mtr><mtd><mrow><msub><mi>M</mi><mn>1</mn></msub><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>=</mo><munder><mo>∑</mo><mrow><mi>v</mi><mo>∈</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo></mrow></munder><msubsup><mi>deg</mi><mi>G</mi><mn>2</mn></msubsup><mrow><mo>(</mo><mi>v</mi><mo>)</mo></mrow><mspace></mspace><mrow><mi>and</mi></mrow><mspace></mspace><msub><mi>M</mi><mn>2</mn></msub><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>=</mo><munder><mo>∑</mo><mrow><mi>u</mi><mi>v</mi><mo>∈</mo><mi>E</mi><mo>(</mo><mi>G</mi><mo>)</mo></mrow></munder><msub><mi>deg</mi><mi>G</mi></msub><mrow><mo>(</mo><mi>u</mi><mo>)</mo></mrow><msub><mi>deg</mi><mi>G</mi></msub><mrow><mo>(</mo><mi>v</mi><mo>)</mo></mrow><mo>,</mo></mrow></mtd></mtr></mtable></math></span></span></span>respectively. We obtain new upper bounds for the first and second Zagreb indices of a tree in terms of the its order, the number of leaves and the domination number, and we characterize the extremal trees that achieve equality in the obtained bounds. These results improve results of Borovićanin and Furtula [Appl. Math. Comput. 279 (2016), 208–218].</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"514 ","pages":"Article 129815"},"PeriodicalIF":3.4,"publicationDate":"2025-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145535803","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-15DOI: 10.1016/j.amc.2025.129832
Igor Grzelec , Alfréd Onderko , Mariusz Woźniak
A multigraph in which adjacent vertices have different degrees is called locally irregular. An edge coloring of a multigraph H whose colors induce locally irregular submultigraphs is called locally irregular coloring, and the minimum number of colors of such a coloring is denoted by . In 2022, Grzelec and Woźniak conjectured that for every 2-multigraph 2G except 2K2 (G is the underlying simple graph). In this paper, we prove this conjecture when G is a regular, split, or special subcubic graph. We also provide constant upper bounds on if G is planar, or subcubic. In the proofs, we utilize special decompositions of graphs and the relation of Local Irregularity Conjecture to the well-known 1-2-3 Conjecture.
{"title":"On local irregularity conjecture for 2-multigraphs","authors":"Igor Grzelec , Alfréd Onderko , Mariusz Woźniak","doi":"10.1016/j.amc.2025.129832","DOIUrl":"10.1016/j.amc.2025.129832","url":null,"abstract":"<div><div>A multigraph in which adjacent vertices have different degrees is called <em>locally irregular</em>. An edge coloring of a multigraph <em>H</em> whose colors induce locally irregular submultigraphs is called <em>locally irregular coloring</em>, and the minimum number of colors of such a coloring is denoted by <span><math><mrow><mi>lir</mi><mo>(</mo><mi>H</mi><mo>)</mo></mrow></math></span>. In 2022, Grzelec and Woźniak conjectured that <span><math><mrow><mi>lir</mi><mo>(</mo><msup><mrow></mrow><mn>2</mn></msup><mi>G</mi><mo>)</mo><mo>≤</mo><mn>2</mn></mrow></math></span> for every 2-multigraph <sup>2</sup><em>G</em> except <sup>2</sup><em>K</em><sub>2</sub> (<em>G</em> is the underlying simple graph). In this paper, we prove this conjecture when <em>G</em> is a regular, split, or special subcubic graph. We also provide constant upper bounds on <span><math><mrow><mi>lir</mi><mo>(</mo><msup><mrow></mrow><mn>2</mn></msup><mi>G</mi><mo>)</mo></mrow></math></span> if <em>G</em> is planar, or subcubic. In the proofs, we utilize special decompositions of graphs and the relation of Local Irregularity Conjecture to the well-known 1-2-3 Conjecture.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"514 ","pages":"Article 129832"},"PeriodicalIF":3.4,"publicationDate":"2025-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145529025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-15DOI: 10.1016/j.amc.2025.129847
Yupin Wang , Tengda Wei , Feifei Du , Hui Li , Shutang Liu
In this paper, fractional Julia sets are constructed through fractional difference equations defined on time scale . The influence of memory and scale within the fractional (q, h)-difference system on its fractal dynamics is elucidated through an exploration of how memory, geometric, and algebraic parameters shape the resulting Julia sets. Numerical investigations using box-counting dimension analysis and symmetry criteria uncover intricate properties of these sets, such as their resilience to perturbations, while their central symmetry in a particular scenario is established.
{"title":"Fractional Julia sets on time scales","authors":"Yupin Wang , Tengda Wei , Feifei Du , Hui Li , Shutang Liu","doi":"10.1016/j.amc.2025.129847","DOIUrl":"10.1016/j.amc.2025.129847","url":null,"abstract":"<div><div>In this paper, fractional Julia sets are constructed through fractional difference equations defined on time scale <span><math><msub><mi>T</mi><mrow><mo>(</mo><mi>q</mi><mo>,</mo><mi>h</mi><mo>)</mo></mrow></msub></math></span>. The influence of memory and scale within the fractional (<em>q, h</em>)-difference system on its fractal dynamics is elucidated through an exploration of how memory, geometric, and algebraic parameters shape the resulting Julia sets. Numerical investigations using box-counting dimension analysis and symmetry criteria uncover intricate properties of these sets, such as their resilience to perturbations, while their central symmetry in a particular scenario is established.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"514 ","pages":"Article 129847"},"PeriodicalIF":3.4,"publicationDate":"2025-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145535835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-14DOI: 10.1016/j.amc.2025.129835
Masahiko Ueda
Controlling payoffs in repeated games is one of the important topics in control theory of multi-agent systems. Recently proposed zero-determinant strategies enable players to unilaterally enforce linear relations between payoffs. Furthermore, based on the mathematics of zero-determinant strategies, regional payoff control, in which payoffs are enforced into some feasible regions, has been discovered in social dilemma situations. More recently, theory of payoff control was extended to multichannel games, where players parallelly interact with each other in multiple channels. However, the existence of payoff-controlling strategies in multichannel games seems to require the existence of payoff-controlling strategies in some channels, and properties of zero-determinant strategies specific to multichannel games are still not clear. In this paper, we elucidate properties of zero-determinant strategies in multichannel games. First, we relate the existence condition of zero-determinant strategies in multichannel games to that of zero-determinant strategies in each channel. We then show that the existence of zero-determinant strategies in multichannel games requires the existence of zero-determinant strategies in some channels. This result implies that the existence of zero-determinant strategies in multichannel games is tightly restricted by structure of games played in each channel.
{"title":"Properties of zero-determinant strategies in multichannel games","authors":"Masahiko Ueda","doi":"10.1016/j.amc.2025.129835","DOIUrl":"10.1016/j.amc.2025.129835","url":null,"abstract":"<div><div>Controlling payoffs in repeated games is one of the important topics in control theory of multi-agent systems. Recently proposed zero-determinant strategies enable players to unilaterally enforce linear relations between payoffs. Furthermore, based on the mathematics of zero-determinant strategies, regional payoff control, in which payoffs are enforced into some feasible regions, has been discovered in social dilemma situations. More recently, theory of payoff control was extended to multichannel games, where players parallelly interact with each other in multiple channels. However, the existence of payoff-controlling strategies in multichannel games seems to require the existence of payoff-controlling strategies in some channels, and properties of zero-determinant strategies specific to multichannel games are still not clear. In this paper, we elucidate properties of zero-determinant strategies in multichannel games. First, we relate the existence condition of zero-determinant strategies in multichannel games to that of zero-determinant strategies in each channel. We then show that the existence of zero-determinant strategies in multichannel games requires the existence of zero-determinant strategies in some channels. This result implies that the existence of zero-determinant strategies in multichannel games is tightly restricted by structure of games played in each channel.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"514 ","pages":"Article 129835"},"PeriodicalIF":3.4,"publicationDate":"2025-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145529026","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Data-driven predator-prey modeling remains a challenging problem in ecological dynamics. In this study, we develop a prey-predator model to examine the interactions between elk and wolves in Banff National Park, explicitly incorporating prey refuge, inter-regional movement, and predation pressure. The system consists of two prey populations-Banff townsite elk and Bow Valley elk and wolves as the predator population. Through linear stability analysis, we derive the critical threshold of the Bow Valley elk production rate (β) and determine both the existence and direction of Hopf bifurcations. Furthermore, global stability of the equilibrium point is established using a Lyapunov function approach. The model is parameterized with empirical population data to ensure biological realism. Through sensitivity analysis, we found β as the most influential parameter affecting the populations. Our analysis reveals that increasing β leads to the extinction of the Banff elk population after transient oscillations, while the Bow Valley elk and wolf populations undergo a transition from stable equilibria to sustained limit cycle oscillations. These findings highlight the role of prey refuge in shaping elk-wolf coexistence and provide new insights into population persistence under ecological constraints.
{"title":"Persistence and extinction in an Elk-Wolf prey-predator system with refuge and inter-regional movement","authors":"Mitali Maji , Mohit Kumar , Subhas Khajanchi , Dibakar Ghosh","doi":"10.1016/j.amc.2025.129834","DOIUrl":"10.1016/j.amc.2025.129834","url":null,"abstract":"<div><div>Data-driven predator-prey modeling remains a challenging problem in ecological dynamics. In this study, we develop a prey-predator model to examine the interactions between elk and wolves in Banff National Park, explicitly incorporating prey refuge, inter-regional movement, and predation pressure. The system consists of two prey populations-Banff townsite elk and Bow Valley elk and wolves as the predator population. Through linear stability analysis, we derive the critical threshold of the Bow Valley elk production rate (<em>β</em>) and determine both the existence and direction of Hopf bifurcations. Furthermore, global stability of the equilibrium point is established using a Lyapunov function approach. The model is parameterized with empirical population data to ensure biological realism. Through sensitivity analysis, we found <em>β</em> as the most influential parameter affecting the populations. Our analysis reveals that increasing <em>β</em> leads to the extinction of the Banff elk population after transient oscillations, while the Bow Valley elk and wolf populations undergo a transition from stable equilibria to sustained limit cycle oscillations. These findings highlight the role of prey refuge in shaping elk-wolf coexistence and provide new insights into population persistence under ecological constraints.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"514 ","pages":"Article 129834"},"PeriodicalIF":3.4,"publicationDate":"2025-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145529027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-12DOI: 10.1016/j.amc.2025.129822
Chaoqun Guo , Yue Hu , Oh-Min Kwon , Jianrong Zhao , Seung-Hoon Lee
This paper focuses on the output feedback control problem for fuzzy singularly perturbed systems (SPSs) with packet dropouts. Three Bernoulli random variables are introduced to describe the packet loss behaviors of different network channels between sensors and controllers. A time-scale-dependent decode-and-forward (TSDDaF) relay scheme is proposed to improve the remote transmission of the fuzzy SPSs, in which the slow and fast measurement signal can be decoded and reconstructed separately according to the different time scales. The key results of this article can be summarized in two aspects: (1) Firstly, by exploiting the received slow and fast signals from both the relays and sensors via different channels, a TSDDaF relay-based composite fuzzy output feedback controller is designed, under which the control performance of fuzzy SPSs can be effectively improved. (2) Secondly, by establishing a singular perturbation parameter-dependent Lyapunov functional, the sufficient conditions for exponentially ultimately boundedness (EUB) in mean square sense can be obtained and the numerical stiffness problem can be avoided. The feasibility of our approach is illustrated through a flexible joint inverted pendulum example.
{"title":"Fuzzy-model-based output feedback control for nonlinear singularly perturbed systems with time-scale-dependent decode-and-forward relay strategy","authors":"Chaoqun Guo , Yue Hu , Oh-Min Kwon , Jianrong Zhao , Seung-Hoon Lee","doi":"10.1016/j.amc.2025.129822","DOIUrl":"10.1016/j.amc.2025.129822","url":null,"abstract":"<div><div>This paper focuses on the output feedback control problem for fuzzy singularly perturbed systems (SPSs) with packet dropouts. Three Bernoulli random variables are introduced to describe the packet loss behaviors of different network channels between sensors and controllers. A time-scale-dependent decode-and-forward (TSDDaF) relay scheme is proposed to improve the remote transmission of the fuzzy SPSs, in which the slow and fast measurement signal can be decoded and reconstructed separately according to the different time scales. The key results of this article can be summarized in two aspects: (1) Firstly, by exploiting the received slow and fast signals from both the relays and sensors via different channels, a TSDDaF relay-based composite fuzzy output feedback controller is designed, under which the control performance of fuzzy SPSs can be effectively improved. (2) Secondly, by establishing a singular perturbation parameter-dependent Lyapunov functional, the sufficient conditions for exponentially ultimately boundedness (EUB) in mean square sense can be obtained and the numerical stiffness problem can be avoided. The feasibility of our approach is illustrated through a flexible joint inverted pendulum example.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"514 ","pages":"Article 129822"},"PeriodicalIF":3.4,"publicationDate":"2025-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145515915","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-11DOI: 10.1016/j.amc.2025.129820
Chunfeng Cui , Liqun Qi
An M-eigenvalue of a nonnegative biquadratic tensor is referred to as an M-eigenvalue if it has a pair of nonnegative M-eigenvectors. If furthermore that pair of M-eigenvectors is positive, then that M-eigenvalue is called an M-eigenvalue. A nonnegative biquadratic tensor has at least one M eigenvalue, and the largest M-eigenvalue is both the largest M-eigenvalue and the M-spectral radius. For irreducible nonnegative biquadratic tensors, all the M-eigenvalues are M-eigenvalues. Although the M-eigenvalues of irreducible nonnegative biquadratic tensors are not unique in general, we establish a sufficient condition to ensure their uniqueness. For an irreducible nonnegative biquadratic tensor, the largest M-eigenvalue has a max-min characterization, while the smallest M-eigenvalue has a min-max characterization. A Collatz algorithm for computing the largest M-eigenvalues is proposed. Numerical results are reported.
{"title":"Nonnegative biquadratic tensors","authors":"Chunfeng Cui , Liqun Qi","doi":"10.1016/j.amc.2025.129820","DOIUrl":"10.1016/j.amc.2025.129820","url":null,"abstract":"<div><div>An M-eigenvalue of a nonnegative biquadratic tensor is referred to as an M<span><math><msup><mrow></mrow><mo>+</mo></msup></math></span>-eigenvalue if it has a pair of nonnegative M-eigenvectors. If furthermore that pair of M-eigenvectors is positive, then that M<span><math><msup><mrow></mrow><mo>+</mo></msup></math></span>-eigenvalue is called an M<span><math><msup><mrow></mrow><mrow><mo>+</mo><mo>+</mo></mrow></msup></math></span>-eigenvalue. A nonnegative biquadratic tensor has at least one M<span><math><msup><mrow></mrow><mo>+</mo></msup></math></span> eigenvalue, and the largest M<span><math><msup><mrow></mrow><mo>+</mo></msup></math></span>-eigenvalue is both the largest M-eigenvalue and the M-spectral radius. For irreducible nonnegative biquadratic tensors, all the M<span><math><msup><mrow></mrow><mo>+</mo></msup></math></span>-eigenvalues are M<span><math><msup><mrow></mrow><mrow><mo>+</mo><mo>+</mo></mrow></msup></math></span>-eigenvalues. Although the M<span><math><msup><mrow></mrow><mo>+</mo></msup></math></span>-eigenvalues of irreducible nonnegative biquadratic tensors are not unique in general, we establish a sufficient condition to ensure their uniqueness. For an irreducible nonnegative biquadratic tensor, the largest M<span><math><msup><mrow></mrow><mo>+</mo></msup></math></span>-eigenvalue has a max-min characterization, while the smallest M<span><math><msup><mrow></mrow><mo>+</mo></msup></math></span>-eigenvalue has a min-max characterization. A Collatz algorithm for computing the largest M<span><math><msup><mrow></mrow><mo>+</mo></msup></math></span>-eigenvalues is proposed. Numerical results are reported.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"514 ","pages":"Article 129820"},"PeriodicalIF":3.4,"publicationDate":"2025-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145509286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-11DOI: 10.1016/j.amc.2025.129821
Youngmi Hur , Hyojae Lim , Mikyoung Lim
In this paper, we develop a wavelet-based theoretical framework for analyzing the universal approximation capabilities of neural networks over a wide range of activation functions. Leveraging wavelet frame theory on the spaces of homogeneous type, we derive sufficient conditions on activation functions to ensure that the associated neural network approximates any functions in the function space induced by the activation function, along with an error estimate. These sufficient conditions accommodate a variety of smooth activation functions, including those that exhibit oscillatory behavior. Furthermore, by considering the L2-distance between smooth and non-smooth activation functions, we establish a generalized approximation result that is applicable to non-smooth activations, with the error explicitly controlled by this distance. This provides increased flexibility in the design of network architectures.
{"title":"Provable wavelet-based neural approximation","authors":"Youngmi Hur , Hyojae Lim , Mikyoung Lim","doi":"10.1016/j.amc.2025.129821","DOIUrl":"10.1016/j.amc.2025.129821","url":null,"abstract":"<div><div>In this paper, we develop a wavelet-based theoretical framework for analyzing the universal approximation capabilities of neural networks over a wide range of activation functions. Leveraging wavelet frame theory on the spaces of homogeneous type, we derive sufficient conditions on activation functions to ensure that the associated neural network approximates any functions in the function space induced by the activation function, along with an error estimate. These sufficient conditions accommodate a variety of smooth activation functions, including those that exhibit oscillatory behavior. Furthermore, by considering the <em>L</em><sup>2</sup>-distance between smooth and non-smooth activation functions, we establish a generalized approximation result that is applicable to non-smooth activations, with the error explicitly controlled by this distance. This provides increased flexibility in the design of network architectures.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"514 ","pages":"Article 129821"},"PeriodicalIF":3.4,"publicationDate":"2025-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145498982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-09DOI: 10.1016/j.amc.2025.129816
Ziyun Wang , Chao Feng , Yan Wang , Zhenhua Wang
To make parameter estimation more accurate and concise, a parameter identification method based on particle evaluation and orthotope is presented in this paper. First, all possible expansion directions of the parameter-feasible domain (predicted orthotope) were evaluated. Further particle evaluation was carried out in the expanded orthotope to shrink the feasible domain. Once the upper and lower bounds of the parameter estimation were obtained, a particle filter with improved sampling was used for state estimation. Finally, the effectiveness and accuracy of the proposed algorithm were verified through simulations.
{"title":"System modeling based on orthotopic expansion particle filter for linear time-varying system with bounded noise","authors":"Ziyun Wang , Chao Feng , Yan Wang , Zhenhua Wang","doi":"10.1016/j.amc.2025.129816","DOIUrl":"10.1016/j.amc.2025.129816","url":null,"abstract":"<div><div>To make parameter estimation more accurate and concise, a parameter identification method based on particle evaluation and orthotope is presented in this paper. First, all possible expansion directions of the parameter-feasible domain (predicted orthotope) were evaluated. Further particle evaluation was carried out in the expanded orthotope to shrink the feasible domain. Once the upper and lower bounds of the parameter estimation were obtained, a particle filter with improved sampling was used for state estimation. Finally, the effectiveness and accuracy of the proposed algorithm were verified through simulations.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"514 ","pages":"Article 129816"},"PeriodicalIF":3.4,"publicationDate":"2025-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145473263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-08DOI: 10.1016/j.amc.2025.129814
Chunxiao Wang , Aodi Wang , Qimeng Chen , Jiali Yu , Xiufang Liu
An adaptive control scheme is developed in this study to achieve asymptotic tracking for strict feedback nonlinear systems with asymmetric full-state constraints of arbitrary time period. Meanwhile, uncertain nonlinear factors and external disturbances are considered. State constraints of arbitrary time period mean that system states are constrained during arbitrary finite time period and not constrained at the other. A new shifting function and state transformations are employed to address state constraints of arbitrary time period, and the asymptotic Lyapunov function is constructed to achieve asymptotic tracking. For the nonlinear system with unknown nonlinear uncertainties, a fuzzy logic system is introduced. Fuzzy rules and membership functions are used to flexibly fit the unknown continuous functions. Dynamic Surface Control (DSC) is systematically employed to avoid the computational complexity associated with traditional backstepping methods. In comparison to existing results, the presented control strategy solves asymptotic tracking problem for state constraints of arbitrary time period for the first time, while guaranteeing that all closed-loop signals remain bounded. Lastly, a rigorous validation of the proposed control strategy is conducted via comprehensive numerical simulations.
{"title":"Fuzzy adaptive asymptotic tracking control for uncertain nonlinear systems with full-state constraints of arbitrary time","authors":"Chunxiao Wang , Aodi Wang , Qimeng Chen , Jiali Yu , Xiufang Liu","doi":"10.1016/j.amc.2025.129814","DOIUrl":"10.1016/j.amc.2025.129814","url":null,"abstract":"<div><div>An adaptive control scheme is developed in this study to achieve asymptotic tracking for strict feedback nonlinear systems with asymmetric full-state constraints of arbitrary time period. Meanwhile, uncertain nonlinear factors and external disturbances are considered. State constraints of arbitrary time period mean that system states are constrained during arbitrary finite time period and not constrained at the other. A new shifting function and state transformations are employed to address state constraints of arbitrary time period, and the asymptotic Lyapunov function is constructed to achieve asymptotic tracking. For the nonlinear system with unknown nonlinear uncertainties, a fuzzy logic system is introduced. Fuzzy rules and membership functions are used to flexibly fit the unknown continuous functions. Dynamic Surface Control (DSC) is systematically employed to avoid the computational complexity associated with traditional backstepping methods. In comparison to existing results, the presented control strategy solves asymptotic tracking problem for state constraints of arbitrary time period for the first time, while guaranteeing that all closed-loop signals remain bounded. Lastly, a rigorous validation of the proposed control strategy is conducted via comprehensive numerical simulations.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"514 ","pages":"Article 129814"},"PeriodicalIF":3.4,"publicationDate":"2025-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145461918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号