Journal of Computational and Applied Mathematics最新文献

{"title":"Early breast cancer prediction using optimized machine learning and tumor-immune modeling","authors":"Oluwaseun Olumide Okundalaye ,&nbsp;Necati Özdemir ,&nbsp;Richard Olu Awonusika","doi":"10.1016/j.cam.2025.116875","DOIUrl":"10.1016/j.cam.2025.116875","url":null,"abstract":"<div><div>This study aims to enhance early breast cancer prediction accuracy by utilizing machine learning classifiers and feature selection techniques. The Wisconsin Diagnostic Breast Cancer (WDBC) dataset was used to train and evaluate three popular machine learning classifiers: Support Vector Machine (SVM), Random Forest (RF), and k-Nearest Neighbors (k-NN). Feature selection methods were applied to optimize model performance, including Recursive Feature Elimination (RFE) and Mutual Information. Cross-validation and hyperparameter tuning were conducted to ensure the robustness and reliability of the models. The results showed that the SVM classifier achieved the highest performance with an accuracy of 98 %, compared to 95.8 % for RF and 96.2 % for k-NN. The SVM model demonstrated a precision of 0.98 and a recall of 0.95 for malignant cases. Feature selection revealed that mean radius, texture, and area were the most influential features, and SHapley Additive exPlanations (SHAP) analysis confirmed their clinical relevance in breast cancer diagnosis. A tumor-immune dynamic model also indicated that treatment efficacy (γ = 0.0500/day) was a critical parameter for tumor control. Statistical significance tests (<em>p</em> &lt; 0.05) confirmed that the SVM classifier outperformed the other models. This study highlights the potential of combining machine learning with clinical insights to develop an effective framework for breast cancer prediction, offering high diagnostic accuracy and biological interpretability.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"473 ","pages":"Article 116875"},"PeriodicalIF":2.1,"publicationDate":"2025-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144472009","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":"Bi-objective optimization of human-robot collaborative mixed-model multiple assembly lines considering model assignment and energy consumption","authors":"Oktay Yilmaz ,&nbsp;Nezir Aydin ,&nbsp;Ibrahim Kucukkoc","doi":"10.1016/j.cam.2025.116876","DOIUrl":"10.1016/j.cam.2025.116876","url":null,"abstract":"<div><div>A critical yet often overlooked challenge in mixed-model and multi-line production environments is the model-line assignment problem–deciding which product models should be allocated to which assembly lines. This decision has a profound effect on overall production efficiency, as it directly influences subsequent balancing and scheduling decisions. The integration of collaborative robots (cobots) into these environments further complicates this task. Despite its significance, the joint consideration of model-line assignment and robotic line balancing has received limited attention in the literature. This study addresses this gap by formulating the robotic mixed-model multiple assembly line balancing problem with simultaneous model-line assignment (MLA-RMMALB) and proposing a multi-objective mixed-integer programming model. The model aims to minimize total production costs and <span><math><mrow><mi>P</mi><msub><mi>M</mi><mrow><mn>2.5</mn></mrow></msub></mrow></math></span> emissions resulting from cobots’ energy consumption. To handle the complexity of the problem, a Non-dominated Sorting Genetic Algorithm II (NSGA-II) is developed as a solution approach. The model's effectiveness is demonstrated through a numerical example involving 21 tasks and benchmark problems from the literature. Solutions obtained under integrated model-line assignment are compared with random assignment scenarios, revealing significant performance gains in both objectives. NSGA-II proves capable of delivering optimal or near-optimal solutions efficiently for small- and medium-sized instances, and high-quality results for larger problems. This study contributes to literature by addressing critical challenges in multi-line mixed-model production by jointly considering model-line assignment, cobot heterogeneity, and the parallel operation of cobots and human workers. It proposes NSGA-II as an effective solution method for this complex problem. Practically, the study provides a decision-support tool for manufacturers aiming to optimize both cost-efficiency and environmental performance in robotic assembly systems. The findings are especially relevant for industries adopting cobots in high-variety production environments where these factors must be simultaneously managed.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"473 ","pages":"Article 116876"},"PeriodicalIF":2.1,"publicationDate":"2025-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144513996","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":"Finite difference time domain methods for the Chern–Simons–Schrödinger equations","authors":"Jeongho Kim ,&nbsp;Bora Moon","doi":"10.1016/j.cam.2025.116851","DOIUrl":"10.1016/j.cam.2025.116851","url":null,"abstract":"<div><div>We introduce finite difference time domain (FDTD) methods for the Schrödinger equation interacting with the Chern–Simons gauge fields, subjected to the Lorenz or Coulomb gauge condition. We consider two types of FDTD methods: the Crank–Nicolson finite difference (CNFD) method and the leaf-frog finite difference (LFFD) method. In particular, the CNFD method is carefully devised on the staggered spatial and temporal grid points to preserve the total charge of the system. We provide several numerical experiments that validate the second-order convergence of the FDTD methods, the conservation of total charge and energy, and the dependencies of the solutions on the model parameters. We also compare the differences between the solutions of the CSS equations and the Schrödinger equation.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"473 ","pages":"Article 116851"},"PeriodicalIF":2.1,"publicationDate":"2025-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144490297","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":"New results on the constrained mock-Chebyshev least squares operator","authors":"Francesco Dell’Accio ,&nbsp;Domenico Mezzanotte ,&nbsp;Federico Nudo ,&nbsp;Donatella Occorsio","doi":"10.1016/j.cam.2025.116859","DOIUrl":"10.1016/j.cam.2025.116859","url":null,"abstract":"<div><div>In this paper, we extend the constrained mock-Chebyshev least squares operator to quasi-uniform grids, preserving the accuracy and applicability of the original approach while addressing the practical challenge of quasi-equispaced nodes. Additionally, we provide an improved bound for the norm of the operator by using a refined bound for its coefficient vector through the direct elimination method. Numerical experiments confirm the efficiency of the proposed technique.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"473 ","pages":"Article 116859"},"PeriodicalIF":2.1,"publicationDate":"2025-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144338991","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":"Two-grid domain decomposition method for the coupled Stokes–Darcy system with Beavers–Joseph interface condition","authors":"Xinxin Sun,&nbsp;Guangzhi Du","doi":"10.1016/j.cam.2025.116852","DOIUrl":"10.1016/j.cam.2025.116852","url":null,"abstract":"<div><div>In this paper, by combining the two-grid technique and the existing Robin-type domain decomposition method, we propose and investigate a two-grid (Robin-type) domain decomposition method for the steady-state mixed Stokes–Darcy system with the Beavers–Joseph interface condition. This algorithm involves solving the mixed model by utilizing the existing Robin-type domain decomposition method on a relatively coarse grid, then solving a Darcy problem and Stokes equations sequentially on a fine grid by approximating appropriately the interface terms. Our scheme could not only inherit the primary characteristics of the domain decomposition method and the two-grid decoupled method naturally but also to some extent, overcome the shortcomings of both algorithms. Rigorously theoretical estimates are established and some comprehensive numerical experiments are reported to indicate the validity, efficiency and robustness of the proposed algorithm by comparing with the domain decomposition method.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"473 ","pages":"Article 116852"},"PeriodicalIF":2.1,"publicationDate":"2025-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144366381","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 posteriori error estimation for an interior penalty virtual element method of Kirchhoff plates","authors":"Fang Feng ,&nbsp;Yuming Hu ,&nbsp;Yue Yu ,&nbsp;Jikun Zhao","doi":"10.1016/j.cam.2025.116853","DOIUrl":"10.1016/j.cam.2025.116853","url":null,"abstract":"<div><div>In this paper, we develop a residual-type a posteriori error estimation for an interior penalty virtual element method (IPVEM) for the Kirchhoff plate bending problem. Building on the work in Feng and Yu (2024), we adopt a modified discrete variational formulation that incorporates the <span><math><msup><mrow><mi>H</mi></mrow><mrow><mn>1</mn></mrow></msup></math></span>-elliptic projector in the jump and average terms. This allows us to simplify the numerical implementation by including the <span><math><msup><mrow><mi>H</mi></mrow><mrow><mn>1</mn></mrow></msup></math></span>-elliptic projector in the computable error estimators. We derive the reliability and efficiency of the a posteriori error bound by constructing an enriching operator and establishing some related error estimates that align with <span><math><msup><mrow><mi>C</mi></mrow><mrow><mn>0</mn></mrow></msup></math></span>-continuous interior penalty finite element methods. As observed in the a priori analysis, the interior penalty virtual elements exhibit similar behaviors to <span><math><msup><mrow><mi>C</mi></mrow><mrow><mn>0</mn></mrow></msup></math></span>-continuous elements despite its <span><math><msup><mrow><mi>H</mi></mrow><mrow><mn>1</mn></mrow></msup></math></span>-nonconforming. This observation extends to the a posteriori estimate since we do not need to account for the jumps of the function itself in the discrete scheme and the error estimators. As an outcome of the error estimator, an adaptive VEM is introduced by means of the mesh refinement strategy with the one-hanging-node rule. Numerical results from several benchmark tests confirm the robustness of the proposed error estimators and show the efficiency of the resulting adaptive VEM.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"473 ","pages":"Article 116853"},"PeriodicalIF":2.1,"publicationDate":"2025-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144338990","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":"Optimal error estimates of the local discontinuous Galerkin method and high-order energy stable RK-SAV scheme for the phase field crystal equation","authors":"Ruihan Guo ,&nbsp;Yuqing Yan,&nbsp;Xiaobin Liu","doi":"10.1016/j.cam.2025.116849","DOIUrl":"10.1016/j.cam.2025.116849","url":null,"abstract":"<div><div>In this paper, we apply the local discontinuous Galerkin (LDG) method in space and the scalar auxiliary variable (SAV) method in time to construct a linear first-order fully-discrete scheme for the phase field crystal equation. Unconditionally, the energy stability for the fully-discrete LDG scheme is proved. We also rigorously prove the error estimate which shows that our first-order SAV approach and LDG method with <span><math><msup><mrow><mi>Q</mi></mrow><mrow><mi>k</mi></mrow></msup></math></span> approximation converges with order <span><math><mrow><mi>O</mi><mrow><mo>(</mo><mi>Δ</mi><mi>t</mi><mo>+</mo><msup><mrow><mi>h</mi></mrow><mrow><mi>k</mi><mo>+</mo><mn>1</mn></mrow></msup><mo>)</mo></mrow></mrow></math></span>. To improve the temporal accuracy, we adopt the semi-implicit Runge–Kutta SAV (RK-SAV) method. The scheme is proved to be unconditionally energy stable, effective and easy to implement since only a sequence of elliptic equations with constant coefficients need to be solved at each time step. Numerical experiments are presented to verify the theoretical results and to show the efficiency of the proposed methods.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"473 ","pages":"Article 116849"},"PeriodicalIF":2.1,"publicationDate":"2025-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144338987","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":"Finite dissolution-rate drug release: From a continuous-field description to a moving-boundary problem","authors":"M. Ibrahim ,&nbsp;K.M. Moroney ,&nbsp;M. Vynnycky","doi":"10.1016/j.cam.2025.116857","DOIUrl":"10.1016/j.cam.2025.116857","url":null,"abstract":"<div><div>In this paper, a previously established model for drug release from a matrix layer is revisited from both analytical and numerical perspectives. The model was originally formulated using a continuous-field description in terms of two transient, one-dimensional, partial differential equations (PDEs) - one each for dissolved and solid drug concentrations. The PDE for the former is of reaction–diffusion type, whilst in the latter there is reaction, but no diffusion. We demonstrate how the problem can be re-posed as a sequence of three sub-problems, the second of which constitutes an embedded moving-boundary (sharp interface) problem, whilst the other two are conventional fixed-boundary problems; nevertheless, the stopping time for the first problem and the starting time for the third problem are unknown and have to be determined as part of the solution. The model equations are solved numerically in three different ways using finite-element methods, with the novel contribution being the application of boundary immobilization techniques for the embedded sub-problem, in tandem with the use of asymptotic methods to give detailed information regarding the motion of moving front at its inception and just prior to its extinction. For the diffusion-limiting case, we also obtain a closed-form expression for the fraction of drug released as a function of time that cannot be obtained via a continuous-field formulation.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"473 ","pages":"Article 116857"},"PeriodicalIF":2.1,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144338986","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 new structure-preserving parametric finite element method for solving geometric flows of closed curves","authors":"Xiaowen Gan","doi":"10.1016/j.cam.2025.116856","DOIUrl":"10.1016/j.cam.2025.116856","url":null,"abstract":"<div><div>We propose a new structure-preserving parametric finite element method for simulating geometric flows of closed curves. The scheme is based on the Barrett-Garcke-Nürnberg (BGN) formulation, as initially introduced by Barrett et al. (2007). To enable area conservation, we employ a new different time-weighted discrete normal that was different from that in the work by Bao and Zhao (2021). For curve diffusion flow, we demonstrate that the proposed scheme satisfies area conservation and unconditional energy stability, while maintaining high mesh quality. Furthermore, the scheme exhibits a “weakly” implicit or near semi-implicit nature, which facilitates efficient and accurate computation of the nonlinear system at each time step via Newton’s iterative method. Additionally, the proposed scheme can be easily extended to simulate the area-conserved generalized curvature flow and anisotropic curve diffusion flow. Comprehensive numerical results, including convergence tests, verification of structure-preserving properties and mesh quality, are provided to validate the accuracy and efficiency of the proposed scheme.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"473 ","pages":"Article 116856"},"PeriodicalIF":2.1,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144338988","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":"Classical and objective Bayesian inference of Cpy for first-failure progressively censored samples","authors":"Sanku Dey ,&nbsp;Subhankar Dutta ,&nbsp;Devendra Kumar","doi":"10.1016/j.cam.2025.116841","DOIUrl":"10.1016/j.cam.2025.116841","url":null,"abstract":"<div><div>This article takes into account the estimation of the process capability index (PCI), <span><math><msub><mrow><mi>C</mi></mrow><mrow><mi>p</mi><mi>y</mi></mrow></msub></math></span> using first failure progressive censoring scheme (FFPCS). On the basis of FFPCS, <span><math><msub><mrow><mi>C</mi></mrow><mrow><mi>p</mi><mi>y</mi></mrow></msub></math></span> is estimated for the inverse Nakagami distribution using maximum likelihood (ML), maximum product spacing (MPS) and Bayesian estimation methods. Bayes estimator of <span><math><msub><mrow><mi>C</mi></mrow><mrow><mi>p</mi><mi>y</mi></mrow></msub></math></span> is obtained under squared error and linear exponential loss functions using objective prior. Besides, approximate confidence intervals (CIs) for the index <span><math><msub><mrow><mi>C</mi></mrow><mrow><mi>p</mi><mi>y</mi></mrow></msub></math></span> using both classical methods are obtained and compared with the highest posterior density (HPD) credible intervals. Finally, a simulated study is performed to assess the finite sample performance of the proposed point estimates of <span><math><msub><mrow><mi>C</mi></mrow><mrow><mi>p</mi><mi>y</mi></mrow></msub></math></span> based on mean squared errors (MSEs) and interval estimates are compared with their average length and coverage probabilities. In order to demonstrate the usefulness of the proposed index and estimation techniques, one real data set from the agricultural machine elevators is reanalyzed.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"473 ","pages":"Article 116841"},"PeriodicalIF":2.1,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144480619","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}