Muhammad Marwan , Ning Wang , Dur-e-Zehra Baig , Feng Li
{"title":"Practical computation of higher codimension Bogdanov–Takens bifurcations in energy supply–demand system","authors":"Muhammad Marwan , Ning Wang , Dur-e-Zehra Baig , Feng Li","doi":"10.1016/j.matcom.2025.05.004","DOIUrl":"10.1016/j.matcom.2025.05.004","url":null,"abstract":"<div><div>The analysis of energy crises is significant research topic in both theory and engineering. In the current paper, a nonlinear, real-life based model of energy resources transportation between two cities is considered to study codimension-1, codimension-2, and codimension-3 bifurcations using the first Lyapunov coefficient and generalized eigenvectors. The first Lyapunov coefficient (LC) provides sufficient information about the type of Hopf bifurcation and the emergence of a Bautin bifurcation at the critical points. Moreover, it is proved that there exists codimension-two Bogdanov–Takens (BT) bifurcation exhibiting Hopf, saddle–node and homoclinic local bifurcation curves at their specific parameters. Additionally, under certain conditions, the normal form of the codimension-three Bogdanov–Takens bifurcation is derived and analyzed.</div><div>Although the generalized eigenvectors in Hopf and BT bifurcations are essential for analysis, the orthogonality condition is not always satisfied, requiring tedious calculations. To facilitate this process, MATLAB codes are provided to help readers bypass these complex steps. Moreover, bifurcation diagrams for single and double parameters of the model are plotted to analyze the system’s behavior near critical points. Finally, to validate the analytical results, detailed numerical simulations of the bifurcation analysis are presented.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"238 ","pages":"Pages 255-268"},"PeriodicalIF":4.4,"publicationDate":"2025-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144170188","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":"Kahan–Hirota–Kimura maps preserving original cubic Hamiltonians","authors":"Víctor Mañosa , Chara Pantazi","doi":"10.1016/j.matcom.2025.05.002","DOIUrl":"10.1016/j.matcom.2025.05.002","url":null,"abstract":"<div><div>We study the class of cubic Hamiltonian vector fields whose associated Kahan–Hirota–Kimura (KHK) maps preserve the original Hamiltonian function. Our analysis focuses on these fields in <span><math><msup><mrow><mi>R</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> and <span><math><msup><mrow><mi>R</mi></mrow><mrow><mn>4</mn></mrow></msup></math></span>, extending to a family of fields in <span><math><msup><mrow><mi>R</mi></mrow><mrow><mn>6</mn></mrow></msup></math></span>. Additionally, we investigate various properties of these fields, including the existence of additional first integrals of a specific type, their role as Lie symmetries of the corresponding KHK map, and the symplecticity of these maps.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"238 ","pages":"Pages 240-254"},"PeriodicalIF":4.4,"publicationDate":"2025-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144154402","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":"Tracking problem of non-particle morphology based on fixed-time ZNN model","authors":"Peng Miao , Shuai Li , Chenghang Li","doi":"10.1016/j.matcom.2025.04.039","DOIUrl":"10.1016/j.matcom.2025.04.039","url":null,"abstract":"<div><div>This article examines a particular tracking challenge where targets and trackers cannot be conceptualized as static points and are continuously rotating. This poses difficulties in determining the shortest distance between them. To rapidly and precisely ascertain this minimal distance, we formulate an optimization problem. Subsequently, a fixed-time zeroing neural network (ZNN) model is devised to address this optimization challenge. Moreover, the fixed-time stability of the proposed network is established and an estimation of a relatively smaller upper bound of convergence time (UBCT) is derived from previous iterations. Furthermore, the sensitivity of parameters to UBCT is also given. Finally, a specific tracking scenario demonstrates the efficacy and superior performance of our approach.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"238 ","pages":"Pages 189-200"},"PeriodicalIF":4.4,"publicationDate":"2025-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144125085","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":"News of IMACS","authors":"","doi":"10.1016/S0378-4754(25)00207-1","DOIUrl":"10.1016/S0378-4754(25)00207-1","url":null,"abstract":"","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"236 ","pages":"Page 475"},"PeriodicalIF":4.4,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144108012","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":"IMACS Calendar of Events","authors":"","doi":"10.1016/S0378-4754(25)00208-3","DOIUrl":"10.1016/S0378-4754(25)00208-3","url":null,"abstract":"","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"236 ","pages":"Page 476"},"PeriodicalIF":4.4,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144108013","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":"Reversible adaptive chaotic multi-image privacy protection scheme for efficient batch encryption of various images","authors":"Defeng Jiang, Shaohui Yan","doi":"10.1016/j.matcom.2025.05.017","DOIUrl":"10.1016/j.matcom.2025.05.017","url":null,"abstract":"<div><div>Addressing the limitations of traditional encryption algorithms with fixed structures, this paper proposes a multi-image encryption scheme based on chaotic map. This scheme allows users to input multiple images of varying sizes and types, which are then encrypted into a single noise-like image stored on a cloud platform. First, a three-dimensional hyperchaotic memristor map with excellent randomness is constructed. Through the proposed key-initial value generation mechanism based on the SHA-384 hash algorithm, the user’s provided key is converted into an initial value to generate the chaotic sequence used for encryption. Subsequently, multiple input images are pre-processed and concatenated into a large plaintext image, which undergoes bit-level adaptive domain diffusion and chaotic index-Zigzag composite scrambling to produce the final ciphertext image. The algorithm introduces adaptive encryption parameter that control the size of the traversal matrix and the rule matrix based on the input images. By transforming large matrix operations into multiple smaller matrix operations, the encryption process is dynamically adjusted and computational resources are optimized, thereby enhancing both the flexibility and efficiency of the algorithm. Finally, security analyses with multiple groups of test images show excellent performance across all metrics. Notably, the scheme can encrypt 50 images in 25.8 seconds, demonstrating remarkable efficiency.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"238 ","pages":"Pages 201-221"},"PeriodicalIF":4.4,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144130892","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}
Ebenezer O. Oluwasakin , Abdul Q.M. Khaliq , Khaled M. Furati
{"title":"Learning time-varying parameters of stiff dynamical systems using physics-informed transfer neural network","authors":"Ebenezer O. Oluwasakin , Abdul Q.M. Khaliq , Khaled M. Furati","doi":"10.1016/j.matcom.2025.04.038","DOIUrl":"10.1016/j.matcom.2025.04.038","url":null,"abstract":"<div><div>Learning the time-varying parameters of stiff dynamical systems is challenging due to their sensitivity to initial conditions and rapid dynamics. We introduce a framework based on Physics-Informed Transfer Learning Neural Networks to learn the time-varying parameters of stiff dynamic systems effectively. The framework leverages prior knowledge embedded in pre-trained models by transferring the learned model parameters to a sequential neural network architecture. This framework admits the dataset, transfers parameters from the pre-trained network, and outputs the solution to the system. Then, the system’s solution is used as input to learn the time-varying parameters. We evaluate this approach on four benchmark problems: the Robertson problem, a damped oscillator, and the High Irradiance Response problem from biochemical kinetics. Results demonstrate that the approach can accurately learn time-varying parameters and capture complex dynamics, providing a robust tool for stiff differential equations in scientific computing.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"238 ","pages":"Pages 82-102"},"PeriodicalIF":4.4,"publicationDate":"2025-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144107448","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}
Daniel G. Alfaro Vigo , Daniele C.R. Gomes , Bruno A. do Carmo , Mauro A. Rincon
{"title":"Convergence analysis of a Schrödinger problem with moving boundary","authors":"Daniel G. Alfaro Vigo , Daniele C.R. Gomes , Bruno A. do Carmo , Mauro A. Rincon","doi":"10.1016/j.matcom.2025.04.042","DOIUrl":"10.1016/j.matcom.2025.04.042","url":null,"abstract":"<div><div>In this article, we present the mathematical analysis of the convergence of the linearized Crank–Nicolson Galerkin method for a nonlinear Schrödinger problem related to a domain with a moving boundary. The convergence analysis of the numerical method is carried out for both semidiscrete and fully discrete problems. We establish an optimal error estimate in the <span><math><msup><mrow><mi>L</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span>-norm with order <span><math><mrow><mi>O</mi><mrow><mo>(</mo><msup><mrow><mi>τ</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>+</mo><msup><mrow><mi>h</mi></mrow><mrow><mi>s</mi></mrow></msup><mo>)</mo></mrow><mo>,</mo><mspace></mspace><mn>2</mn><mo>≤</mo><mi>s</mi><mo>≤</mo><mi>r</mi></mrow></math></span>, where <span><math><mi>h</mi></math></span> is the finite element mesh size, <span><math><mi>τ</mi></math></span> is the time step, and <span><math><mrow><mi>r</mi><mo>−</mo><mn>1</mn></mrow></math></span> represents the degree of the finite element polynomial basis. Numerical simulations are provided to confirm the consistency between theoretical and numerical results, validating the method and the order of convergence for different degrees <span><math><mrow><mi>p</mi><mo>≥</mo><mn>1</mn></mrow></math></span> of the Lagrange polynomials and also for Hermite polynomials (degree <span><math><mrow><mi>p</mi><mo>=</mo><mn>3</mn></mrow></math></span>), which form the basis of the approximate solution.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"238 ","pages":"Pages 45-64"},"PeriodicalIF":4.4,"publicationDate":"2025-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144089222","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":"Minimax concave penalty-based TGV model for Poissonian image restoration","authors":"Xinwu Liu , Xiang Yu , Jiangli Liang","doi":"10.1016/j.matcom.2025.05.001","DOIUrl":"10.1016/j.matcom.2025.05.001","url":null,"abstract":"<div><div>As is known to all, although the denoising models based on total generalized variation regularization prevent the occurrence of staircase artifacts, they also tend to result in blurred edges in the restored images. In order to obtain high-quality images that conform human visual characteristics, we add a minimax concave penalty into the total generalized variation function, and develop a novel Kullback–Leibler divergence fidelity-based model for Poissonian image restoration. By integrating the variable splitting technique, a modified alternating direction method of multipliers is designed for numerical computation. Moreover, under proper parameter selection, the convergence of our proposed algorithm is established in detail. As the experimental validations, we have conducted a variety of numerical experiments comparing our new solver with some existing state-of-the-art methods. From the numerical experiments, it follows that our approach can not only preserve structural features well, but also achieve comparable recovery effects over other denoising schemes.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"238 ","pages":"Pages 25-44"},"PeriodicalIF":4.4,"publicationDate":"2025-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144084747","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}
Sangeeta Kumawat , Sanjay Bhatter , Bhamini Bhatia , Sunil Dutt Purohit , Haci Mehmet Baskonus , Daya Lal Suthar
{"title":"Novel application of q-HAGTM to analyze Hilfer fractional differential equations in diabetic dynamics","authors":"Sangeeta Kumawat , Sanjay Bhatter , Bhamini Bhatia , Sunil Dutt Purohit , Haci Mehmet Baskonus , Daya Lal Suthar","doi":"10.1016/j.matcom.2025.04.029","DOIUrl":"10.1016/j.matcom.2025.04.029","url":null,"abstract":"<div><div>Fractional calculus has emerged as a valuable tool for modeling complex dynamical systems due to its ability to represent the memory and hereditary characteristics. Among the various fractional operators, the Hilfer fractional derivative is particularly notable for its unique capability to interpolate between the Caputo and Riemann–Liouville derivatives, providing a versatile framework for fractional-order modeling. Although various numerical and analytical methods have been used to solve Hilfer fractional differential equations, the q-Homotopy analysis generalized transform method remains unexplored. In this study, we extend a glucose–insulin interaction model to a Hilfer fractional framework and apply this method to analyze its dynamics. The approach provides an effective solution technique, highlighting its potential for analyzing complex fractional-order biological systems. To establish the validity of our approach, we analyze the uniqueness and convergence of the obtained solutions. Numerical simulations and graphical representations illustrate the model’s behavior and confirm the method’s effectiveness. This study presents a novel application of the q-Homotopy analysis generalized transform method to Hilfer fractional equations. The results confirm the applicability and effectiveness of this method in obtaining reliable solutions. The findings contribute to the broader understanding of fractional-order modeling and demonstrate the potential of this approach for future research in mathematical modeling.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"238 ","pages":"Pages 136-149"},"PeriodicalIF":4.4,"publicationDate":"2025-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144107357","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}