首页 > 最新文献

Journal of Applied Mathematics and Computing最新文献

英文 中文
Novel resolvability parameter of some well-known graphs and exchange properties with applications 一些著名图形的新可解析参数及交换特性的应用
IF 2.2 3区 数学 Q1 Mathematics Pub Date : 2024-05-30 DOI: 10.1007/s12190-024-02137-w
Sikander Ali, Muhammad Azeem, Manzoor Ahmad Zahid, Muhammad Usman, Madhumangal Pal

The resolvability parameter is an essential component, especially in the context of network research, due to its theoretical and practical significance. Its importance is evident in several applications and outcomes, including social network analysis, network security, facility location and site selection, and effective routing. We introduce a novel resolvability parameter, Fault-Tolerant Mixed Metric Dimension, in this paper, and this defined as let (R_{m,f}) be a set that nodes on a graph as both an edge-resolving set and a resolving set. If (R_{m,f}) can uniquely represent the graph’s edges and vertices, then it is referred to as a mixed resolving set, and its all subsets cardinality is called the mixed metric dimension. If all of the graph’s vertices and edges are uniquely represented by (R_{m,f}^{prime },) and all subsets of (R_{m,f}^{prime }) with of cardinality one less than (R_{m,f}) likewise have unique representations for all of the graph’s vertices and edges, then (R_{m,f}) is referred to as a Fault-Tolerant Mixed Resolving Set, and If two such sets (R_{m,f}^{1}) and (R_{m,f}^{2}) exist such that (R_{m,f}^{1}cap R_{m,f}^{2}ne 0) then we say that the graph has exchange property. (R_{m,f})’s minimum cardinality is known as its fault-tolerant mixed Metric Dimension. These definitions offer a means of measuring a collection of vertices’ capacity to represent graph structures uniquely, taking fault-tolerant and resolution into account. Furthermore, a problem related to the lab’s system network is also discussed and linked with this topic in this work. Like a lab engineer is embarking on the creation of a new circular lab, intending to establish where and how many devices within it to supply internet with wire to all systems. A solution to this problem is proving this novel topic authenticity.

由于其理论和实践意义,可解性参数是一个重要组成部分,尤其是在网络研究方面。它的重要性在社交网络分析、网络安全、设施定位和选址以及有效路由等多个应用和成果中显而易见。我们在本文中引入了一个新的可解析度参数--容错混合度量维度,其定义为:设 (R_{m,f}) 是图上的节点集,既是边解析集,又是解析集。如果 (R_{m,f}) 可以唯一地表示图的边和顶点,那么它就被称为混合解析集合,它的所有子集的心智称为混合度量维度。如果图的所有顶点和边都能(R_{m,f}^{prime },)唯一地表示,并且(R_{m,f}^{prime }) 的所有子集的心度小于(R_{m,f}),同样也能唯一地表示图的所有顶点和边、如果存在两个这样的集合 (R_{m,f}^{1}) 和 (R_{m,f}^{2}) ,使得 (R_{m,f}^{1}cap R_{m,f}^{2}ne 0) 那么我们就说这个图具有交换属性。(R_{m,f}) 的最小心数被称为其容错混合度量维度(fault-tolerant mixed Metric Dimension)。这些定义提供了一种衡量顶点集合唯一表示图结构的能力的方法,并将容错性和分辨率考虑在内。此外,本作品还讨论了一个与实验室系统网络相关的问题,并将其与本主题联系起来。比如,一位实验室工程师正在着手创建一个新的圆形实验室,打算在实验室内的什么地方、有多少设备来为所有系统提供有线互联网。这一问题的解决方案证明了这一新颖课题的真实性。
{"title":"Novel resolvability parameter of some well-known graphs and exchange properties with applications","authors":"Sikander Ali, Muhammad Azeem, Manzoor Ahmad Zahid, Muhammad Usman, Madhumangal Pal","doi":"10.1007/s12190-024-02137-w","DOIUrl":"https://doi.org/10.1007/s12190-024-02137-w","url":null,"abstract":"<p>The resolvability parameter is an essential component, especially in the context of network research, due to its theoretical and practical significance. Its importance is evident in several applications and outcomes, including social network analysis, network security, facility location and site selection, and effective routing. We introduce a novel resolvability parameter, Fault-Tolerant Mixed Metric Dimension, in this paper, and this defined as let <span>(R_{m,f})</span> be a set that nodes on a graph as both an edge-resolving set and a resolving set. If <span>(R_{m,f})</span> can uniquely represent the graph’s edges and vertices, then it is referred to as a mixed resolving set, and its all subsets cardinality is called the mixed metric dimension. If all of the graph’s vertices and edges are uniquely represented by <span>(R_{m,f}^{prime },)</span> and all subsets of <span>(R_{m,f}^{prime })</span> with of cardinality one less than <span>(R_{m,f})</span> likewise have unique representations for all of the graph’s vertices and edges, then <span>(R_{m,f})</span> is referred to as a Fault-Tolerant Mixed Resolving Set, and If two such sets <span>(R_{m,f}^{1})</span> and <span>(R_{m,f}^{2})</span> exist such that <span>(R_{m,f}^{1}cap R_{m,f}^{2}ne 0)</span> then we say that the graph has exchange property. <span>(R_{m,f})</span>’s minimum cardinality is known as its fault-tolerant mixed Metric Dimension. These definitions offer a means of measuring a collection of vertices’ capacity to represent graph structures uniquely, taking fault-tolerant and resolution into account. Furthermore, a problem related to the lab’s system network is also discussed and linked with this topic in this work. Like a lab engineer is embarking on the creation of a new circular lab, intending to establish where and how many devices within it to supply internet with wire to all systems. A solution to this problem is proving this novel topic authenticity.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141191394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fixed/preassigned-time synchronization of fuzzy inertial neural netwroks via event-triggered controller 通过事件触发控制器实现模糊惯性神经网络的固定/预分配时间同步化
IF 2.2 3区 数学 Q1 Mathematics Pub Date : 2024-05-29 DOI: 10.1007/s12190-024-02136-x
Tianqi Wang, Junhao Hu, Yan Li, Guodong Zhang

The article studies fixed/preassigned-time synchronization in a fuzzy inertial neural network characterized by discontinuous activation functions and mixed delays. First, we adopt a more accurate method to calculate the settling-time. Then, we extend the result of fixed-time synchronization (FXS) to preassigned-time synchronization (PAS). Next, by designing event-triggered controller and applying the non-smooth theory, the stability criterion of FXS/PAS are obtained. Finally, in the simulation section, we illustrate the validity and practicability of the results by listing a specific example.

文章研究了以不连续激活函数和混合延迟为特征的模糊惯性神经网络中的固定/预分配时间同步问题。首先,我们采用了一种更精确的方法来计算沉降时间。然后,我们将固定时间同步(FXS)的结果扩展到预分配时间同步(PAS)。接着,通过设计事件触发控制器和应用非光滑理论,我们得到了 FXS/PAS 的稳定性准则。最后,在仿真部分,我们列举了一个具体实例来说明结果的有效性和实用性。
{"title":"Fixed/preassigned-time synchronization of fuzzy inertial neural netwroks via event-triggered controller","authors":"Tianqi Wang, Junhao Hu, Yan Li, Guodong Zhang","doi":"10.1007/s12190-024-02136-x","DOIUrl":"https://doi.org/10.1007/s12190-024-02136-x","url":null,"abstract":"<p>The article studies fixed/preassigned-time synchronization in a fuzzy inertial neural network characterized by discontinuous activation functions and mixed delays. First, we adopt a more accurate method to calculate the settling-time. Then, we extend the result of fixed-time synchronization (FXS) to preassigned-time synchronization (PAS). Next, by designing event-triggered controller and applying the non-smooth theory, the stability criterion of FXS/PAS are obtained. Finally, in the simulation section, we illustrate the validity and practicability of the results by listing a specific example.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141171074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An efficient iterative procedure in hyperbolic space and application to non-linear delay integral equation 双曲空间中的高效迭代程序及其在非线性延迟积分方程中的应用
IF 2.2 3区 数学 Q1 Mathematics Pub Date : 2024-05-27 DOI: 10.1007/s12190-024-02134-z
Khairul Habib Alam, Yumnam Rohen

In the context of hyperbolic spaces, our study presents a novel iterative approach for approximating common fixed points satisfying general contractive condition involving a pair of mappings with weak compatibility. Also, we notice that our iterative procedure approximates to a point of coincidence if the weak compatibility condition is violated. We provide theorems to demonstrate the (Delta -)convergence, stability, and efficiency of this iteration process. Additionally, we provided some immediate corollaries that involve mappings with contractive condition, instead of general contractive condition. Furthermore, we demonstrate with examples and graphs that our iteration process is faster than all previous procedures, including those of Jungck-SP, Jungck-CR, and Jungck-DK, utilizing MATLAB software. Also, we compare the impact of the initial values and the parameters on the convergence behavior of the proposed iterative process with existing iterative schemes using an example. Finally, we focus on using our iterative technique to approximate the solution of a non-linear integral equation with two delays.

在双曲空间的背景下,我们的研究提出了一种新颖的迭代方法,用于逼近满足一般收缩条件(涉及一对具有弱相容性的映射)的公共定点。此外,我们还注意到,如果弱相容性条件被违反,我们的迭代过程会逼近到一个重合点。我们提供了定理来证明这个迭代过程的收敛性、稳定性和效率。此外,我们还提供了一些涉及具有收缩条件而非一般收缩条件的映射的直接推论。此外,我们还利用 MATLAB 软件,用实例和图表说明了我们的迭代过程比以前所有的程序都要快,包括 Jungck-SP、Jungck-CR 和 Jungck-DK。此外,我们还通过一个例子,比较了初始值和参数对建议的迭代过程与现有迭代方案收敛行为的影响。最后,我们将重点讨论如何利用我们的迭代技术来近似求解一个有两个延迟的非线性积分方程。
{"title":"An efficient iterative procedure in hyperbolic space and application to non-linear delay integral equation","authors":"Khairul Habib Alam, Yumnam Rohen","doi":"10.1007/s12190-024-02134-z","DOIUrl":"https://doi.org/10.1007/s12190-024-02134-z","url":null,"abstract":"<p>In the context of hyperbolic spaces, our study presents a novel iterative approach for approximating common fixed points satisfying general contractive condition involving a pair of mappings with weak compatibility. Also, we notice that our iterative procedure approximates to a point of coincidence if the weak compatibility condition is violated. We provide theorems to demonstrate the <span>(Delta -)</span>convergence, stability, and efficiency of this iteration process. Additionally, we provided some immediate corollaries that involve mappings with contractive condition, instead of general contractive condition. Furthermore, we demonstrate with examples and graphs that our iteration process is faster than all previous procedures, including those of Jungck-SP, Jungck-CR, and Jungck-DK, utilizing MATLAB software. Also, we compare the impact of the initial values and the parameters on the convergence behavior of the proposed iterative process with existing iterative schemes using an example. Finally, we focus on using our iterative technique to approximate the solution of a non-linear integral equation with two delays.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141171204","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An inertial Dai-Liao conjugate method for convex constrained monotone equations that avoids the direction of maximum magnification 避开最大放大方向的凸约束单调方程的惯性戴廖共轭法
IF 2.2 3区 数学 Q1 Mathematics Pub Date : 2024-05-27 DOI: 10.1007/s12190-024-02123-2
Jamilu Sabi’u, Sekson Sirisubtawee

This paper exploits the good features of the Dai-Liao (DL) conjugate gradient (CG) method in connection with the inertial interpolation and the projection technique to propose an efficient algorithm for solving the convex-constrained monotone system by avoiding the direction of maximum magnification (MM). It is well-known that if the gradient lies in the direction of MM by the search direction matrix, the algorithm may result in unnecessary computational errors and may likely not be convergent. Avoiding this direction will accelerate the convergence of the proposed algorithm theoretically and numerically. The proposed DL algorithm avoids the direction of MM and uses the inertial extrapolation and hyperplane projection steps to accelerate its convergence at every given iteration. The theoretical analysis proved that the proposed algorithm is globally convergent under some standard assumptions and has a linear convergence rate. Lastly, the numerical experiment on some test problems demonstrated that the algorithm is time-efficient and has less computational cost.

本文利用戴辽(DL)共轭梯度(CG)方法的良好特性,结合惯性插值和投影技术,提出了一种避开最大放大(MM)方向求解凸约束单调系统的高效算法。众所周知,如果梯度位于搜索方向矩阵的 MM 方向,算法可能会产生不必要的计算误差,而且很可能无法收敛。避开这一方向将从理论和数值上加速所提算法的收敛。所提出的 DL 算法避开了 MM 的方向,并利用惯性外推和超平面投影步骤来加快每次给定迭代的收敛速度。理论分析证明,在一些标准假设下,所提出的算法是全局收敛的,并且具有线性收敛率。最后,对一些测试问题的数值实验证明,该算法省时高效,计算成本较低。
{"title":"An inertial Dai-Liao conjugate method for convex constrained monotone equations that avoids the direction of maximum magnification","authors":"Jamilu Sabi’u, Sekson Sirisubtawee","doi":"10.1007/s12190-024-02123-2","DOIUrl":"https://doi.org/10.1007/s12190-024-02123-2","url":null,"abstract":"<p>This paper exploits the good features of the Dai-Liao (DL) conjugate gradient (CG) method in connection with the inertial interpolation and the projection technique to propose an efficient algorithm for solving the convex-constrained monotone system by avoiding the direction of maximum magnification (MM). It is well-known that if the gradient lies in the direction of MM by the search direction matrix, the algorithm may result in unnecessary computational errors and may likely not be convergent. Avoiding this direction will accelerate the convergence of the proposed algorithm theoretically and numerically. The proposed DL algorithm avoids the direction of MM and uses the inertial extrapolation and hyperplane projection steps to accelerate its convergence at every given iteration. The theoretical analysis proved that the proposed algorithm is globally convergent under some standard assumptions and has a linear convergence rate. Lastly, the numerical experiment on some test problems demonstrated that the algorithm is time-efficient and has less computational cost.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141171082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Separate families of fuzzy dominated nonlinear operators with applications 模糊占优非线性算子分离族及其应用
IF 2.2 3区 数学 Q1 Mathematics Pub Date : 2024-05-27 DOI: 10.1007/s12190-024-02133-0
Tahair Rasham

This paper presents novel fixed-point results for two distinct families of fuzzy-dominated operators satisfying a generalized nonlinear contraction condition on a closed ball in a complete strong b-metric-like space. Our research introduces innovative fixed-point theorems for separate families of ordered fuzzy-dominated mappings in ordered complete strong b-metric-like spaces. Two different kinds of mappings are used in our methodology: a class of fuzzy-dominated mappings and a class of strictly non-decreasing mappings. Furthermore, we establish new fixed-point results for fuzzy-graph-dominated contractions. To substantiate our findings, we provide both rigorous and illustrative examples. We demonstrate the uniqueness of our results by applying them to obtain common solutions for fractional differential equations and fuzzy Volterra integral equations.

本文针对两个不同的模糊支配算子族提出了新的定点结果,这两个算子族满足完整的强 b-metric-like空间中封闭球上的广义非线性收缩条件。我们的研究为有序完整强 b-metric-like空间中的有序模糊支配映射的不同系列引入了创新的定点定理。我们的方法使用了两类不同的映射:一类是模糊支配映射,另一类是严格非递减映射。此外,我们还为模糊图主导收缩建立了新的定点结果。为了证实我们的发现,我们提供了严谨的示例。我们通过应用这些结果来获得分数微分方程和模糊 Volterra 积分方程的公共解,从而证明了我们结果的唯一性。
{"title":"Separate families of fuzzy dominated nonlinear operators with applications","authors":"Tahair Rasham","doi":"10.1007/s12190-024-02133-0","DOIUrl":"https://doi.org/10.1007/s12190-024-02133-0","url":null,"abstract":"<p>This paper presents novel fixed-point results for two distinct families of fuzzy-dominated operators satisfying a generalized nonlinear contraction condition on a closed ball in a complete strong b-metric-like space. Our research introduces innovative fixed-point theorems for separate families of ordered fuzzy-dominated mappings in ordered complete strong b-metric-like spaces. Two different kinds of mappings are used in our methodology: a class of fuzzy-dominated mappings and a class of strictly non-decreasing mappings. Furthermore, we establish new fixed-point results for fuzzy-graph-dominated contractions. To substantiate our findings, we provide both rigorous and illustrative examples. We demonstrate the uniqueness of our results by applying them to obtain common solutions for fractional differential equations and fuzzy Volterra integral equations.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141171325","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Boubaker operational matrix method for solving fractional weakly singular two-dimensional partial Volterra integral equation 求解分数弱奇异二维偏 Volterra 积分方程的 Boubaker 运算矩阵法
IF 2.2 3区 数学 Q1 Mathematics Pub Date : 2024-05-25 DOI: 10.1007/s12190-024-02138-9
A. A. Khajehnasiri, A. Ebadian

The aim of the present paper is to suggest a novel technique based on the operational matrix approach for solving a fractional weakly singular two-dimensional partial Volterra integral equation (FWS2DPVIE) using numerical methods. In this technique, Boubaker polynomials are used to create operational matrices. The technique consists of two major phases. In the first step, Boubaker polynomials are employed to generate operational matrices, which help in transforming the problems into systems of algebraic equations. In the second step, the algebraic equations are numerically solved.The suggested technique is also compared with existing approaches. The results show that the suggested technique outperforms its counterparts, demonstrating its superiority.

本文旨在提出一种基于运算矩阵方法的新技术,利用数值方法求解分式弱奇异二维偏伏特拉积分方程(FWS2DPVIE)。在该技术中,布贝克多项式被用来创建运算矩阵。该技术包括两个主要阶段。第一步,利用布贝克多项式生成运算矩阵,帮助将问题转化为代数方程系统。第二步,对代数方程进行数值求解。结果表明,建议的技术优于同类技术,显示了其优越性。
{"title":"Boubaker operational matrix method for solving fractional weakly singular two-dimensional partial Volterra integral equation","authors":"A. A. Khajehnasiri, A. Ebadian","doi":"10.1007/s12190-024-02138-9","DOIUrl":"https://doi.org/10.1007/s12190-024-02138-9","url":null,"abstract":"<p>The aim of the present paper is to suggest a novel technique based on the operational matrix approach for solving a fractional weakly singular two-dimensional partial Volterra integral equation (FWS2DPVIE) using numerical methods. In this technique, Boubaker polynomials are used to create operational matrices. The technique consists of two major phases. In the first step, Boubaker polynomials are employed to generate operational matrices, which help in transforming the problems into systems of algebraic equations. In the second step, the algebraic equations are numerically solved.The suggested technique is also compared with existing approaches. The results show that the suggested technique outperforms its counterparts, demonstrating its superiority.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141149957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Improved digraph and matrix assessment model using bipolar fuzzy numbers 利用双极模糊数改进数字图和矩阵评估模型
IF 2.2 3区 数学 Q1 Mathematics Pub Date : 2024-05-24 DOI: 10.1007/s12190-024-02125-0
Fariha Zafar, Musavarah Sarwar, Iqra Abdul Majeed, Soha Javed, Nauman Riaz Chaudary
{"title":"Improved digraph and matrix assessment model using bipolar fuzzy numbers","authors":"Fariha Zafar, Musavarah Sarwar, Iqra Abdul Majeed, Soha Javed, Nauman Riaz Chaudary","doi":"10.1007/s12190-024-02125-0","DOIUrl":"https://doi.org/10.1007/s12190-024-02125-0","url":null,"abstract":"","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141098729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Deciphering two-dimensional calcium fractional diffusion of membrane flux in neuron 解密神经元膜通量的二维钙分数扩散
IF 2.2 3区 数学 Q1 Mathematics Pub Date : 2024-05-24 DOI: 10.1007/s12190-024-02115-2
Vora Hardagna Vatsal, Brajesh Kumar Jha, Tajinder Pal Singh

Calcium is a decisive messenger for neuronal vivid functions. The calcium intracellular sequestering major unit is the Endoplasmic Reticulum (ER). Brownian motion of calcium could be bound to different buffers like S100B, calmodulin, etc, and different organelles. Plasma membrane channels like voltage-gated calcium channels (VGCC) and Plasma Membrane Calcium ATPase (PMCA), Orai channel could perturb the calcium concentration. To investigate the calcium interplay for intracellular signaling we have developed the two-dimensional time fractional reaction–diffusion equation. To solve this model analytically, we have used the Laplace and Fourier cosine integral transform method. By using Green’s function we obtained the compact solution in closed form with Mainardi’s function and Wright’s function. Uniqueness and existence proved the more fundamental approach to the fractional reaction–diffusion problem. The fractional Caputo approach gives better insight into this real-life problem by its nonlocal nature. Significant effects of different parameters on free calcium ions were obtained and the results are interpreted with normal and Alzheimeric cells. Non-local property and dynamical aspects are graphically presented which might provide insight into the Stromal interaction molecule (STIM) and S100B parameters.

钙是神经元生动功能的决定性信使。钙在细胞内的主要储存单位是内质网(ER)。钙的布朗运动可与不同的缓冲剂(如 S100B、钙调素等)和不同的细胞器结合。电压门控钙通道(VGCC)、质膜钙ATP酶(PMCA)、Orai通道等质膜通道可扰动钙浓度。为了研究钙离子在细胞内信号传递中的相互作用,我们建立了二维时间分数反应-扩散方程。为了对这一模型进行分析求解,我们使用了拉普拉斯和傅立叶余弦积分变换方法。通过使用格林函数,我们得到了与 Mainardi 函数和 Wright 函数闭合形式的紧凑解。唯一性和存在性证明了分数反应扩散问题更基本的方法。分数卡普托方法的非局域性使其能更好地洞察这一现实问题。研究获得了不同参数对游离钙离子的显著影响,并用正常细胞和阿尔茨海默氏症细胞对结果进行了解释。非局部特性和动态方面以图表形式呈现,这可能有助于深入了解基质相互作用分子(STIM)和 S100B 参数。
{"title":"Deciphering two-dimensional calcium fractional diffusion of membrane flux in neuron","authors":"Vora Hardagna Vatsal, Brajesh Kumar Jha, Tajinder Pal Singh","doi":"10.1007/s12190-024-02115-2","DOIUrl":"https://doi.org/10.1007/s12190-024-02115-2","url":null,"abstract":"<p>Calcium is a decisive messenger for neuronal vivid functions. The calcium intracellular sequestering major unit is the Endoplasmic Reticulum (ER). Brownian motion of calcium could be bound to different buffers like S100B, calmodulin, etc, and different organelles. Plasma membrane channels like voltage-gated calcium channels (VGCC) and Plasma Membrane Calcium ATPase (PMCA), Orai channel could perturb the calcium concentration. To investigate the calcium interplay for intracellular signaling we have developed the two-dimensional time fractional reaction–diffusion equation. To solve this model analytically, we have used the Laplace and Fourier cosine integral transform method. By using Green’s function we obtained the compact solution in closed form with Mainardi’s function and Wright’s function. Uniqueness and existence proved the more fundamental approach to the fractional reaction–diffusion problem. The fractional Caputo approach gives better insight into this real-life problem by its nonlocal nature. Significant effects of different parameters on free calcium ions were obtained and the results are interpreted with normal and Alzheimeric cells. Non-local property and dynamical aspects are graphically presented which might provide insight into the Stromal interaction molecule (STIM) and S100B parameters.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141149910","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Stability and bifurcation analysis of a population dynamic model with Allee effect via piecewise constant argument method 用片断常数参数法分析具有阿利效应的种群动态模型的稳定性和分岔问题
IF 2.2 3区 数学 Q1 Mathematics Pub Date : 2024-05-24 DOI: 10.1007/s12190-024-02119-y
Parvaiz Ahmad Naik, Yashra Javaid, Rizwan Ahmed, Z. Eskandari, Abdul Hamid Ganie
{"title":"Stability and bifurcation analysis of a population dynamic model with Allee effect via piecewise constant argument method","authors":"Parvaiz Ahmad Naik, Yashra Javaid, Rizwan Ahmed, Z. Eskandari, Abdul Hamid Ganie","doi":"10.1007/s12190-024-02119-y","DOIUrl":"https://doi.org/10.1007/s12190-024-02119-y","url":null,"abstract":"","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141102033","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Strong stochastic flocking with noise under long-range fat tail communication 长程胖尾通信下带有噪声的强随机成群效应
IF 2.2 3区 数学 Q1 Mathematics Pub Date : 2024-05-24 DOI: 10.1007/s12190-024-02128-x
Rundong Zhao, Yicheng Liu, Xiao Wang, Xuying Xiong

Consider the reality that flocking behavior is affected by random noise. We study the Cucker–Smale-type systems with multiplicative noise where the communication weight satisfies the long-range fat tail condition. By comparing with the related deterministic system, we show that the noise intensity of the stochastic system mainly affects the convergence speed of the flocking. Specifically, we demonstrate that the system can achieve a stochastic finite-time flocking when the noise intensity is small, and almost surely asymptotic flocking when the noise intensity is large. Some numerical simulations are given to show our theoretical results. In addition, the method in this work can improve the results of previous studies.

考虑到羊群行为受随机噪声影响的现实。我们研究了具有乘法噪声的 Cucker-Smale 型系统,其中通信权重满足长程胖尾条件。通过与相关的确定性系统比较,我们发现随机系统的噪声强度主要影响成群行为的收敛速度。具体地说,我们证明了当噪声强度较小时,系统可以实现随机有限时间成群,而当噪声强度较大时,系统几乎可以实现渐近成群。我们给出了一些数值模拟来说明我们的理论结果。此外,本文的方法还能改进以往的研究结果。
{"title":"Strong stochastic flocking with noise under long-range fat tail communication","authors":"Rundong Zhao, Yicheng Liu, Xiao Wang, Xuying Xiong","doi":"10.1007/s12190-024-02128-x","DOIUrl":"https://doi.org/10.1007/s12190-024-02128-x","url":null,"abstract":"<p>Consider the reality that flocking behavior is affected by random noise. We study the Cucker–Smale-type systems with multiplicative noise where the communication weight satisfies the long-range fat tail condition. By comparing with the related deterministic system, we show that the noise intensity of the stochastic system mainly affects the convergence speed of the flocking. Specifically, we demonstrate that the system can achieve a stochastic finite-time flocking when the noise intensity is small, and almost surely asymptotic flocking when the noise intensity is large. Some numerical simulations are given to show our theoretical results. In addition, the method in this work can improve the results of previous studies.\u0000</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141149955","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Journal of Applied Mathematics and Computing
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1