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

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 代码的新结构

IF 2.6 3区数学

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

Umberto Martínez-Peñas

引用次数: 0

Higher-order methods for the Poisson equation obtained with geometric multigrid and completed Richardson extrapolation 利用几何多网格和完成理查德森外推法获得的泊松方程高阶方法

IF 2.6 3区数学

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

Luciano Pereira da Silva, Marcio Augusto Villela Pinto, Luciano Kiyoshi Araki

{"title":"Higher-order methods for the Poisson equation obtained with geometric multigrid and completed Richardson extrapolation","authors":"Luciano Pereira da Silva, Marcio Augusto Villela Pinto, Luciano Kiyoshi Araki","doi":"10.1007/s40314-024-02902-4","DOIUrl":"https://doi.org/10.1007/s40314-024-02902-4","url":null,"abstract":"The study presented in this paper consists of a grouping of methods for determining numerical solutions to the Poisson equation (heat diffusion) with high accuracy. We compare the results obtained with classical second-order finite difference method (CDS-2) with fourth-order compact (CCDS-4) and the exponential methods (EXP-4). We accelerate the convergence of the numerical solutions using the geometric multigrid method and then apply the completed Richardson extrapolation (CRE) across the full temperature field. This proposed clustering determined solutions with two orders of accuracy higher for all three methods presented in the study, in addition to recommending the EXP-4 method together with CRE for its accuracy and low computational effort. The evidence for our results was established through qualitative verification, through the assessment of orders of accuracy of the discretization error; and quantitative verification, through the analysis of CPU time and complexity order of the numerical solutions calculated. The numerical solutions of sixth-order of accuracy obtained after proposed CRE methodology using the CCDS-4 and EXP-4 methods are recognized as benchmark solutions for these two classes of methods.","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"3 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142178070","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

Lagrange synchronization of nonidentical discrete-time fractional-order quaternion-valued neural networks with time delays 具有时间延迟的非相同离散时间分数阶四元数值神经网络的拉格朗日同步化

IF 2.6 3区数学

Computational and Applied Mathematics Pub Date : 2024-09-04 DOI: 10.1007/s40314-024-02904-2

Mingfang Zhao, Hong-Li Li, Juanping Yang, Long Zhang

引用次数: 0

A finite element scheme for the Landau–Lifshitz–Bloch equation Landau-Lifshitz-Bloch 方程的有限元方案

IF 2.6 3区数学

Computational and Applied Mathematics Pub Date : 2024-09-04 DOI: 10.1007/s40314-024-02898-x

M. Benmouane, El-H. Essoufi, C. Ayouch

引用次数: 0

Perfect Italian domination on some generalizations of cographs 意大利人对某些文字概括的完美支配

IF 2.6 3区数学

Computational and Applied Mathematics Pub Date : 2024-09-02 DOI: 10.1007/s40314-024-02901-5

Kaustav Paul, Arti Pandey

{"title":"Perfect Italian domination on some generalizations of cographs","authors":"Kaustav Paul, Arti Pandey","doi":"10.1007/s40314-024-02901-5","DOIUrl":"https://doi.org/10.1007/s40314-024-02901-5","url":null,"abstract":"Given a graph (G=(V,E)), the Perfect Italian domination function is a mapping (f:Vrightarrow {0,1,2}) such that for any vertex (vin V) with f(v) equals zero, (sum _{uin N(v)}f(u)) must be two. In simpler terms, for each vertex v labeled zero, one of the following conditions must be satisfied: (1) exactly two neighbours of v are labeled 1, and every other neighbour of v is labeled zero, (2) exactly one neighbour of v is labeled 2, and every other neighbour of v is labeled zero. The weight of the function f is calculated as the sum of f(u) over all (uin V). The Perfect Italian domination problem involves finding a Perfect Italian domination function that minimizes the weight. We have devised a linear-time algorithm to solve this problem for (P_4)-sparse graphs, which represent well-established generalization of cographs. Furthermore, we have proved that the problem is efficiently solvable for distance-hereditary graphs. We have also shown that the decision version of the problem is NP-complete for 5-regular graphs and comb convex bipartite graphs.","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"9 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142177976","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

Fractional semi-infinite programming problems: optimality conditions and duality via tangential subdifferentials 分数半无限编程问题：最优条件和切向次微分的对偶性

IF 2.6 3区数学

Computational and Applied Mathematics Pub Date : 2024-09-02 DOI: 10.1007/s40314-024-02912-2

Indira P. Tripathi, Mahamadsohil A. Arora

{"title":"Fractional semi-infinite programming problems: optimality conditions and duality via tangential subdifferentials","authors":"Indira P. Tripathi, Mahamadsohil A. Arora","doi":"10.1007/s40314-024-02912-2","DOIUrl":"https://doi.org/10.1007/s40314-024-02912-2","url":null,"abstract":"In this paper, we have focused on a multi-objective fractional semi-infinite programming problems in which the constraints and objective functions are tangentially convex. A result has been established to find the tangential subdifferential of a fractional function, assuming the numerator and the negative of the denominator being tangentially convex functions. With this, optimality conditions have been derived using a non-parametric approach under (digamma )-convexity assumption. Further, a Mond–Weir type dual has been considered and weak and strong duality relations have been developed. Moreover, an application in robot trajectory planning has been considered and solved using MATLAB. In addition, considering the same trajectory as in Vaz et al. (Eur J Oper Res 153(3):607–617, 2004), we have compared the results obtained in MATLAB with the results available in Vaz et al. (Eur J Oper Res 153(3):607–617, 2004) and Haaren-Retagne (A semi-infinite programming algorithm for robot trajectory planning, 1992), where the authors have solved using AMPL. It has been observed that our results are more efficient than the previously available results, with the implementation of MATLAB as it substantially reduces the computational time. Throughout the paper, nontrivial examples have also been provided for proper justification of the theorems developed.","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"79 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142177972","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

Accelerated SVD-based initialization for nonnegative matrix factorization 基于 SVD 的非负矩阵因式分解加速初始化

IF 2.6 3区数学

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

Flavia Esposito, Syed Muhammad Atif, Nicolas Gillis

{"title":"Accelerated SVD-based initialization for nonnegative matrix factorization","authors":"Flavia Esposito, Syed Muhammad Atif, Nicolas Gillis","doi":"10.1007/s40314-024-02905-1","DOIUrl":"https://doi.org/10.1007/s40314-024-02905-1","url":null,"abstract":"Nonnegative matrix factorization (NMF) is a popular dimensionality reduction technique. NMF is typically cast as a non-convex optimization problem solved via standard iterative schemes, such as coordinate descent methods. Hence the choice of the initialization for the variables is crucial as it will influence the factorization quality and the convergence speed. Different strategies have been proposed in the literature, the most popular ones rely on singular value decomposition (SVD). In particular, Atif et al. (Pattern Recognit Lett 122:53–59, 2019) have introduced a very efficient SVD-based initialization, namely NNSVD-LRC, that overcomes the drawbacks of previous methods, namely, it guarantees that (i) the error decreases as the factorization rank increases, (ii) the initial factors are sparse, and (iii) the computational cost is low. In this paper, we improve upon NNSVD-LRC by using the low-rank structure of the residual matrix; this allows us to obtain NMF initializations with similar quality to NNSVD-LRC (in terms of error and sparsity) while reducing the computational load. We evaluate our proposed solution over other NMF initializations on several real dense and sparse datasets.","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"47 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142177977","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

Quasi-synchronization of fractional-order complex-value BAM neural networks with time delays and discontinuous activations 具有时间延迟和不连续激活的分数阶复值 BAM 神经网络的准同步化

IF 2.6 3区数学

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

Libo Wang, Guigui Xu

引用次数: 0