Applied Mathematics and Computation最新文献

{"title":"Corrigendum to “Neural networks for bifurcation and linear stability analysis of steady states in partial differential equations” [Appl. Math. Comput. 483 (2024) 128985]","authors":"Muhammad Luthfi Shahab, Hadi Susanto","doi":"10.1016/j.amc.2025.129319","DOIUrl":"10.1016/j.amc.2025.129319","url":null,"abstract":"","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129319"},"PeriodicalIF":3.5,"publicationDate":"2025-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143077687","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Eigenvalue bounds and Perron-Frobenius theory for nonnegative or positive interval matrices","authors":"Sarishti Singh,&nbsp;Geetanjali Panda","doi":"10.1016/j.amc.2025.129329","DOIUrl":"10.1016/j.amc.2025.129329","url":null,"abstract":"<div><div>This paper introduces two classes of regular interval matrices and establishes intervals that either include or exclude the real eigenvalues of positive interval matrices. The Perron-Frobenius theory is extended to the generalized interval eigenvalue problem for nonnegative interval matrices under certain conditions. Moreover, necessary and sufficient conditions are derived for the existence of a real scalar and a positive vector that satisfy the generalized interval eigenvalue problem for nonnegative interval matrices under certain conditions.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129329"},"PeriodicalIF":3.5,"publicationDate":"2025-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143077655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The restrained double Roman domination and graph operations","authors":"Zhipeng Gao ,&nbsp;Changqing Xi ,&nbsp;Jun Yue","doi":"10.1016/j.amc.2025.129315","DOIUrl":"10.1016/j.amc.2025.129315","url":null,"abstract":"<div><div>A restrained double Roman dominating function (RDRD-function) on a graph <em>G</em> is a function <span><math><mi>f</mi><mo>:</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>→</mo><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>}</mo></math></span> that satisfies two conditions: (1) If <span><math><mi>f</mi><mo>(</mo><mi>v</mi><mo>)</mo><mo>&lt;</mo><mn>2</mn></math></span>, then <span><math><msub><mrow><mo>∑</mo></mrow><mrow><mi>u</mi><mo>∈</mo><msub><mrow><mi>N</mi></mrow><mrow><mi>G</mi></mrow></msub><mo>[</mo><mi>v</mi><mo>]</mo></mrow></msub><mi>f</mi><mo>(</mo><mi>u</mi><mo>)</mo><mo>≥</mo><mo>|</mo><mi>A</mi><msubsup><mrow><mi>N</mi></mrow><mrow><mi>G</mi></mrow><mrow><mi>f</mi></mrow></msubsup><mo>(</mo><mi>v</mi><mo>)</mo><mo>|</mo><mo>+</mo><mn>2</mn></math></span>, where <span><math><mi>A</mi><msubsup><mrow><mi>N</mi></mrow><mrow><mi>G</mi></mrow><mrow><mi>f</mi></mrow></msubsup><mo>(</mo><mi>v</mi><mo>)</mo><mo>=</mo><mo>{</mo><mi>u</mi><mo>∈</mo><msub><mrow><mi>N</mi></mrow><mrow><mi>G</mi></mrow></msub><mo>(</mo><mi>v</mi><mo>)</mo><mo>:</mo><mi>f</mi><mo>(</mo><mi>u</mi><mo>)</mo><mo>≥</mo><mn>1</mn><mo>}</mo></math></span>; (2) The subgraph induced by the vertices assigned 0 under <em>f</em> contains no isolated vertices. The weight of an RDRD-function <em>f</em> is <span><math><msub><mrow><mo>∑</mo></mrow><mrow><mi>v</mi><mo>∈</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo></mrow></msub><mi>f</mi><mo>(</mo><mi>v</mi><mo>)</mo></math></span>, and the minimum weight of an RDRD-function on <em>G</em> is defined as the restrained double Roman domination number (RDRD-number) of <em>G</em>, denoted by <span><math><msub><mrow><mi>γ</mi></mrow><mrow><mi>r</mi><mi>d</mi><mi>R</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo></math></span>. In this paper, we first establish that computing the RDRD-number is NP-hard, even for chordal graphs. Then the impact of various graph operations, including the strong product, cardinal product, and corona product, on the restrained double Roman domination number are given.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129315"},"PeriodicalIF":3.5,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143077691","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"OP-HHO based feature selection improves the performance of depression classification framework: A gender biased multiband research","authors":"Kun Li ,&nbsp;PeiYun Zhong ,&nbsp;Li Dong ,&nbsp;LingMin Wang ,&nbsp;Luo-Luo Jiang","doi":"10.1016/j.amc.2025.129317","DOIUrl":"10.1016/j.amc.2025.129317","url":null,"abstract":"<div><div>Depression, as a common yet severe mood disorder, can cause irreversible damage to the brain if not detected and treated in a timely manner. Unfortunately, due to the current limitations of medical and technological conditions, only a small number of patients have been able to receive appropriate treatment. Although the traditional Harris Hawk's Optimization (HHO) algorithm has a strong searching ability for global optima which is helpful of early diagnosis of depression, it is highly prone to getting stuck in local optima during the early iterations. In view of this, the Optimized-Parameter Harris Hawk's Optimization (OP-HHO) algorithm proposed in this study is devised by integrating an exponential decay function. This incorporation endows the algorithm with the capacity to dynamically modulate the search step size, progressively diminish the escape energy, thereby bolstering the local search capabilities and efficaciously circumventing the problem of premature convergence that may stem from overzealous global exploration. The performance of the OP-HHO was tested using 23 benchmark functions. Based on the features selected by the OP-HHO algorithm, depression classification was carried out using the K-Nearest Neighbor (KNN) algorithm in combination with the MODMA database. The accuracy rate reached 96.36% - 97.30% across different brain wave frequencies under happy stimuli, and 100% under sad stimuli. Moreover, the classification results in the overall electroencephalogram (EEG) signals also showed excellent performance. This indicates that the OP-HHO algorithm is highly effective in accurately identifying the key features of depression. Our comparative study conducted reveals the existence of gender differences, which are expected to serve as effective features to further improve the accuracy of depression classification, opening up new avenues for the development of depression diagnosis techniques.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129317"},"PeriodicalIF":3.5,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Graphs having two main eigenvalues and arbitrarily many distinct vertex degrees","authors":"Mohammad Ghebleh ,&nbsp;Salem Al-Yakoob ,&nbsp;Ali Kanso ,&nbsp;Dragan Stevanović","doi":"10.1016/j.amc.2025.129311","DOIUrl":"10.1016/j.amc.2025.129311","url":null,"abstract":"<div><div>Arif, Hayat and Khan [J Appl Math Comput 69 (2023) 2549–2571] recently proposed the problem of finding explicit construction for (an infinite family of) graphs having at least three distinct vertex degrees and two main eigenvalues. After computationally identifying small examples of such graphs, we fully solve this problem by showing that the edge-disjoint union of an almost semiregular graph <em>G</em> and a regular graph <em>H</em> defined on the constant part of <em>G</em> yields a new harmonic graph under mild conditions. As a special case, this result provides for every integer <span><math><mi>b</mi><mo>≥</mo><mn>2</mn></math></span> an explicit construction of a graph with two main eigenvalues and <span><math><mn>2</mn><mi>b</mi><mo>−</mo><mn>1</mn></math></span> distinct vertex degrees. This construction also provides partial answers to questions posed by Hayat et al. in [Linear Algebra Appl 511 (2016) 318–327].</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129311"},"PeriodicalIF":3.5,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035303","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Data-driven-based fully distributed event-triggered control for nonlinear multi-agent systems","authors":"Xiaojie Qiu ,&nbsp;Wenchao Meng ,&nbsp;Yingchun Wang ,&nbsp;Qinmin Yang","doi":"10.1016/j.amc.2025.129307","DOIUrl":"10.1016/j.amc.2025.129307","url":null,"abstract":"<div><div>This paper investigates the fully distributed control issue for nonlinear multi-agent systems (MASs) under the limited network bandwidth. A novel event-triggered MFAC framework is developed to ensure the consensus of system output signals in a fully distributed manner, in which an adaptive step-size operator is introduced to eliminate the reliance on communication topology information. To save communication resources efficiently, a dynamic event-triggered mechanism (ETM) with switch-adjustable threshold parameters and dormancy waking functions is designed. This triggering mechanism not only accelerates the convergence of consensus errors in unstable situations, but also prolongs the inter-execution time while maintaining the desired control performance. In the entire control process, only measured input/output data are utilized. Through mathematical analysis, the average consensus errors of closed-loop MASs are proven to converge to zero asymptotically. Finally, the effectiveness and superiority of the proposed method are demonstrated through simulation comparisons.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129307"},"PeriodicalIF":3.5,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035304","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A modulus-based framework for weighted horizontal linear complementarity problems","authors":"Francesco Mezzadri","doi":"10.1016/j.amc.2025.129313","DOIUrl":"10.1016/j.amc.2025.129313","url":null,"abstract":"<div><div>We develop a modulus-based framework to solve weighted horizontal linear complementarity problems (WHLCPs). First, we reformulate the WHLCP as a modulus-based system whose solution, in general, is not unique. We characterize the solutions by discussing their sign pattern and how they are linked to one another. After this analysis, we exploit the modulus-based formulation to develop new solution methods. In particular, we present a non-smooth Newton iteration and a matrix splitting method for solving WHLCPs. We prove the local convergence of both methods under some assumptions. Finally, we solve numerical experiments involving symmetric and non-symmetric matrices. In this context, we compare our approaches with a recently proposed smoothing Newton's method. The experiments include problems taken from the literature. We also provide numerical insights on relevant parts of the algorithms, such as convergence, attraction basin, and starting iterate.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129313"},"PeriodicalIF":3.5,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035317","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A note on sequences variant of irregularity strength for hypercubes","authors":"Anna Flaszczyńska,&nbsp;Aleksandra Gorzkowska,&nbsp;Mariusz Woźniak","doi":"10.1016/j.amc.2025.129312","DOIUrl":"10.1016/j.amc.2025.129312","url":null,"abstract":"<div><div>Let <span><math><mi>f</mi><mo>:</mo><mi>E</mi><mo>→</mo><mo>{</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>k</mi><mo>}</mo></math></span> be an edge-coloring of the <em>n</em>-dimension hypercube <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. By the palette at a vertex <em>v</em> we mean the sequence <span><math><mo>(</mo><mi>f</mi><mo>(</mo><msub><mrow><mi>e</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>(</mo><mi>v</mi><mo>)</mo><mo>)</mo><mo>,</mo><mi>f</mi><mo>(</mo><msub><mrow><mi>e</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>(</mo><mi>v</mi><mo>)</mo><mo>)</mo><mo>,</mo><mo>…</mo><mo>,</mo><mi>f</mi><mo>(</mo><msub><mrow><mi>e</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>(</mo><mi>v</mi><mo>)</mo><mo>)</mo><mo>)</mo></math></span>, where <span><math><msub><mrow><mi>e</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>(</mo><mi>v</mi><mo>)</mo></math></span> is the edge incident to <em>v</em> that connects vertices differing in the <em>i</em>th element. In this paper, we show that two colors are enough to distinguish all vertices of the <em>n</em>-dimensional hypercube <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> (<span><math><mi>n</mi><mo>≥</mo><mn>2</mn></math></span>) by their palettes. We also show that if <em>f</em> is a proper edge-coloring of the hypercube <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> (<span><math><mi>n</mi><mo>≥</mo><mn>5</mn></math></span>), then <em>n</em> colors suffice to distinguish all vertices by their palettes.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129312"},"PeriodicalIF":3.5,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Effective data reduction algorithm for topological data analysis","authors":"Seonmi Choi ,&nbsp;Jinseok Oh ,&nbsp;Jeong Rye Park ,&nbsp;Seung Yeop Yang ,&nbsp;Hongdae Yun","doi":"10.1016/j.amc.2025.129302","DOIUrl":"10.1016/j.amc.2025.129302","url":null,"abstract":"<div><div>One of the most interesting tools that have recently entered the data science toolbox is topological data analysis (TDA). With the explosion of available data sizes and dimensions, identifying and extracting the underlying structure of a given dataset is a fundamental challenge in data science, and TDA provides a methodology for analyzing the shape of a dataset using tools and prospects from algebraic topology. However, the computational complexity makes it quickly infeasible to process large datasets, especially those with high dimensions. Here, we introduce a preprocessing strategy called the Characteristic Lattice Algorithm (CLA), which allows users to reduce the size of a given dataset as desired while maintaining geometric and topological features in order to make the computation of TDA feasible or to shorten its computation time. In addition, we derive a stability theorem and an upper bound of the barcode errors for CLA based on the bottleneck distance.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129302"},"PeriodicalIF":3.5,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Computational aspects of hyperbolic curvature flow","authors":"Monika Suchomelová,&nbsp;Michal Beneš,&nbsp;Miroslav Kolář","doi":"10.1016/j.amc.2025.129301","DOIUrl":"10.1016/j.amc.2025.129301","url":null,"abstract":"<div><div>The article analyzes behavior of the solution of the hyperbolic curvature flow by means of a class of analytical solutions and by computational studies performed by a semi-discrete finite-volume scheme. A class of analytical solutions is derived and used for the verification of the computational algorithm by numerical convergence to it. An original tangential redistribution is proposed to stabilize the numerical scheme. Its derivation requires a four-dimensional transformation of the evolution law. The role of tangential redistribution is demonstrated on computational examples. Computational studies show evolution of the initially convex and non-convex curves, and include cases when singularities predicted by theory start to develop.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129301"},"PeriodicalIF":3.5,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}