Computational and Applied Mathematics最新文献_第2页

Approximation and optimal control for variational–hemivariational inequalities of Bingham type fluid 宾厄姆型流体变分-半变量不等式的逼近和优化控制

IF 2.6 3区数学

Computational and Applied Mathematics Pub Date : 2024-09-12 DOI: 10.1007/s40314-024-02787-3

Zakaria Faiz, Hicham Benaissa

引用次数: 0

Assessment of learning management systems based on Schweizer–Sklar picture fuzzy Maclaurin symmetric mean aggregation operators 基于 Schweizer-Sklar 图片模糊 Maclaurin 对称均值聚合算子的学习管理系统评估

IF 2.6 3区数学

Computational and Applied Mathematics Pub Date : 2024-09-12 DOI: 10.1007/s40314-024-02864-7

Harish Garg, Amir Hussain, Kifayat Ullah, Ansa Ashraf

引用次数: 0

Convergence properties of Durrmeyer-type sampling operators 杜尔迈耶型抽样算子的收敛特性

IF 2.6 3区数学

Computational and Applied Mathematics Pub Date : 2024-09-11 DOI: 10.1007/s40314-024-02918-w

Vaibhav Sharma, Vijay Gupta

引用次数: 0

An optimal order $$H^{1}$$ -Galerkin mixed finite element method for good Boussinesq equation 布西内斯克方程的最优阶 $$H^{1}$$ -Galerkin 混合有限元法

IF 2.6 3区数学

Computational and Applied Mathematics Pub Date : 2024-09-10 DOI: 10.1007/s40314-024-02914-0

L. Jones Tarcius Doss, V. Jenish Merlin

引用次数: 0

A new multi-ideal nano-topological model via neighborhoods for diagnosis and cure of dengue 通过邻域建立用于诊断和治疗登革热的新型多理想纳米拓扑模型

IF 2.6 3区数学

Computational and Applied Mathematics Pub Date : 2024-09-09 DOI: 10.1007/s40314-024-02910-4

Kamalpreet Kaur, Asha Gupta, Tareq M. Al-shami, M. Hosny

引用次数: 0

High order stable numerical algorithms for generalized time-fractional deterministic and stochastic telegraph models 广义时间分数确定性和随机电报模型的高阶稳定数值算法

IF 2.6 3区数学

Computational and Applied Mathematics Pub Date : 2024-09-09 DOI: 10.1007/s40314-024-02900-6

Anant Pratap Singh, Priyanka Rajput, Rahul Kumar Maurya, Vineet Kumar Singh

{"title":"High order stable numerical algorithms for generalized time-fractional deterministic and stochastic telegraph models","authors":"Anant Pratap Singh, Priyanka Rajput, Rahul Kumar Maurya, Vineet Kumar Singh","doi":"10.1007/s40314-024-02900-6","DOIUrl":"https://doi.org/10.1007/s40314-024-02900-6","url":null,"abstract":"The aim of this manuscript is to design and analyze a hybrid stable numerical algorithm for generalized fractional derivative (GFD) defined in Caputo sense (mathscr {D}^{alpha }_{0, Z,omega }) on non-uniform grid points in the temporal direction. An efficient and hybrid high order discretization is proposed for GFD by incorporating a ((3 - alpha ))-th order approximation using the moving refinement grid method for the initial interval in the temporal direction. The physical applications of the developed high order approximation are employed to design a hybrid numerical algorithm to determine the solution of the generalized time-fractional telegraph equation (GTFTE) and the generalized time-fractional stochastic telegraph equation (GTFSTE). The proposed numerical techniques are subjected to rigorous error analysis and a thorough investigation of theoretical results i.e. solvability, unconditional stability, convergence analysis, and comparative study are conducted with the existing scheme (Kumar et al. in Numer Methods Partial Differ Equ 35(3):1164–1183, 2019). Several test functions are utilized to verify that second-order convergence is attained in time which is higher than the order of convergence produced by the existing scheme (Kumar et al. 2019). In spatial direction, fourth-order convergence is obtained utilising the compact finite difference methods in spatial approximation on uniform meshes. A reduced first-order convergence in the temporal direction is reported for the GTFSTE model. Further, certain scaling and weight functions are used to show cast the impact of scaling and weight functions in the GFD.","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"53 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142178066","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

A note on (local) energy of a graph 关于图形（局部）能量的说明

IF 2.6 3区数学

Computational and Applied Mathematics Pub Date : 2024-09-09 DOI: 10.1007/s40314-024-02916-y

B. R. Rakshith, Kinkar Chandra Das

{"title":"A note on (local) energy of a graph","authors":"B. R. Rakshith, Kinkar Chandra Das","doi":"10.1007/s40314-024-02916-y","DOIUrl":"https://doi.org/10.1007/s40314-024-02916-y","url":null,"abstract":"Let G be a simple graph with vertex set (V(G),(|V(G)|=n)) and let (Ssubseteq V(G)). We denote by (d_{i}), the degree of the vertex (v_{i}). The graph (G^{S}) is obtained from G by removing all the vertices belonging to S (If (S={v_j}), then (G^S) is denoted by (G^{(j)})). The energy of G is the sum of all absolute values of the eigenvalues of the adjacency matrix A(G) and is denoted by ({mathcal {E}}(G)). Recently, Espinal and Rada (MATCH Commun Math Comput Chem 92(1):89–103, 2024) introduced the concept of local energy of a graph e(G). It is defined as (e(G)=sum ^n_{j=1},mathcal {E}_{G}(v _j)), where (mathcal {E}_{G}(v_j)=mathcal {E}(G)-mathcal {E}(G^{(j)})) is called the local energy of a graph G at vertex (v_j). In this paper, we prove that if (v_{1}in S) and S is a vertex independent set of size k such that every vertex in S share the same open neighborhood set (N_{G}(v_{1})), then (mathcal {E}(G)-mathcal {E}(G^{S})le 2,sqrt{k,d_{1}}). We also characterize graphs that satisfy the equality case. If (S={v_{1}}), we get (mathcal {E}(G)-mathcal {E}(G^{(1)})le 2,sqrt{d_{1}}) Espinal and Rada (MATCH Commun Math Comput Chem 92(1):89–103, 2024). One of the open problems in the study of local energy of a graph is to characterize graphs with (e(G)=2mathcal {E}(G)). Motivated by this problem, we present an infinite class of graphs for which (e(G)<2mathcal {E}(G)). As a result, we show that for a complete multipartite graph G, (e(G)=2mathcal {E}(G)) if and only if (Gcong K_{2}). We also prove that the local energy of a complete multipartite graph G is constant at each vertex of the graph if and only if G is regular. Finally, we give an upper bound on e(G) in terms of n and chromatic number k.","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"14 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142178068","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

A new fixed point iterative method for solving tensor absolute value equation 求解张量绝对值方程的新定点迭代法

IF 2.6 3区数学

Computational and Applied Mathematics Pub Date : 2024-09-06 DOI: 10.1007/s40314-024-02913-1

Xin-Mei Lv, Shu-Xin Miao

引用次数: 0

Fuzzy implications and coimplications on the poset of closed intervals 封闭区间正集上的模糊蕴涵与共蕴涵

IF 2.6 3区数学

Computational and Applied Mathematics Pub Date : 2024-09-06 DOI: 10.1007/s40314-024-02906-0

Juan Dai, Yexing Dan, Xiaodong Pan

引用次数: 0

New constructions of MSRD codes MSRD 代码的新结构