Applied Mathematics and Computation最新文献

{"title":"DL-integral and DQ-integral n-Cayley graphs","authors":"Lantao Zou,&nbsp;Yongjiang Wu,&nbsp;Lihua Feng","doi":"10.1016/j.amc.2024.129178","DOIUrl":"10.1016/j.amc.2024.129178","url":null,"abstract":"<div><div>In this paper, we derive a decomposition formula for spectra of the distance Laplacian matrix <span><math><msup><mrow><mi>D</mi></mrow><mrow><mi>L</mi></mrow></msup></math></span> and distance signless Laplacian matrix <span><math><msup><mrow><mi>D</mi></mrow><mrow><mi>Q</mi></mrow></msup></math></span> of <em>n</em>-Cayley graphs by using group representation theory. Besides, we compute the <span><math><msup><mrow><mi>D</mi></mrow><mrow><mi>L</mi></mrow></msup></math></span> and <span><math><msup><mrow><mi>D</mi></mrow><mrow><mi>Q</mi></mrow></msup></math></span> spectra of the <em>n</em>-gonal <em>n</em>-cone graph and the <em>n</em>-sunlet graph. Finally, we present some examples of <span><math><msup><mrow><mi>D</mi></mrow><mrow><mi>L</mi></mrow></msup></math></span>-integral graphs and <span><math><msup><mrow><mi>D</mi></mrow><mrow><mi>Q</mi></mrow></msup></math></span>-integral graphs.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142586812","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}

{"title":"Determination of Navier's slip parameter using data assimilation","authors":"Alena Jarolímová,&nbsp;Jaroslav Hron","doi":"10.1016/j.amc.2024.129157","DOIUrl":"10.1016/j.amc.2024.129157","url":null,"abstract":"<div><div>One of the crucial aspects of patient-specific blood flow simulations is to specify material parameters and boundary conditions. The choice of boundary conditions can have a substantial impact on the character of the flow. While no-slip is the most popular wall boundary condition, some amount of slip, which determines how much fluid is allowed to flow along the wall, might be beneficial for better agreement with flow patterns in medical images. However, even if one assumes the simple Navier's boundary conditions on the wall, in which the relationship between tangential components of the normal traction and the velocity is linear, the determination of the specific value of the slip parameter is often difficult.</div><div>In this work, we present and test an optimal control method to estimate Navier's slip parameter on the wall and the velocity profile at the inlet using artificially generated flow domain and flow data. The results show that it is possible to recover the flow patterns and Navier's slip parameter by using sufficiently accurate discretization even from data containing a substantial amount of noise.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142586813","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}

{"title":"Numerical simulation and error estimation of the Davey-Stewartson equations with virtual element method","authors":"Baharak Hooshyarfarzin,&nbsp;Mostafa Abbaszadeh,&nbsp;Mehdi Dehghan","doi":"10.1016/j.amc.2024.129146","DOIUrl":"10.1016/j.amc.2024.129146","url":null,"abstract":"<div><div>This paper aims to present the virtual element method (VEM) for solving the Davey–Stewartson equations with application in fluid mechanics. The VEM is a recent technology that can be regarded as a generalization of the standard finite element method (FEM) to general meshes without the need to integrate complex nonpolynomial functions on the elements. This method only utilizes degrees of freedom associated with the boundary, hence reducing computational complexity compared to the standard FEM. To obtain a full- discrete scheme we combine a semi-implicit scheme with the VEM for time and space variable discretizations, respectively. Furthermore, we obtain an error bound for the full-discrete scheme. The theoretical analysis demonstrates that the convergence rate in the <span><math><msup><mrow><mi>L</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> norm is <span><math><mi>O</mi><mo>(</mo><msup><mrow><mi>h</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>+</mo><mi>τ</mi><mo>)</mo></math></span>. Numerical examples confirm efficiency and applicability of the presented method and validate the theoretical outcomes.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142586815","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}

{"title":"Synchronization and chimeras in asymmetrically coupled memristive Tabu learning neuron network","authors":"A. Prasina ,&nbsp;V. Samuthira Pandi ,&nbsp;W. Nancy ,&nbsp;K. Thilagam ,&nbsp;K. Veena ,&nbsp;A. Muniyappan","doi":"10.1016/j.amc.2024.129163","DOIUrl":"10.1016/j.amc.2024.129163","url":null,"abstract":"<div><div>The coupling between neuronal oscillators plays an intriguing role in understanding the dynamics of the biological neurons present in realistic situations. Importantly, when the coupling between these neurons assumes an asymmetric nature, it can lead to profound changes in their overall behavior. In order to explore the impact of asymmetrical coupling on neuron models subjected to magnetic flux induction, we employ a coupled Tabu learning neuron model. Specifically, we illustrate the interplay between flux coupling and asymmetric electrical synapses concerning the control parameters of the proposed system using phase portraits, time series, bifurcation analysis, and Lyapunov spectrum. In particular, we show the dynamics by taking into account asymmetric interactions between neurons, from a simple network of two coupled systems to a network of nodes. Primarily, we demonstrate that two coupled systems exhibit synchronization for a fixed magnitude of control parameter with increasing coupling strength. Furthermore, we discuss the collective dynamics for the distinct network connectivity including regular, small-world and random. For all network connections, an increase in coupling strength facilitates a transition from desynchronization to synchronization via chimera state. We believe that attaining synchronization in Tabu learning neuron can act as a pivotal factor for neuron activity, contributing to the realization of such behavior in the context of numerous cognitive processes.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142586814","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}

{"title":"Finite-region dissipative control for two-dimensional Roesser systems via Markov jumping mechanism","authors":"Jiabao Wei ,&nbsp;Hai Wang ,&nbsp;Kaibo Shi ,&nbsp;Shuping He ,&nbsp;Chengcheng Ren","doi":"10.1016/j.amc.2024.129106","DOIUrl":"10.1016/j.amc.2024.129106","url":null,"abstract":"<div><div>This paper focuses on the dissipative control design problem for a class of Markov jump systems (MJSs) via two-dimensional (2D) Roesser models. In terms of Lyapunov functional methods and linear matrix inequalities techniques, sufficient conditions are established to obtain the dissipative controller, such that the closed-loop system is finite-region bounded with (<em>Q</em>, <em>S</em>, <span><math><mi>R</mi></math></span>)-<em>κ</em>-dissipative performance. Finally, the potential application of the designed approach is demonstrated via a numerical example of Darboux equations.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142586208","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}

{"title":"On the number of Fk,4-saturating edges","authors":"Yuying Li,&nbsp;Kexiang Xu","doi":"10.1016/j.amc.2024.129162","DOIUrl":"10.1016/j.amc.2024.129162","url":null,"abstract":"&lt;div&gt;&lt;div&gt;For a graph &lt;em&gt;F&lt;/em&gt;, let &lt;em&gt;G&lt;/em&gt; be an &lt;em&gt;F&lt;/em&gt;-free graph, a non-edge &lt;em&gt;e&lt;/em&gt; of &lt;em&gt;G&lt;/em&gt; is an &lt;em&gt;F&lt;/em&gt;-saturating edge if &lt;span&gt;&lt;math&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;mi&gt;e&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; contains a copy of &lt;em&gt;F&lt;/em&gt;. Graph &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;r&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; consists of &lt;em&gt;k&lt;/em&gt; cliques &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;K&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;r&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; intersecting in exactly one common vertex. Denote by &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;f&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;m&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; the minimum number of &lt;em&gt;F&lt;/em&gt;-saturating edges of &lt;em&gt;F&lt;/em&gt;-free graphs on &lt;em&gt;n&lt;/em&gt; vertices with &lt;em&gt;m&lt;/em&gt; edges and &lt;span&gt;&lt;math&gt;&lt;msubsup&gt;&lt;mrow&gt;&lt;mi&gt;f&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;⁎&lt;/mo&gt;&lt;/mrow&gt;&lt;/msubsup&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;m&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;, where &lt;span&gt;&lt;math&gt;&lt;mi&gt;m&lt;/mi&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mi&gt;e&lt;/mi&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;, the minimum number of &lt;em&gt;F&lt;/em&gt;-saturating edges of &lt;em&gt;F&lt;/em&gt;-free graphs on &lt;em&gt;n&lt;/em&gt; vertices with &lt;em&gt;m&lt;/em&gt; edges obtained by deleting edges from the extremal graph attaining &lt;span&gt;&lt;math&gt;&lt;mi&gt;e&lt;/mi&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;. In this paper, we study the number of &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;4&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt;-saturating edges in &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;4&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt;-free graphs on &lt;em&gt;n&lt;/em&gt; vertices with &lt;span&gt;&lt;math&gt;&lt;mi&gt;e&lt;/mi&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;4&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt; edges. We give the upper bounds on &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;f&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;4&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;e&lt;/mi&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;4&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; and get the value of &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;f&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;4&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;e&lt;/mi&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;4&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;. Moreover, we characterize the extremal graphs attaining &lt;span&gt;&lt;math&gt;&lt;mi&gt;e&lt;/mi&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;4&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt;) with odd &lt;span&gt;&lt;math&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;≥&lt;/mo&gt;&lt;mn&gt;3&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt; and prove &lt;span&gt;&lt;math&gt;&lt;msubsup&gt;&lt;mrow&gt;&lt;mi&gt;f&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;msub&gt;&lt;mr","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142578007","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}

{"title":"Inversion formulas for the attenuated conical Radon transform: Plane and cylinder case","authors":"Sunghwan Moon ,&nbsp;Markus Haltmeier","doi":"10.1016/j.amc.2024.129159","DOIUrl":"10.1016/j.amc.2024.129159","url":null,"abstract":"<div><div>Since the invention of Compton camera imaging, the conical Radon transform, which maps a given function defined on 3-dimensional Euclidean space to its surface integrals over cones, has been studied intensively. The problem of recovering such a function from its unrestricted conical Radon transform is overdetermined, since the set of all cones depends on the three dimensions of the vertex, the two dimensions of the central axis, and the one-dimensional opening angle. Therefore, various types of restricted conical Radon transforms have also been studied. However, most of these studies have neglected the attenuation of the medium. This article presents the study of attenuated conical Radon transforms with vertices on a plane (referred to as the plane case) or the cylinder (referred to as the cylinder case) in a 3-dimensional space. In all cases, the function is integrated over conical surfaces with an additional weight that decreases with the distance to the vertex of the cones. The main results provide explicit inversion formulas for the attenuated conical Radon transform in the plane and in the cylinder case.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142578006","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}

{"title":"A shooting-Newton procedure for solving fractional terminal value problems","authors":"Luigi Brugnano ,&nbsp;Gianmarco Gurioli ,&nbsp;Felice Iavernaro","doi":"10.1016/j.amc.2024.129164","DOIUrl":"10.1016/j.amc.2024.129164","url":null,"abstract":"<div><div>In this paper we consider the numerical solution of <em>fractional terminal value problems</em>: namely, <em>terminal value problems for fractional differential equations</em>. In particular, the proposed method uses a Newton-type iteration which is particularly efficient when coupled with a recently-introduced step-by-step procedure for solving <em>fractional initial value problems</em>, i.e., <em>initial value problems for fractional differential equations</em>. As a result, the method is able to produce spectrally accurate solutions of fractional terminal value problems. Some numerical tests are reported to make evidence of its effectiveness.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142578005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Probabilistic stability and stabilization of human-machine system via hidden semi-Markov modeling approach","authors":"Yang-Fan Liu ,&nbsp;Huai-Ning Wu","doi":"10.1016/j.amc.2024.129153","DOIUrl":"10.1016/j.amc.2024.129153","url":null,"abstract":"<div><div>This paper investigates the probabilistic stability and stabilization issues of human-machine systems (H-MSs) through the use of hidden semi-Markov model (HS-MM) for human behavior modeling. Firstly, an HS-MM is employed to illustrate the sojourn-time-dependent HIS behavior, which considers the stochastic nature of human internal state (HIS) reasoning and the uncertainty from HIS observation. Next, by integrating HIS model, machine dynamic model, and human-machine interaction, a hidden semi-Markov jump system (HS-MJS) model is established to describe the H-MS. The initial machine state is considered to be Gaussian distributed with some given expected value and covariance matrix. By the tools of probabilistic reachable set computation and stochastic Lyapunov functional, a sufficient condition for the stochastic stability of the H-MS with some given confidence level is provided in terms of linear matrix inequalities (LMIs). Moreover, for a prescribed confidence level, an LMI-based human-assistance controller synthesis method is proposed to stabilize the H-MS with the confidence level. Finally, a driver-automation cooperative system is employed to verify the feasibility of the theoretical results.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142561171","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}

{"title":"H∞ adaptive ETF control for degenerate jump systems under actuator faults and impulsive deception attacks with application to DCMIP device","authors":"Yifan Wu ,&nbsp;Guangming Zhuang ,&nbsp;Mengmeng Jiang ,&nbsp;Yanqian Wang","doi":"10.1016/j.amc.2024.129158","DOIUrl":"10.1016/j.amc.2024.129158","url":null,"abstract":"<div><div>This article considers the issue of <span><math><msub><mrow><mi>H</mi></mrow><mrow><mo>∞</mo></mrow></msub></math></span> adaptive event-triggered feedback control for degenerate jump systems under actuator faults and impulsive deception attacks. Based on periodic sampling strategy, a mode-dependent adaptive event-triggered scheme is developed, which can save communication resources, avoid the Zeno phenomenon and take full advantage of Markovian mode information. By constructing the neoteric Lyapunov-Krasovskii (L-K) functional containing piecewise linear impulsive auxiliary functions and applying singular value decomposition (SVD) technique, the fresh stochastic admissibility conditions for degenerate Markovian jump systems under actuator faults and impulsive deception attacks are obtained under the framework of linear matrix inequalities (LMIs), and then the adaptive event-triggered scheme with weighted matrices and feedback controller are designed simultaneously. By applying freedom weight matrix method and the property that the network-induced delay derivative is one, the non-strict LMI conditions are transformed into strict ones, such that the stochastic admissibility of the degenerate jump systems and state feedback controller gains are realized adequately. Finally, a direct current motor-controlled inverted pendulum (DCMIP) device is used to confirm the feasibility of the presented approach.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142561170","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}