发布求助
文献互助 智能选刊 最新文献

Computational and Applied Mathematics最新文献

筛选
英文 中文
On convergence of a sketch-and-project method for the matrix equation $$AXB=C$$ 论矩阵方程 $$AXB=C$$ 的草图与项目方法的收敛性
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-12 DOI: 10.1007/s40314-024-02847-8
Wendi Bao, Zhiwei Guo, Weiguo Li, Ying Lv
{"title":"On convergence of a sketch-and-project method for the matrix equation $$AXB=C$$","authors":"Wendi Bao, Zhiwei Guo, Weiguo Li, Ying Lv","doi":"10.1007/s40314-024-02847-8","DOIUrl":"https://doi.org/10.1007/s40314-024-02847-8","url":null,"abstract":"<p>In this paper, based on Lagrangian functions of the optimization problem we develop a sketch-and-project method for solving the linear matrix equation <span>(AXB = C)</span> by introducing three parameters. A thorough convergence analysis on the proposed method is explored in details. A lower bound on the convergence rate and some convergence conditions are derived. By varying three parameters in the new method and convergence theorems, an array of well-known algorithms and their convergence results are recovered. Finally, numerical experiments are given to illustrate the effectiveness of recovered methods.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"42 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141610925","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
Group codes over crystallographic point groups 晶体学点群上的群编码
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-11 DOI: 10.1007/s40314-024-02810-7
Yanyan Gao, Xiaomeng Zhu
{"title":"Group codes over crystallographic point groups","authors":"Yanyan Gao, Xiaomeng Zhu","doi":"10.1007/s40314-024-02810-7","DOIUrl":"https://doi.org/10.1007/s40314-024-02810-7","url":null,"abstract":"<p>Consider a finite field <span>({mathbb {F}}_{q})</span> with characteristic <i>p</i>, where <i>G</i> is a crystallographic point group satisfying <span>(p not mid |G|)</span> and <span>(q=p^n)</span>. In this paper, we propose studying group codes in the crystallographic point group algebras <span>({mathbb {F}}_{q}G)</span> for the point groups <span>(C_{2h})</span>, <span>(C_{6v})</span>, and <span>(D_{6h})</span>. We compute the unique (linear and nonlinear) idempotents of <span>({mathbb {F}}_{q}G)</span> that correspond to the characters of the crystallographic point groups. These idempotents play a crucial role in characterizing the properties of the group codes. Based on the above results, we characterize the minimum distances and dimensions of the group codes. This provides valuable information about the error-correcting capabilities and the amount of information that can be transmitted through these codes. Furthermore, we construct MDS (Maximum Distance Separable) group codes and almost MDS group codes.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"2010 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141588646","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
Super implicit two-step collocation methods for ordinary differential equations 常微分方程的超隐式两步配位法
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-10 DOI: 10.1007/s40314-024-02848-7
L. Taheri Koltape, G. Hojjati, S. Fazeli, A. Abdi
{"title":"Super implicit two-step collocation methods for ordinary differential equations","authors":"L. Taheri Koltape, G. Hojjati, S. Fazeli, A. Abdi","doi":"10.1007/s40314-024-02848-7","DOIUrl":"https://doi.org/10.1007/s40314-024-02848-7","url":null,"abstract":"<p>This paper introduces a class of two-step collocation methods for the numerical solution of ordinary differential equations. These methods which are equipped with the future point technique and described in two types, to approximate the solution in each step, use the numerical solution in some points in the two previous subintervals as well as in the future subinterval. The superior features of the proposed methods in convergence order and stability in comparison with the similar methods are analyzed. The achieved improvements are verified by giving some numerical experiments.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"43 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141568968","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
Generalized high-order compact difference schemes for the generalized Rosenau–Burgers equation 广义罗森奥-伯格斯方程的广义高阶紧凑差分方案
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-10 DOI: 10.1007/s40314-024-02846-9
Shidong Luo, Yuyu He, Yonghui Ling
{"title":"Generalized high-order compact difference schemes for the generalized Rosenau–Burgers equation","authors":"Shidong Luo, Yuyu He, Yonghui Ling","doi":"10.1007/s40314-024-02846-9","DOIUrl":"https://doi.org/10.1007/s40314-024-02846-9","url":null,"abstract":"<p>A shallow-water wave propagation model can be described as a generalized Rosenau–Burgers equation with strong nonlinearity and high-order dispersion terms. In this paper, we propose two generalized high-order (up to eighth-order) compact finite difference schemes for solving the generalized Rosenau–Burgers equation. The first scheme is a two-level nonlinear Crank–Nicolson difference scheme and the second is a three-level linearized difference scheme. We derive the discrete mass and energy properties, and provide rigorous proofs for the boundedness, existence, and convergence with order <span>(O(tau ^2 + h^s), (s = 4, 6, 8))</span> of these proposed generalized compact difference schemes, where <span>(tau )</span> and <i>h</i> denote the time- and space-steps, respectively. Finally, the validity of the theoretical analysis is verified through numerical experiments, confirming the effectiveness of the proposed schemes.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"124 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141586814","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
Intuitionistic fuzzy muirhead means motivated by frank triangular norms 以坦率三角准则为动机的直觉模糊缪尔海德手段
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-09 DOI: 10.1007/s40314-024-02661-2
Abrar Hussain, Kifayat Ullah, Jing Zhang, Tahir Mahmood
{"title":"Intuitionistic fuzzy muirhead means motivated by frank triangular norms","authors":"Abrar Hussain, Kifayat Ullah, Jing Zhang, Tahir Mahmood","doi":"10.1007/s40314-024-02661-2","DOIUrl":"https://doi.org/10.1007/s40314-024-02661-2","url":null,"abstract":"<p>The Muirhead Mean (MM) tools are more powerful and well-known operators utilized to express interrelationships among any input arguments considering different variables. Multi-attribute decision-making (MADM) technique is used to evaluate a reliable optimal option based on some realistic characteristics or criteria. The aggregation operators (AOs) play a crucial role in the aggregating and decision-making (DM) processes. In this article, we generalize the theory of intuitionistic fuzzy sets (IFSs) with Frank t-norm and t-conorm. Some robust operational laws of Frank t-norms and t-conorms are also expressed. By inspiring the significance and advantages of the MM operators, we derive some robust mathematical approaches, including intuitionistic fuzzy Frank Muirhead mean (IFFMM) and intuitionistic fuzzy Frank weighted Muirhead mean (IFFWMM) operators. By generalizing the concepts of Dual MM (DMM) operators, we establish a list of new methodologies such as intuitionistic fuzzy Frank Dual Muirhead mean (IFFDMM) and intuitionistic fuzzy Frank weighted Dual Muirhead mean (IFFWDMM). Some prominent characteristics and exceptional cases are discussed in detail. Furthermore, an algorithm is established to evaluate a MADM problem based on derived mathematical approaches. To examine the credibility and effectiveness of diagnosed approaches, we illustrate an experimental case study to assess a suitable optimal option from a group of options. To show the intensity and effectiveness of our derived approaches, a brief discussion about a comparative study is also presented, in which we compare the results of existing approaches with diagnosed mathematical approaches.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"25 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141568967","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 concept cognitive learning in dynamic formal contexts based on attribute partial order structure diagram 基于属性偏序结构图的动态形式语境中的增量概念认知学习
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-08 DOI: 10.1007/s40314-024-02826-z
Yunli Ren, Yunxia Zhang, Wenxue Hong
{"title":"Incremental concept cognitive learning in dynamic formal contexts based on attribute partial order structure diagram","authors":"Yunli Ren, Yunxia Zhang, Wenxue Hong","doi":"10.1007/s40314-024-02826-z","DOIUrl":"https://doi.org/10.1007/s40314-024-02826-z","url":null,"abstract":"<p>Partial order formal structure analysis (POFSA) is an emerging theory in the field of concept cognitive learning (CCL). Attribute partial order structure diagram (APOSD) is the visual expression of the knowledge structure in POFSA. It has the advantages of explicit expression of the hierarchies of attributes and concise visual expression of the knowledge structure. This paper mainly focuses on the incremental CCL of APOSD in dynamic data circumstances. Firstly, the concept of location information coding of nodes in APOSD is proposed to express the position of nodes in the entire diagram as well as the relationships between nodes, which is an important tool throughout this paper. Secondly, by analyzing the relationship between new objects and objects in the original diagram, dynamic learning strategy for APOSD is proposed. Thirdly, in order to balance the efficiency and accuracy of dynamic learning, a dynamic-static alternating self-learning method for APOSD is proposed, which is an improved incremental learning strategy. Finally, comparative experiments illustrate that compared with non-incremental learning method of APOSD and concept lattice, the two proposed incremental learning methods of APOSD can effectively achieve dynamic self-updating of the knowledge base when processing dynamic data, and provide another perspective for discovering knowledge from the same data. Besides, the effectiveness of the improved incremental learning strategy is verified as well.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"38 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141568970","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
Perturbation of least squares problem of dual linear operator in dual-Hilbert spaces 对偶希尔伯特空间中对偶线性算子最小二乘问题的扰动
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-08 DOI: 10.1007/s40314-024-02823-2
Yuhang Liu, Haifeng Ma
{"title":"Perturbation of least squares problem of dual linear operator in dual-Hilbert spaces","authors":"Yuhang Liu, Haifeng Ma","doi":"10.1007/s40314-024-02823-2","DOIUrl":"https://doi.org/10.1007/s40314-024-02823-2","url":null,"abstract":"<p>We introduce the dual-Hilbert space and study the basic properties of a dual operator and its generalized inverse on this space. We provide upper bounds on the perturbation of the dual Moore–Penrose inverse of the dual operator if the dual operator is injective or surjective. If the null space or range space of the perturbed dual operator is invariant, stable perturbations are used to give the perturbation bounds for the dual Moore–Penrose inverse. Additionally, given the aforementioned conditions, perturbation bounds for the least squares solution are provided. The upper bounds on the distance between the solution of a perturbed least squares problem and the set of all of its unperturbed solutions under the dual operator norm are also presented.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"13 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141568969","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
Open problem on the maximum exponential augmented Zagreb index of unicyclic graphs 关于单环图的最大指数增强萨格勒布指数的未决问题
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-05 DOI: 10.1007/s40314-024-02815-2
Kinkar Chandra Das, Sourav Mondal, Da-yeon Huh
{"title":"Open problem on the maximum exponential augmented Zagreb index of unicyclic graphs","authors":"Kinkar Chandra Das, Sourav Mondal, Da-yeon Huh","doi":"10.1007/s40314-024-02815-2","DOIUrl":"https://doi.org/10.1007/s40314-024-02815-2","url":null,"abstract":"<p>A topological index is a numerical property of a molecular graph that explains structural features of molecules. The potential of topological indices to discriminate between distinct structures is a significant topic to investigate. In this context, the exponential degree-based indices were put forward in the literature. The present work focuses on the exponential augmented Zagreb index (<i>EAZ</i>), which is defined for a graph <i>G</i> as </p><span>$$begin{aligned} EAZ(G)=sum limits _{v_{i}v_{j} in E(G)},e^{displaystyle {left( frac{{d_i,d_j}}{d_i+d_j-2}right) ^{3}}}, end{aligned}$$</span><p>where <span>(d_i)</span> represents the degree of the vertex <span>(v_i)</span>and <i>E</i>(<i>G</i>) denotes the edge set of <i>G</i>. This work characterizes the maximal unicyclic graph for <i>EAZ</i> in terms of graph order, which was posed as an open problem in the recent article Cruz et al. (MATCH Commun Math Comput Chem 88:481-503, 2022).\u0000</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"17 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141547072","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
Properties of core-EP matrices and binary relationships 核心-EP 矩阵的特性和二元关系
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-03 DOI: 10.1007/s40314-024-02836-x
Ehsan Kheirandish, Abbas Salemi, Néstor Thome
{"title":"Properties of core-EP matrices and binary relationships","authors":"Ehsan Kheirandish, Abbas Salemi, Néstor Thome","doi":"10.1007/s40314-024-02836-x","DOIUrl":"https://doi.org/10.1007/s40314-024-02836-x","url":null,"abstract":"<p>In this paper, various properties of core-EP matrices are investigated. We introduce the MPDMP matrix associated with <i>A</i> and by means of it, some properties and equivalent conditions of core-EP matrices can be obtained. Also, properties of MPD, DMP, and CMP inverses are studied and we prove that in the class of core-EP matrices, DMP, MPD, and Drazin inverses are the same. Moreover, DMP and MPD binary relation orders are introduced and the relationship between these orders and other binary relation orders are considered.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"18 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141547070","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 fast Galerkin-spectral method based on discrete Legendre polynomials for solving parabolic differential equation 基于离散 Legendre 多项式的快速 Galerkin 频谱法求解抛物线微分方程
IF 2.6 3区 数学
Computational and Applied Mathematics Pub Date : 2024-07-03 DOI: 10.1007/s40314-024-02792-6
Arezou Rezazadeh, Majid Darehmiraki
{"title":"A fast Galerkin-spectral method based on discrete Legendre polynomials for solving parabolic differential equation","authors":"Arezou Rezazadeh, Majid Darehmiraki","doi":"10.1007/s40314-024-02792-6","DOIUrl":"https://doi.org/10.1007/s40314-024-02792-6","url":null,"abstract":"<p>The goal of this investigation is to achieve the numerical solution of a two-dimensional parabolic partial differential equation(PDE). The proposed method of this paper is based on the discrete Legendre Galerkin method and spectral collocation method to simplify the spatial derivatives and time derivatives. The discrete Galerkin method is a very fast technique compared to the classical Galerkin method since a finite sum is needed for determining the interpolation coefficients. The operational matrix of the discrete Legendre polynomials is introduced to discretize the time derivatives. Using these couple of techniques and the collocation method, the aforementioned problem is transformed into a solvable algebraic system. The results of applying this procedure to the studied cases show the high accuracy and efficiency of the new method.</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"174 1","pages":""},"PeriodicalIF":2.6,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141515149","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学术文献互助群
群 号：481959085
Book学术官方微信