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

An IMEX scheme for a nonlinear PDE model of tumor angiogenesis 肿瘤血管生成非线性PDE模型的IMEX格式

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2025-10-10 DOI: 10.1016/j.cam.2025.117139

Pasquale De Luca, Livia Marcellino

引用次数: 0

Highly-accurate numerical scheme for a system of nonlinear Abel–Volterra integral equations 非线性Abel-Volterra积分方程系统的高精度数值格式

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2025-10-10 DOI: 10.1016/j.cam.2025.117149

Rakesh Kumar , B.V. Rathish Kumar , Kapil Kant

{"title":"Highly-accurate numerical scheme for a system of nonlinear Abel–Volterra integral equations","authors":"Rakesh Kumar , B.V. Rathish Kumar , Kapil Kant","doi":"10.1016/j.cam.2025.117149","DOIUrl":"10.1016/j.cam.2025.117149","url":null,"abstract":"<div><div>This study explores a system of second-kind nonlinear Abel–Volterra integral equations (SSNAVIEs) that involve a weakly singular kernel function. To effectively solve these integral equations, we propose Galerkin and Iterated Galerkin (IG) methods based on Jacobi polynomials. The existence and uniqueness of the solution are established using the Banach contraction theorem. Additionally, we develop numerical algorithms to obtain approximate solutions and conduct a comprehensive convergence and error analysis for the proposed methods. For the Galerkin method, we establish an order of convergence of <span><math><mrow><mi>O</mi><mfenced><mrow><msup><mrow><mi>N</mi></mrow><mrow><mo>−</mo><mi>q</mi></mrow></msup></mrow></mfenced></mrow></math></span>, while the IG method exhibits an improved convergence rate of <span><math><mrow><mi>O</mi><mfenced><mrow><msup><mrow><mi>N</mi></mrow><mrow><mo>−</mo><mn>2</mn><mi>q</mi></mrow></msup></mrow></mfenced></mrow></math></span>. To the best of our knowledge, this is the first study to apply spectral methods for solving systems of second-kind nonlinear Volterra–Abel integral equations with weak singularities. To validate our theoretical results, we perform numerical experiments, confirming the accuracy and efficiency of the proposed approach.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"477 ","pages":"Article 117149"},"PeriodicalIF":2.6,"publicationDate":"2025-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145277946","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}

引用次数: 0

Hybrid butter-flower algorithm: Novel metaheuristic optimization algorithm 混合黄油花算法：一种新的元启发式优化算法

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2025-10-10 DOI: 10.1016/j.cam.2025.117148

Utkarsh Mahadeo Khaire , Shashank R Hiremath , Kartik Londhe , C B Manjusha , Antara Singha Mahapatra

{"title":"Hybrid butter-flower algorithm: Novel metaheuristic optimization algorithm","authors":"Utkarsh Mahadeo Khaire , Shashank R Hiremath , Kartik Londhe , C B Manjusha , Antara Singha Mahapatra","doi":"10.1016/j.cam.2025.117148","DOIUrl":"10.1016/j.cam.2025.117148","url":null,"abstract":"<div><div>This study presents the Hybrid Butter-Flower Algorithm (HBFA), an innovative metaheuristic optimization approach that combines the strengths of the Sunflower Optimization Algorithm (SOA) and the Butterfly Optimization Algorithm (BOA) to improve convergence speed, accuracy, and robustness. While proficient in exploration, SOA may lack the aggressive exploitation required for swift convergence, potentially slowing down solution refinement. However, BOA might experience premature convergence in challenging milieu that results in demurrer in local optima. HBFA handles these challenges by amalgamating SOA’s unique exploration nuances with BOA’s effectual exploitation techniques, assuring an optimum exchange between orbicular and localized search. The algorithm is assessed on 23 unimodal and multimodal standard functions and six constrained mechanical design optimization problems with real-world applications. The performance of HBFA is benchmarked against nine state-of-the-art optimization methods, including PSO, SSA, and HSA, based on metrics such as best solution, average solution, and convergence rate. The results demonstrate that HBFA attains the highest performance efficiency (96.69 %), accomplishing all competitive algorithms by epochal margins, with amelioration ranging from 21 % to 63 % over conventional approaches. Notably, the proposed HBFA is 83.25 % faster in finding the optimal solution than other algorithms without falling for premature convergence and local optima. The superiority of HBFA is further validated through Wilcoxon signed-rank and Friedman statistical tests, with an average p-value of 3.14E-10, confirming its statistically significant advantage. Given to its adaptive nature and rapid convergence, HBFA emerges as a powerful tool for addressing complex optimization challenges in engineering, artificial intelligence, and industrial applications.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"477 ","pages":"Article 117148"},"PeriodicalIF":2.6,"publicationDate":"2025-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145326669","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}

引用次数: 0

Constraint satisfaction approach in structuring neural network architectures 构造神经网络结构的约束满足方法

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2025-10-08 DOI: 10.1016/j.cam.2025.117140

Vittorio Bauduin , Salvatore Cuomo , Vincenzo Schiano Di Cola

引用次数: 0

Integrating subdivision schemes into SVM for improved signal classification 将细分方案集成到支持向量机中改进信号分类

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2025-10-08 DOI: 10.1016/j.cam.2025.117142

V. Bruni , F. Pelosi , D. Vitulano

{"title":"Integrating subdivision schemes into SVM for improved signal classification","authors":"V. Bruni , F. Pelosi , D. Vitulano","doi":"10.1016/j.cam.2025.117142","DOIUrl":"10.1016/j.cam.2025.117142","url":null,"abstract":"<div><div>The integration of advanced signal processing techniques into machine learning models has gained increasing attention due to its potential to improve model performance, particularly for classification tasks. Support Vector Machine (SVM) is widely recognized as a powerful tool for signal classification due to its robust mathematical foundation and effectiveness in handling high-dimensional data. Subdivision schemes, originally developed in computer graphics for geometric modeling, offer a novel and parametric approach to feature preprocessing by iteratively refining input data through an efficient computational procedure. This paper studies the impact of subdivision schemes on SVM performance in terms of class separability and provides insights into the relationship between feature transformation and SVM response. Specifically, it investigates the theoretical and empirical implications of applying subdivision schemes to input features in SVM-based classification. The conditions under which these schemes preserve or enhance class separability are analyzed, focusing on the tension parameter which governs both the smoothness properties of the limit curve and the subdivision rule at each iteration. An estimation method for the tension parameter from the training data is also provided. Experimental results, performed in the context of signal classification based on the wavelet scattering transform, demonstrate that the appropriate selection of the tension parameter of the scheme can significantly enhance class separability, highlighting that subdivision schemes are a promising tool for improving classification accuracy in machine learning workflows.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"477 ","pages":"Article 117142"},"PeriodicalIF":2.6,"publicationDate":"2025-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145277880","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}

引用次数: 0

A nonlocal dispersive optimal transport: Formulation and algorithm 非局部色散最优输运：公式与算法

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2025-10-07 DOI: 10.1016/j.cam.2025.117132

Songhai Bai , Xu Guo , Yiqun Li , Xiangcheng Zheng , Yan Zhu

{"title":"A nonlocal dispersive optimal transport: Formulation and algorithm","authors":"Songhai Bai , Xu Guo , Yiqun Li , Xiangcheng Zheng , Yan Zhu","doi":"10.1016/j.cam.2025.117132","DOIUrl":"10.1016/j.cam.2025.117132","url":null,"abstract":"<div><div>We propose a unified framework that effectively characterizes challenging phenomena such as anomalous transport in heterogeneous media and long-range memory effects and interactions. This framework transports agent densities from a prescribed initial distribution to a terminal distribution while minimizing the associated energy cost. Motivated by optimal transport theory, we introduce a nonlocal dispersive optimal transport (NDOT) model governed by a space–time fractional partial differential equation (PDE). We solve the NDOT formulation using the general-proximal primal–dual hybrid gradient (G-prox PDHG) algorithm, and then introduce a novel preconditioner derived from the discretization of the space–time fractional PDE to accelerate the convergence. Numerical experiments – especially those with target states represented by power functions typical of fractional differential equation solutions – show that our model substantially reduces kinetic energy costs compared with its integer-order counterparts, highlighting its effectiveness and applicability for complex phenomena such as anomalous transport in heterogeneous environments.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"476 ","pages":"Article 117132"},"PeriodicalIF":2.6,"publicationDate":"2025-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145269509","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}

引用次数: 0

Christoffel transform and multiple orthogonal polynomials 克里斯托费尔变换和多重正交多项式

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2025-10-06 DOI: 10.1016/j.cam.2025.117121

Rostyslav Kozhan, Marcus Vaktnäs

{"title":"Christoffel transform and multiple orthogonal polynomials","authors":"Rostyslav Kozhan, Marcus Vaktnäs","doi":"10.1016/j.cam.2025.117121","DOIUrl":"10.1016/j.cam.2025.117121","url":null,"abstract":"<div><div>We investigate multiple orthogonal polynomials associated with the system of measures obtained by applying a Christoffel transform to each of the orthogonality measures. We present an algorithm for computing the transformed recurrence coefficients and determinantal formulas for the transformed multiple orthogonal polynomials of type I and type II.</div><div>We apply these results to show that zeros of multiple orthogonal polynomials of an Angelesco or an AT system interlace with the zeros of the polynomials corresponding to its one-step Christoffel transform. This allows us to prove a number of interlacing properties satisfied by the multiple orthogonality analogues of classical orthogonal polynomials. For the discrete polynomials, this also produces an estimate on the smallest distance between consecutive zeros.</div><div>We also identify a connection between the Christoffel transform of orthogonal polynomials and multiple orthogonality systems containing a finitely supported measure. In consequence, the compatibility relations for the nearest neighbour recurrence coefficients provide a new algorithm for the computation of the Jacobi coefficients of the one-step or multi-step Christoffel transforms.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"476 ","pages":"Article 117121"},"PeriodicalIF":2.6,"publicationDate":"2025-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145269512","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}

引用次数: 0

An initial-corrected splitting approach for convection–diffusion–reaction problems 对流-扩散-反应问题的初始修正分裂方法

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2025-10-06 DOI: 10.1016/j.cam.2025.117136

Thi Tam Dang , Lukas Einkemmer , Alexander Ostermann

引用次数: 0

Mathematical model, block-centered difference and numerical analysis on changing meshes of semiconductor device problem with heat and magnetic influences 热和磁影响下半导体器件换网格问题的数学模型、块心差分及数值分析

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2025-10-04 DOI: 10.1016/j.cam.2025.117130

Changfeng Li , Yirang Yuan , Huailing Song

{"title":"Mathematical model, block-centered difference and numerical analysis on changing meshes of semiconductor device problem with heat and magnetic influences","authors":"Changfeng Li , Yirang Yuan , Huailing Song","doi":"10.1016/j.cam.2025.117130","DOIUrl":"10.1016/j.cam.2025.117130","url":null,"abstract":"<div><div>Numerical simulation of semiconductor device with heat and magnetic influences is a preliminary problem in information science. In this paper, mathematical model, numerical method and theoretical analysis are discussed. Four major physical unknowns (the potential, electron concentration, hole concentration, and the heat) are defined by several nonlinear PDEs, an elliptic equation, two convection–diffusion equations and a heat conductor equation. A block-centered numerical method with conservative nature is used to obtain the potential, and the computational accuracy is improved. An upwind block-centered difference method is adopted for solving other PDEs on changing meshes. The diffusion and convection operators are discretized by block-centered differences and upwind differences, respectively. Changing meshes are effective for simulating the status nearby P-N junction. The composite scheme avoids numerical dispersion and nonphysical oscillation, and the conservation is preserved. The unknowns and their adjoint vectors are computed at the same time. Some theoretical techniques such as energy norm estimates, the method of duality and mathematical induction are used to finish convergence analysis. Error results are concluded. Finally, numerical examples show the efficiency and possible application.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"476 ","pages":"Article 117130"},"PeriodicalIF":2.6,"publicationDate":"2025-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145269741","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}

引用次数: 0

Extensions of Panjer’s recursion for mixed compound distributions 混合复合分布下Panjer递归的扩展

IF 2.6 2区数学

Journal of Computational and Applied Mathematics Pub Date : 2025-10-03 DOI: 10.1016/j.cam.2025.117138

Spyridon M. Tzaninis , Apostolos Bozikas

引用次数: 0