Computational and Applied Mathematics最新文献

筛选
英文 中文
Numerical restorability of parameter values of space-time fractional soil consolidation model 时空分数土壤固结模型参数值的数值复原性
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-08-03 DOI: 10.1007/s40314-024-02845-w
Vsevolod Bohaienko
{"title":"Numerical restorability of parameter values of space-time fractional soil consolidation model","authors":"Vsevolod Bohaienko","doi":"10.1007/s40314-024-02845-w","DOIUrl":"https://doi.org/10.1007/s40314-024-02845-w","url":null,"abstract":"<p>At present, a large number of fractional differential models of migration processes in soils are developed. Their practical application largely depends on the possibility to determine the values of their parameters. In this regard, we study the possibility of recovering the values of parameters for one such generalized model from noised data in order to assess the threshold of measurement accuracy, beyond which the complication of a model leads to an inability to distinguish its solutions from the solutions of simpler models. We consider the 1D fractional-order model of water head dissipation in water-saturated soil with linear deformation that includes the Caputo–Fabrizio derivative with respect to the time variable and the Riemann–Liouville derivative with respect to the space variable. Direct problems for this model are proposed to be solved by an optimized computational procedure based on a finite-difference scheme. Inverse problems of model’s parameter identification are solved using a multi-threaded Particle Swarm Optimization technique. The results of computational experiments showed that the values of model parameters can be restored with less than <span>(10%)</span> relative error for the number of input water head values equal to 1000 and the level of noise less than <span>(5%)</span>. Our results also show that the order of the Riemann–Liouville derivative can be with an average relative error of less than <span>(3%)</span> restored even at <span>(10%)</span> level of noise and 40 input values, when the accuracy of other parameters’ restoration drops significantly.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"45 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141944486","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
Lower bound for the Sombor index of trees with a given total domination number 具有给定总支配数的树木的松博指数下限
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-08-03 DOI: 10.1007/s40314-024-02871-8
Xiaoling Sun, Jianwei Du, Yinzhen Mei
{"title":"Lower bound for the Sombor index of trees with a given total domination number","authors":"Xiaoling Sun, Jianwei Du, Yinzhen Mei","doi":"10.1007/s40314-024-02871-8","DOIUrl":"https://doi.org/10.1007/s40314-024-02871-8","url":null,"abstract":"<p>Recently, finding extremal structures of graphs on Sombor index has received a lot of attention. The Sombor (<i>SO</i>) index of a graph <i>G</i> is defined by the sum of weights <span>(sqrt{deg_{G}(u)^{2}+deg_{G}(v)^{2}})</span> over all edges <i>uv</i> of <i>G</i>, where <span>(deg_{G}(u))</span> stands for the degree of vertex <i>u</i> in <i>G</i>. In this article, we obtain a lower bound on Sombor index of trees with a given order and total domination number, and characterize the trees achieving the bound.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"81 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141886399","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
Lie symmetry analysis of time fractional nonlinear partial differential equations in Hilfer sense 希尔费意义上的时间分数非线性偏微分方程的列对称分析
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-08-02 DOI: 10.1007/s40314-024-02849-6
Reetha Thomas, T. Bakkyaraj
{"title":"Lie symmetry analysis of time fractional nonlinear partial differential equations in Hilfer sense","authors":"Reetha Thomas, T. Bakkyaraj","doi":"10.1007/s40314-024-02849-6","DOIUrl":"https://doi.org/10.1007/s40314-024-02849-6","url":null,"abstract":"<p>We derive the prolongation formula of the one-parameter Lie point transformations to the Hilfer fractional derivative and show that the existing prolongation formula for the Riemann Liouville and Caputo fractional derivatives are special cases of the proposed formula, corresponding to the type parameter <span>(gamma =0)</span> and <span>(gamma =1)</span>, respectively. The applicability of the proposed formula is demonstrated by deriving the Lie point symmetries of the time-fractional heat equation, the fractional Burgers equation, and the fractional KdV equation in Hilfer’s sense. We use the obtained Lie point symmetries to find the similarity variables and transformations. Using the similarity transformations, we show that each is converted into a nonlinear fractional ordinary differential equation with a new independent variable. The fractional derivative in the reduced equation can be either the Hilfer-type modification of the Erdélyi Kober fractional derivative or the Hilfer fractional derivative itself. We demonstrate that the exact solution of the time-fractional differential equation in the Hilfer sense can be reduced to the exact solutions of the corresponding time-fractional differential equations in the Riemann–Liouville and Caputo senses by setting the type parameter to <span>(gamma =0)</span> and <span>(gamma =1)</span>, respectively.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"366 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141886330","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
Incremental quaternion singular value decomposition and its application for low rank quaternion matrix completion 增量四元数奇异值分解及其在低秩四元数矩阵补全中的应用
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-08-02 DOI: 10.1007/s40314-024-02874-5
Yang Xu, Kaixin Gao
{"title":"Incremental quaternion singular value decomposition and its application for low rank quaternion matrix completion","authors":"Yang Xu, Kaixin Gao","doi":"10.1007/s40314-024-02874-5","DOIUrl":"https://doi.org/10.1007/s40314-024-02874-5","url":null,"abstract":"<p>Computing the optimal low rank approximations of quaternion matrices is the key target in many quaternion matrix related problems including color images inpainting and recognition, which can be reconstructed by some dominant singular values of quaternion matrices. However, the singular value decomposition of large-scale quaternion matrices requires expensive storage and computational costs. In this paper, we propose an incremental quaternion singular value decomposition (IQSVD) method for a class of quaternion matrices, where the number of columns far exceeds the number of rows, to improve computing efficiency. What’s more, based on IQSVD, we consider the low rank quaternion matrix completion problem and design a proximal linearized minimization algorithm with convergence guarantee to solve it. Numerical experiments on synthetic data and real-world videos illustrate the efficiency of IQSVD and the proposed proximal linearized minimization algorithm involved IQSVD.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"21 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141886329","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
MPCA and MDA via Einstein product MPCA 和 MDA 通过爱因斯坦产品
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-08-02 DOI: 10.1007/s40314-024-02866-5
Aoulaia Andahmou
{"title":"MPCA and MDA via Einstein product","authors":"Aoulaia Andahmou","doi":"10.1007/s40314-024-02866-5","DOIUrl":"https://doi.org/10.1007/s40314-024-02866-5","url":null,"abstract":"<p>This work deals with the problem of multilinear principal component analysis (MPCA) and multilinear discriminant analysis (MDA), that solve for a tensor to tensor projection (TTP) using Einstein product. MPCA and MDA are considered as a higher-order extension of principal component analysis (PCA ) and linear discriminant analysis (LDA), respectively. MPCA seeks to find a low-dimensional representation that captures most of the variation present in the original data tensor. Whereas MDA seeks to find discriminative features that maximize the separation between classes, while preserving the multilinear structure. Specifically, we are interested in finding a projective tensor that maps the original data tensor onto a new lower-dimensional subspace. In this paper, we propose to solve the MPCA problem by employing the global Lanczos procedure via Einstein product for a fourth-order tensor, while solving the MDA problem by combining Newton method and global tensorial Lanczos method. The numerical experiments illustrate the use of these algorithms for face recognition problems, compression and classification.\u0000</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"57 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141886397","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
The degree-distance and transmission-adjacency matrices 度距矩阵和传输捷径矩阵
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-08-02 DOI: 10.1007/s40314-024-02870-9
Carlos A. Alfaro, Octavio Zapata
{"title":"The degree-distance and transmission-adjacency matrices","authors":"Carlos A. Alfaro, Octavio Zapata","doi":"10.1007/s40314-024-02870-9","DOIUrl":"https://doi.org/10.1007/s40314-024-02870-9","url":null,"abstract":"<p>Let <i>G</i> be a connected graph with adjacency matrix <i>A</i>(<i>G</i>) and distance matrix <i>D</i>(<i>G</i>). Let <span>({{,textrm{dist},}}(u,v))</span> denote the distance between the pair of vertices <span>(u,vin V(G))</span>, then the transmission <span>({{,textrm{trs},}}(u))</span> of vertex <i>u</i> is defined as <span>(sum _{vin V(G)}{{,textrm{dist},}}(u,v))</span>. Let <span>({{,textrm{trs},}}(G))</span> be the diagonal matrix whose diagonal elements are the transmissions of the vertices of <i>G</i>. And, let <span>(deg (G))</span> be the diagonal matrix whose diagonal elements are the degrees of the vertices of <i>G</i>. In this paper we investigate the Smith normal form (SNF) and the spectrum of the matrices <span>(D^{deg }_+(G):=deg (G)+D(G))</span>, <span>(D^{deg }(G):=deg (G)-D(G))</span>, <span>(A^{{{,textrm{trs},}}}_+(G):={{,textrm{trs},}}(G)+A(G))</span> and <span>(A^{{{,textrm{trs},}}}(G):={{,textrm{trs},}}(G)-A(G))</span>. In particular, we explore how good the SNF and the spectrum of these matrices are for determining graphs up to isomorphism. We found that the SNF of <span>(A^{{{,textrm{trs},}}})</span> has an interesting behaviour when compared with other classical matrices. We note that the SNF of <span>(A^{{{,textrm{trs},}}})</span> can be used to compute the structure of the sandpile group of certain graphs. We compute the SNF of <span>(D^{deg }_+)</span>, <span>(D^{deg })</span>, <span>(A^{{{,textrm{trs},}}}_+)</span> and <span>(A^{{{,textrm{trs},}}})</span> for several graph families. We prove that the SNF of <span>(D^{deg }_+)</span>, <span>(D^{deg })</span>, <span>(A^{{{,textrm{trs},}}}_+)</span> and <span>(A^{{{,textrm{trs},}}})</span> determine complete graphs. Finally, we derive some results about the spectrum of <span>(D^{deg })</span> and <span>(A^{{{,textrm{trs},}}})</span>.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"19 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141886328","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
Deformation of surfaces along curves and their applications 曲面沿曲线变形及其应用
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-08-02 DOI: 10.1007/s40314-024-02857-6
Dae Won Yoon, Hyun Chol Lee
{"title":"Deformation of surfaces along curves and their applications","authors":"Dae Won Yoon, Hyun Chol Lee","doi":"10.1007/s40314-024-02857-6","DOIUrl":"https://doi.org/10.1007/s40314-024-02857-6","url":null,"abstract":"<p>The connections between parameter surfaces enable the development of various geometric designs. However, these surfaces are generally connected along their boundaries in a rectangular domain. This study investigated the methods for connecting surfaces along a curve. To this end, we introduced two-variable degenerate functions and utilized their algebraic properties to characterize the form of the parameter surfaces for practical surface construction. The results were used to deform the surfaces along the curve. For application, we presented the examples of deformations using Bézier surfaces and extended them to general surfaces.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"36 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141886398","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
On the genus and crosscap two coannihilator graph of commutative rings 关于交换环的属和交叉卡普二共析图
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-08-01 DOI: 10.1007/s40314-024-02872-7
Mohd Nazim, Shabir Ahmad Mir, Nadeem Ur Rehman
{"title":"On the genus and crosscap two coannihilator graph of commutative rings","authors":"Mohd Nazim, Shabir Ahmad Mir, Nadeem Ur Rehman","doi":"10.1007/s40314-024-02872-7","DOIUrl":"https://doi.org/10.1007/s40314-024-02872-7","url":null,"abstract":"<p>Consider a commutative ring with unity denoted as <span>(mathscr {R})</span>, and let <span>(W(mathscr {R}))</span> represent the set of non-unit elements in <span>(mathscr {R})</span>. The coannihilator graph of <span>(mathscr {R})</span>, denoted as <span>(AG'(mathscr {R}))</span>, is a graph defined on the vertex set <span>(W(mathscr {R})^*)</span>. This graph captures the relationships among non-unit elements. Specifically, two distinct vertices, <i>x</i> and <i>y</i>, are connected in <span>(AG'(mathscr {R}))</span> if and only if either <span>(x notin xymathscr {R})</span> or <span>(y notin xymathscr {R})</span>, where <span>(wmathscr {R})</span> denotes the principal ideal generated by <span>(w in mathscr {R})</span>. In the context of this paper, the primary objective is to systematically classify finite rings <span>(mathscr {R})</span> based on distinct characteristics of their coannihilator graph. The focus is particularly on cases where the coannihilator graph exhibits a genus or crosscap of two. Additionally, the research endeavors to provide a comprehensive characterization of finite rings <span>(mathscr {R})</span> for which the connihilator graph <span>(AG'(mathscr {R}))</span> attains an outerplanarity index of two.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"55 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141886327","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 second order difference scheme on a Bakhvalov-type mesh for the singularly perturbed Volterra delay-integro-differential equation 奇异扰动 Volterra 迟滞积分微分方程的巴赫瓦洛夫型网格上的二阶差分方案
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-31 DOI: 10.1007/s40314-024-02873-6
Yige Liao, Xianbing Luo, Li-Bin Liu
{"title":"A second order difference scheme on a Bakhvalov-type mesh for the singularly perturbed Volterra delay-integro-differential equation","authors":"Yige Liao, Xianbing Luo, Li-Bin Liu","doi":"10.1007/s40314-024-02873-6","DOIUrl":"https://doi.org/10.1007/s40314-024-02873-6","url":null,"abstract":"<p>In this paper, we present a second order parameter-uniform numerical method for a singularly perturbed Volterra delay-integro-differential equation on a Bakhvalov-type mesh. The equation is discretized by using the variable two-step backward differentiation formula of the first derivative term and the trapezoidal formula of the integral term. The stability and convergence of the numerical method in the discrete maximum norm are proved. Finally, the theoretical results are verified by some numerical experiments.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"130 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141869825","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
Spectrum of super commuting graphs of some finite groups 一些有限群的超交换图谱
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-30 DOI: 10.1007/s40314-024-02859-4
Sandeep Dalal, Sanjay Mukherjee, Kamal Lochan Patra
{"title":"Spectrum of super commuting graphs of some finite groups","authors":"Sandeep Dalal, Sanjay Mukherjee, Kamal Lochan Patra","doi":"10.1007/s40314-024-02859-4","DOIUrl":"https://doi.org/10.1007/s40314-024-02859-4","url":null,"abstract":"<p>Let <span>(Gamma )</span> be a simple finite graph with vertex set <span>(V(Gamma ))</span> and edge set <span>(E(Gamma ))</span>. Let <span>(mathcal {R})</span> be an equivalence relation on <span>(V(Gamma ))</span>. The <span>(mathcal {R})</span>-super <span>(Gamma )</span> graph <span>(Gamma ^{mathcal {R}})</span> is a simple graph with vertex set <span>(V(Gamma ))</span> and two distinct vertices are adjacent if either they are in the same <span>(mathcal {R})</span>-equivalence class or there are elements in their respective <span>(mathcal {R})</span>-equivalence classes that are adjacent in the original graph <span>(Gamma )</span>. We first show that <span>(Gamma ^{mathcal {R}})</span> is a generalized join of some complete graphs and using this we obtain the adjacency and Laplacian spectrum of conjugacy super commuting graphs and order super commuting graphs of dihedral group <span>(D_{2n}; (nge 3))</span>, generalized quaternion group <span>(Q_{4m} ;(mge 2))</span> and the nonabelian group <span>(mathbb {Z}_p rtimes mathbb {Z}_q)</span> of order <i>pq</i>, where <i>p</i> and <i>q</i> are distinct primes with <span>(q|(p-1))</span>.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"48 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141869827","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
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学术官方微信
小红书