Applied Mathematics and Computation最新文献

筛选
英文 中文
Prescribed finite-time collision-avoidance control for high-order multi-agent systems with external disturbances 具有外部干扰的高阶多智能体系统的规定有限时间避碰控制
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-07-28 DOI: 10.1016/j.amc.2025.129661
Yajing Zhao , Xiaoping Liu , Cungen Liu
{"title":"Prescribed finite-time collision-avoidance control for high-order multi-agent systems with external disturbances","authors":"Yajing Zhao ,&nbsp;Xiaoping Liu ,&nbsp;Cungen Liu","doi":"10.1016/j.amc.2025.129661","DOIUrl":"10.1016/j.amc.2025.129661","url":null,"abstract":"<div><div>A prescribed finite-time control scheme is proposed for a multi-agent system with external disturbances. First, to drive all agents to track the reference signal within a limited time, and remain stable afterwards, the prescribed finite-time function is improved to be continuous and differentiable over the global time interval. Simultaneously, the smooth function can avoid abrupt fluctuations of the controller resulting from existing discontinuous unbounded prescribed finite-time functions. Then, a collision-free function is employed to avoid collisions among agents and maintain the distance between every pair of agents at a desired value. In addition, a novel <span><math><msub><mrow><mi>L</mi></mrow><mrow><mi>φ</mi></mrow></msub></math></span> norm consisting of the prescribed finite-time function is proposed, which helps prove that the control scheme can attenuate the influence of the external disturbance on the system output to a small extent. The properties of the proposed control scheme are validated on a three-dimensional multi-agent system with six agents.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"509 ","pages":"Article 129661"},"PeriodicalIF":3.5,"publicationDate":"2025-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144714427","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}
引用次数: 0
Robust parameter estimation for rational ordinary differential equations 有理常微分方程的鲁棒参数估计
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-07-28 DOI: 10.1016/j.amc.2025.129638
Oren Bassik , Yosef Berman , Soo Go , Hoon Hong , Ilia Ilmer , Alexey Ovchinnikov , Chris Rackauckas , Pedro Soto , Chee Yap
{"title":"Robust parameter estimation for rational ordinary differential equations","authors":"Oren Bassik ,&nbsp;Yosef Berman ,&nbsp;Soo Go ,&nbsp;Hoon Hong ,&nbsp;Ilia Ilmer ,&nbsp;Alexey Ovchinnikov ,&nbsp;Chris Rackauckas ,&nbsp;Pedro Soto ,&nbsp;Chee Yap","doi":"10.1016/j.amc.2025.129638","DOIUrl":"10.1016/j.amc.2025.129638","url":null,"abstract":"<div><div>We present a new approach for estimating parameters in rational ODE models from given (measured) time series data. In typical existing approaches, an initial guess for the parameter values is made from a given search interval. Then, in a loop, the corresponding outputs are computed by solving the ODE numerically, followed by computing the error from the given time series data. If the error is small, the loop terminates and the parameter values are returned. Otherwise, heuristics/theories are used to possibly improve the guess and continue the loop. These approaches tend to be non-robust in the sense that their accuracy often depends on the search interval and the true parameter values; furthermore, they cannot handle cases where the parameters are only locally identifiable.</div><div>In this paper, we propose a new approach, which does not suffer from the above non-robustness. In particular, it does not require making good initial guesses for the parameter values or specifying search intervals. Instead, it uses differential algebra, rational function interpolation of the data, and multivariate polynomial system solving. We also compare the performance of the resulting software with several other estimation software packages.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"509 ","pages":"Article 129638"},"PeriodicalIF":3.5,"publicationDate":"2025-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144714428","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}
引用次数: 0
Weak m-WG inverse 弱m-WG逆
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-07-25 DOI: 10.1016/j.amc.2025.129659
Dijana Mosić , Mohamed Amine Aouichaoui , Predrag S. Stanimirović
{"title":"Weak m-WG inverse","authors":"Dijana Mosić ,&nbsp;Mohamed Amine Aouichaoui ,&nbsp;Predrag S. Stanimirović","doi":"10.1016/j.amc.2025.129659","DOIUrl":"10.1016/j.amc.2025.129659","url":null,"abstract":"<div><div>The basic idea used in this research is to extend the system of matrix equations that determine the <em>m</em>-weak group inverse (<em>m</em>-WGI) utilizing a minimal rank weak Drazin inverse (MR-WDI) as a generalization of the core-EP inverse. An arbitrary solution of such extended system of equations is termed as weak-<em>m</em>-WGI. Based on the generality arising from the concept of the MR-WDI, the extended system is not uniquely solvable and defines the class of weak-<em>m</em>-WGIs. The class of weak-<em>m</em>-WGIs represents a broad class of generalized inverses, of which the <em>m</em>-WGI and Drazin inverse are particular cases. Characterizations and representations for the weak-<em>m</em>-WGI are proposed as well as its applications in solving certain linear equations. Some original results related to both the Drazin inverse and the <em>m</em>-WGI are obtained as featured particular cases.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"508 ","pages":"Article 129659"},"PeriodicalIF":3.5,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144702296","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}
引用次数: 0
Some results on core EP Drazin matrices and partial isometries 核心EP Drazin矩阵和部分等距的一些结果
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-07-25 DOI: 10.1016/j.amc.2025.129647
Gholamreza Aghamollaei , Mahdiyeh Mortezaei , Dijana Mosić , Néstor Thome
{"title":"Some results on core EP Drazin matrices and partial isometries","authors":"Gholamreza Aghamollaei ,&nbsp;Mahdiyeh Mortezaei ,&nbsp;Dijana Mosić ,&nbsp;Néstor Thome","doi":"10.1016/j.amc.2025.129647","DOIUrl":"10.1016/j.amc.2025.129647","url":null,"abstract":"<div><div>In this paper, by using the core EP inverse and the Drazin inverse which are two well known generalized inverses, a new class of matrices entitled <em>core EP Drazin matrices</em> (shortly, <span><math><mi>C</mi><mi>E</mi><mi>P</mi><mi>D</mi></math></span> matrices) is introduced. This class contains the set of all EP matrices and also the set of normal matrices. Some algebraic properties of these matrices are also investigated. Moreover, some results about the Drazin inverse and the core EP inverse of partial isometries are derived, and using them, some conditions for which partial isometries are CEPD, are obtained. To illustrate the main results, some numerical examples are given.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"509 ","pages":"Article 129647"},"PeriodicalIF":3.5,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144711807","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}
引用次数: 0
A radial basis function neural network approach for solving a diffusion partial differential equation efficiently 径向基函数神经网络有效求解扩散偏微分方程
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-07-25 DOI: 10.1016/j.amc.2025.129651
Tao Liu , Bolin Ding
{"title":"A radial basis function neural network approach for solving a diffusion partial differential equation efficiently","authors":"Tao Liu ,&nbsp;Bolin Ding","doi":"10.1016/j.amc.2025.129651","DOIUrl":"10.1016/j.amc.2025.129651","url":null,"abstract":"<div><div>This paper presents an approach that utilizes TensorFlow to construct a computational graph for solving a time-dependent partial differential equation using kernel-based approximations. Although TensorFlow is predominantly known for its deep learning applications, it also offers tools for numerical computations involving tensors. The proposed method leverages TensorFlow's capabilities to achieve efficient approximations. Compared to traditional methods, this approach highlights its potential for computationally solving partial differential equations on regular domains.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"509 ","pages":"Article 129651"},"PeriodicalIF":3.5,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144711804","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}
引用次数: 0
Invitation to the subpath number 邀请到子路径号
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-07-25 DOI: 10.1016/j.amc.2025.129646
Martin Knor , Jelena Sedlar , Riste Škrekovski , Yu Yang
{"title":"Invitation to the subpath number","authors":"Martin Knor ,&nbsp;Jelena Sedlar ,&nbsp;Riste Škrekovski ,&nbsp;Yu Yang","doi":"10.1016/j.amc.2025.129646","DOIUrl":"10.1016/j.amc.2025.129646","url":null,"abstract":"<div><div>In this paper we count all the subpaths of a given graph <em>G</em>, including the subpaths of length zero, and we call this quantity the subpath number of <em>G</em>. The subpath number is related to the extensively studied number of subtrees, as it can be considered as counting subtrees with the additional requirement of maximum degree being two. We first give the explicit formula for the subpath number of trees and unicyclic graphs. We show that among connected graphs on the same number of vertices, the minimum of the subpath number is attained for any tree and the maximum for the complete graph. Further, we show that the complete bipartite graph with partite sets of almost equal size maximizes the subpath number among all bipartite graphs. The explicit formula for cycle chains, i.e. graphs in which two consecutive cycles share a single edge, is also given. This family of graphs includes the unbranched catacondensed benzenoids which implies a possible application of the result in chemistry. The paper is concluded with several directions for possible further research where several conjectures are provided.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"509 ","pages":"Article 129646"},"PeriodicalIF":3.5,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144711808","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}
引用次数: 0
The evolution of social dilemma based on aspiration-based collective interdependence 基于愿望的集体相互依赖的社会困境演化
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-07-25 DOI: 10.1016/j.amc.2025.129662
Qianlong Zhu, Qi Wu, Wei Chen, Jun Tao
{"title":"The evolution of social dilemma based on aspiration-based collective interdependence","authors":"Qianlong Zhu,&nbsp;Qi Wu,&nbsp;Wei Chen,&nbsp;Jun Tao","doi":"10.1016/j.amc.2025.129662","DOIUrl":"10.1016/j.amc.2025.129662","url":null,"abstract":"<div><div>Group interactions represent a critical class which can not be adequately explained through the mere aggregation of pairwise interactions. For instance, collective interdependence exemplifies how the functioning of interdependent groups across different systems emerges from their synergistic relationships. This study introduces an aspiration-based adaptive mechanism for collective interdependence to explore the evolution of cooperation. Collective interdependence is triggered when the total payoff of a group surpasses a predefined aspiration level. Our findings reveal that the global synergy factor inherent to collective interdependence significantly enhances cooperative behavior. However, the role of aspiration exhibits nuanced effects. It is found that an optimal aspiration level maximizes cooperation under conditions of high global synergy effects. Yet for low global synergy effects and local temptations, cooperation displays a bimodal distribution as aspiration increases, with the second peak surpassing the first in magnitude. Furthermore, for a proper aspiration, it is possible for cooperators to dominate one subpopulation and defectors to occupy the other one. Our work reveals the important influence of collective interdependence on the spreading of cooperators, and may provide a perspective to study human cooperation on interdependent systems.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"508 ","pages":"Article 129662"},"PeriodicalIF":3.5,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144702297","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}
引用次数: 0
A class of generalized shift-splitting preconditioners for double saddle point problems 一类双鞍点问题的广义位移分裂预条件
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-07-25 DOI: 10.1016/j.amc.2025.129658
Sk. Safique Ahmad, Pinki Khatun
{"title":"A class of generalized shift-splitting preconditioners for double saddle point problems","authors":"Sk. Safique Ahmad,&nbsp;Pinki Khatun","doi":"10.1016/j.amc.2025.129658","DOIUrl":"10.1016/j.amc.2025.129658","url":null,"abstract":"<div><div>In this paper, we propose a generalized shift-splitting (GSS) preconditioner, along with its two relaxed variants to solve the double saddle point problem (DSPP). The convergence of the associated GSS iterative method is analyzed, and sufficient conditions for its convergence are established. Spectral analyses are performed to derive sharp bounds for the eigenvalues of the preconditioned matrices. Numerical experiments based on examples arising from the PDE-constrained optimization problem and the leaky lid driven cavity problem demonstrate the effectiveness and robustness of the proposed preconditioners compared with existing state-of-the-art preconditioners.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"509 ","pages":"Article 129658"},"PeriodicalIF":3.5,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144711803","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}
引用次数: 0
The consensus performance of leader-follower multi-agent systems under reversing the directions of arcs 领导-随从多智能体系统在反转弧线方向下的共识性能
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-07-25 DOI: 10.1016/j.amc.2025.129649
Xiaodi Song , Shenggui Zhang , Jing Li , Shanshan Gao
{"title":"The consensus performance of leader-follower multi-agent systems under reversing the directions of arcs","authors":"Xiaodi Song ,&nbsp;Shenggui Zhang ,&nbsp;Jing Li ,&nbsp;Shanshan Gao","doi":"10.1016/j.amc.2025.129649","DOIUrl":"10.1016/j.amc.2025.129649","url":null,"abstract":"<div><div>A leader-follower multi-agent system (MAS) on a digraph can reach a consensus provided that there exists a directed spanning tree in the digraph. The consensus performance of the MAS, which is characterized by the convergence rate, is associated with the Laplacian spectrum of the digraph. Moreover, the convergence rate increases with an increase on the algebraic connectivity, which is the minimal value among all real parts of nonzero Laplacian eigenvalues of the digraph. To explore the effects of graph operations on convergence rate, we consider the impacts on algebraic connectivity under reversing the directions of arcs among the network between followers in this paper. Consider reversing the direction of one arc, a necessary and sufficient condition for the increase on the algebraic connectivity is proposed based on the entries of a Fiedler vector. What's more, we give some sufficient conditions for the increase or the decrease on the algebraic connectivity under reversing the directions of multiple arcs, respectively.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"509 ","pages":"Article 129649"},"PeriodicalIF":3.5,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144711805","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}
引用次数: 0
On the matrix equation X + AX−1B = Q with semi-infinite quasi-Toeplitz coefficients 半无限准toeplitz系数的矩阵方程X + AX−1B = Q
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-07-25 DOI: 10.1016/j.amc.2025.129648
Jie Meng, Yuezhi Wang
{"title":"On the matrix equation X + AX−1B = Q with semi-infinite quasi-Toeplitz coefficients","authors":"Jie Meng,&nbsp;Yuezhi Wang","doi":"10.1016/j.amc.2025.129648","DOIUrl":"10.1016/j.amc.2025.129648","url":null,"abstract":"<div><div>This paper is concerned with computing the extremal solution of the matrix equation <span><math><mi>X</mi><mo>+</mo><mi>A</mi><msup><mrow><mi>X</mi></mrow><mrow><mo>−</mo><mn>1</mn></mrow></msup><mi>B</mi><mo>=</mo><mi>Q</mi></math></span>, where the coefficients <span><math><mi>A</mi><mo>,</mo><mi>B</mi></math></span> and <em>Q</em> are semi-infinite quasi-Toeplitz matrices. A quasi-Toeplitz matrix <em>A</em> is an infinite size matrix that can be written as the sum of a semi-infinite Toeplitz matrix and a correction matrix. We show that there is an extremely larger solution <span><math><msub><mrow><mi>X</mi></mrow><mrow><mo>+</mo></mrow></msub></math></span> of the nonlinear matrix equation under certain conditions. Moreover, the extremely larger solution preserves the quasi-Toeplitz structure and is an invertible quasi-Toeplitz <em>M</em>-matrix if <em>Q</em> is an invertible quasi-Toeplitz <em>M</em>-matrix. Fixed-point iterations, including a quadratically convergent algorithm based on the cyclic reduction, are analyzed for the computation of <span><math><msub><mrow><mi>X</mi></mrow><mrow><mo>+</mo></mrow></msub></math></span>. Numerical experiments showing the efficiency of the proposed algorithms are performed.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"509 ","pages":"Article 129648"},"PeriodicalIF":3.5,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144711806","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信