{"title":"A quadrature method for Volterra integral equations with highly oscillatory Bessel kernel","authors":"Longbin Zhao , Pengde Wang , Qiongqi Fan","doi":"10.1016/j.matcom.2024.09.002","DOIUrl":"10.1016/j.matcom.2024.09.002","url":null,"abstract":"<div><p>To avoid computing moments, this work adopts generalized quadrature method for Volterra integral equations with highly oscillatory Bessel kernel. At first, we study the influence of the interval length and frequency in detail after recalling the construction of the quadrature method. Then, the two-point quadrature method is employed for the equation. By estimating the weights, we could guarantee that the discretized equation is solvable. For its convergence, our analysis shows that the proposed method enjoys asymptotic order <span><math><mrow><mn>5</mn><mo>/</mo><mn>2</mn></mrow></math></span> and as <span><math><mi>h</mi></math></span> decreases it converges with order 2 as well. Some numerical illustrations are provided to test the method in the numerical part.</p></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"228 ","pages":"Pages 202-210"},"PeriodicalIF":4.4,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142151376","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(24)00334-3","DOIUrl":"10.1016/S0378-4754(24)00334-3","url":null,"abstract":"","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"226 ","pages":"Page 664"},"PeriodicalIF":4.4,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0378475424003343/pdfft?md5=9d747c87bbec322550227503f76409f9&pid=1-s2.0-S0378475424003343-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149209","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}
Beatriz Blanco , Roberto Palma , Manuel Hurtado , Gema Jiménez , Carmen Griñán-Lisón , Juan Melchor , Juan Antonio Marchal , Hector Gomez , Guillermo Rus , Juan Soler
{"title":"Modeling low-intensity ultrasound mechanotherapy impact on growing cancer stem cells","authors":"Beatriz Blanco , Roberto Palma , Manuel Hurtado , Gema Jiménez , Carmen Griñán-Lisón , Juan Melchor , Juan Antonio Marchal , Hector Gomez , Guillermo Rus , Juan Soler","doi":"10.1016/j.matcom.2024.08.030","DOIUrl":"10.1016/j.matcom.2024.08.030","url":null,"abstract":"<div><p>Targeted therapeutic interventions utilizing low-intensity ultrasound (LIUS) exhibit substantial potential for hindering the proliferation of cancer stem cells. This investigation introduces a multiscale model and computational framework to comprehensively explore the therapeutic LIUS on poroelastic tumor dynamics, thereby unraveling the intricacies of mechanotransduction mechanisms at play. Our model includes both macroscopic timescales encompassing days and rapid timescales spanning from microseconds to seconds, facilitating an in-depth comprehension of tumor behavior. We unveil the discerning suppression or reorientation of cancer cell proliferation and migration, enhancing a notable redistribution of cellular phases and stresses within the tumor microenvironment. Our findings defy existing paradigms by elucidating the impact of LIUS on cancer stem cell behavior. This endeavor advances our fundamental understanding of mechanotransduction phenomena in the context of LIUS therapy, thus underscoring its promising as a targeted therapeutic modality for cancer treatment. Furthermore, our results make a substantial contribution to the broader scientific community by shedding light on the intricate interplay between mechanical forces, cellular responses, and the spatiotemporal evolution of tumors. These insights hold the promising to promote a new perspective for the future development of pioneering and highly efficacious therapeutic strategies for combating cancer in a personalized manner.</p></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"228 ","pages":"Pages 87-102"},"PeriodicalIF":4.4,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0378475424003434/pdfft?md5=193e442ad0d077d63895faae24bfc727&pid=1-s2.0-S0378475424003434-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142151378","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":"Computing parameter planes of iterative root-finding methods with several free critical points","authors":"Beatriz Campos , Jordi Canela , Alberto Rodríguez-Arenas , Pura Vindel","doi":"10.1016/j.matcom.2024.08.013","DOIUrl":"10.1016/j.matcom.2024.08.013","url":null,"abstract":"<div><p>In this paper we present an algorithm to obtain the parameter planes of families of root-finding methods with several free critical points. The parameter planes show the joint behaviour of all critical points. This algorithm avoids the inconsistencies arising from the relationship between the different critical points as well as the indeterminacy caused by the square roots involved in their computation.</p><p>We analyse the suitability of this algorithm by drawing the parameter planes of different Newton-like methods with two and three critical points. We also present some results of the expressions of the Newton-like operators and their derivatives in terms of palindromic polynomials, and we show how to obtain the expression of the critical points of a Newton-like method with real coefficients.</p></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"228 ","pages":"Pages 52-72"},"PeriodicalIF":4.4,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S037847542400315X/pdfft?md5=4956d6bd6975a5a866e9fd44c4e853f4&pid=1-s2.0-S037847542400315X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142128459","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":"Discretisation of the Hough parameter space for fitting and recognising geometric primitives in 3D point clouds","authors":"Chiara Romanengo, Bianca Falcidieno, Silvia Biasotti","doi":"10.1016/j.matcom.2024.08.033","DOIUrl":"10.1016/j.matcom.2024.08.033","url":null,"abstract":"<div><p>Research in recognising and fitting simple geometric shapes has been ongoing since the 1970s, with various approaches proposed, including stochastic methods, parameter methods, primitive-based registration techniques, and more recently, deep learning. The Hough transform is a method of interest due to its demonstrated robustness to noise and outliers, ability to handle missing data, and support for multiple model instances. Unfortunately, one of the main limitations of the Hough transform is how to properly discretise its parameter space, as increasing their number or decreasing the sampling frequency can make it computationally expensive.</p><p>The relationship between the approximation accuracy and the parameter space’s discretisation is investigated to address this. We present two distinct discretisations to illustrate how the fitting and recognition quality can be improved by selecting an appropriate parameter discretisation. Our parameter-driven space discretisation is shown to significantly improve the parameter recognition quality over the classical method and reduce computational time and space by decreasing the discretisation’s dimension, as demonstrated by an extensive validation on a benchmark of geometric primitives. Preliminary experiments are also presented on segmenting datasets from urban buildings and CAD objects.</p></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"228 ","pages":"Pages 73-86"},"PeriodicalIF":4.4,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0378475424003458/pdfft?md5=808410d9aafec4900a4d7d00f9dcdd3b&pid=1-s2.0-S0378475424003458-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142151381","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":"An asymptotically optimal algorithm for generating bin cardinalities","authors":"Luc Devroye , Dimitrios Los","doi":"10.1016/j.matcom.2024.08.034","DOIUrl":"10.1016/j.matcom.2024.08.034","url":null,"abstract":"<div><p>In the balls-into-bins setting, <span><math><mi>n</mi></math></span> balls are thrown uniformly at random into <span><math><mi>n</mi></math></span> bins. The naïve way to generate the final load vector takes <span><math><mrow><mi>Θ</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span> time. However, it is well-known that this load vector has with high probability bin cardinalities of size <span><math><mrow><mi>Θ</mi><mrow><mo>(</mo><mfrac><mrow><mo>log</mo><mi>n</mi></mrow><mrow><mo>log</mo><mo>log</mo><mi>n</mi></mrow></mfrac><mo>)</mo></mrow></mrow></math></span>. Here, we present an algorithm in the RAM model that generates the bin cardinalities of the final load vector in the optimal <span><math><mrow><mi>Θ</mi><mrow><mo>(</mo><mfrac><mrow><mo>log</mo><mi>n</mi></mrow><mrow><mo>log</mo><mo>log</mo><mi>n</mi></mrow></mfrac><mo>)</mo></mrow></mrow></math></span> time in expectation and with high probability.</p><p>Further, the algorithm that we present is still optimal for any <span><math><mrow><mi>m</mi><mo>∈</mo><mrow><mo>[</mo><mi>n</mi><mo>,</mo><mi>n</mi><mo>log</mo><mi>n</mi><mo>]</mo></mrow></mrow></math></span> balls and can also be used as a building block to efficiently simulate more involved load balancing algorithms. In particular, for the <span>Two-Choice</span> algorithm, which samples two bins in each step and allocates to the least-loaded of the two, we obtain roughly a quadratic speed-up over the naïve simulation.</p></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"228 ","pages":"Pages 147-155"},"PeriodicalIF":4.4,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142151374","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 fixed point evolution algorithm based on expanded Aitken rapid iteration method for global numeric optimization","authors":"Qian Zhang, Zhongbo Hu, Nan Hong, Qinghua Su","doi":"10.1016/j.matcom.2024.08.027","DOIUrl":"10.1016/j.matcom.2024.08.027","url":null,"abstract":"<div><div>Evolution algorithms based on mathematical models whose reproduction operators are derived from mathematical models are a promising branch of metaheuristic algorithms. Aitken rapid iteration method, as a fixed point iteration technique for solving nonlinear equations, performs a procedure of progressive display of a root and generates an iterative sequence that exhibits a convergent trend. Inspired by the idea that an iterative sequence gradually converges to the optimal point during the progressive display procedure of a fixed point of an equation, a fixed point evolution algorithm based on the expanded Aitken rapid iteration method (FPEea) is proposed. To develop FPEea, an expanded Aitken rapid model is first constructed. Then, three polynomials which are derived from the expanded Aitken rapid model are used as the reproduction operator of FPEea to produce offspring. The performance of FPEea is investigated on CEC2019 and CEC2020 benchmark function sets, as well as four engineering design problems. Experimental results show that FPEea is an effective and competitive algorithm compared with several classical evolution algorithms and state-of-the-art algorithms.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"229 ","pages":"Pages 288-303"},"PeriodicalIF":4.4,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142418192","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":"Global dynamics and numerical simulation of a modified epidemiological model for viral marketing on social networks","authors":"Manh Tuan Hoang , Hoai Thu Pham","doi":"10.1016/j.matcom.2024.08.024","DOIUrl":"10.1016/j.matcom.2024.08.024","url":null,"abstract":"<div><p>The aim of this work is to conduct a rigorous mathematical analysis for global dynamics and numerical simulation of a recognized viral marketing (VM) model, which is described by a system of ordinary differential equations (ODEs). We first establish positivity and boundedness of solutions and then investigate local and global asymptotic stability properties of possible equilibrium points. As an important consequence, complex dynamics of the VM model is determined fully.</p><p>Secondly, we develop the Mickens’ methodology to design a nonstandard finite difference (NSFD) scheme, which is useful in numerical simulation of the VM model. The main advantage of the constructed NSFD scheme is that it has the ability to preserve important mathematical features of the continuous-time model for all finite values of the step size. These features include the positivity and boundedness of solutions, positively invariant sets, equilibrium points and their asymptotic stability properties. Consequently, the NSFD scheme is not only effective to simulate dynamics of the VM model, but also easy to be implemented.</p><p>Thirdly, to emphasize implications of the constructed mathematical analysis, an extended version combining the integer-order ODE model under consideration with the Caputo fractional derivative is considered and analyzed. From the mathematical analysis performed for the integer-order VM model, global dynamics of the fractional-order VM model is also investigated rigorously.</p><p>Finally, the theoretical insights are supported by a set of illustrative numerical experiments.</p><p>The findings of this research not only improve some existing results in the literature, but may also provide several useful real-life applications.</p></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"228 ","pages":"Pages 225-244"},"PeriodicalIF":4.4,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142162808","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":"Inner loop model predictive control and outer loop PI reference governor for PMSMs with input and state saturation for torque control","authors":"Tanja Zwerger , Paolo Mercorelli","doi":"10.1016/j.matcom.2024.08.006","DOIUrl":"10.1016/j.matcom.2024.08.006","url":null,"abstract":"<div><p>This contribution considers a torque control scheme consisting of model predictive control (MPC) in the inner control loop together with PI reference governor in the outer control loop and a decoupling feedforward control for an isotropic permanent magnet synchronous machine (PMSM). This innovative approach is known in literature as PI-MPC dual loop control. A particular emphasis is given to the control governor strategy which is the outer loop PI reference governor and allows to regulate the machine in the flux weakening region and is therefore only active for field weakening. In this context the analysis of the stability based on Lyapunov’ approach of the control loop in flux weakening region is shown. The desired currents represent the reference currents for the MPC, which forms the inner control loop. The MPC is adapted using an extended Kalman filter (EKF), which estimates inductance of the electrical system in <span><math><mrow><mi>d</mi><mi>q</mi></mrow></math></span> coordinates by using a bivariate polynomial. Compared measurements with a hardware-in-the-loop (HIL) system show the effectiveness of the proposed control scheme with respect to a standard PI controller in inner loop (PI-PI scheme) in the presence of saturated inputs and state of a PMSM. The proposed MPC uses just an optimal, proportional control and thus avoids windup effects. Measurement results in the presence of input and state saturations show that MPC is working without overshoot in the currents which leads to less needed power in input.</p></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"228 ","pages":"Pages 178-201"},"PeriodicalIF":4.4,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0378475424003082/pdfft?md5=22b1f02acafad37d2142c8fc049c7498&pid=1-s2.0-S0378475424003082-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142151375","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":"Uniform convergence of finite element method on Bakhvalov-type mesh for a 2-D singularly perturbed convection–diffusion problem with exponential layers","authors":"Jin Zhang, Chunxiao Zhang","doi":"10.1016/j.matcom.2024.08.032","DOIUrl":"10.1016/j.matcom.2024.08.032","url":null,"abstract":"<div><p>Analyzing uniform convergence of finite element method for a 2-D singularly perturbed convection–diffusion problem with exponential layers on Bakhvalov-type mesh remains a complex, unsolved problem. Previous attempts to address this issue have encountered significant obstacles, largely due to the constraints imposed by a specific mesh. These difficulties stem from three primary factors: the width of the mesh subdomain adjacent to the transition point, constraints imposed by the Dirichlet boundary condition, and the structural characteristics of exponential layers. In response to these challenges, this paper introduces a novel analysis technique that leverages the properties of interpolation and the relationship between the smooth function and the layer function on the boundary. By combining this technique with a simplified interpolation, we establish the uniform convergence of optimal order <span><math><mi>k</mi></math></span> under an energy norm for finite element method of any order <span><math><mi>k</mi></math></span>. Numerical experiments validate our theoretical findings.</p></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"228 ","pages":"Pages 39-51"},"PeriodicalIF":4.4,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142122036","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}