Pub Date : 2025-01-28DOI: 10.1016/j.matcom.2025.01.017
Xiaoliang Li , Jing Yang , Ally Quan Zhang
This paper examines a monopoly market featured by a general isoelastic demand function. With a quadratic cost function for the monopolist, we explore how the price elasticity of demand influences monopolistic behavior under different (decreasing, constant, and increasing) returns to scale. The combination of the general isoelastic demand and quadratic cost functions leads to a transcendental equilibrium equation, making closed-form solutions unattainable. To address this challenge, we develop an innovative approach that leverages the specific structure of marginal revenue and cost to conduct a comprehensive comparative static and stability analysis. Additionally, we introduce two dynamic models based on distinct adjustment mechanisms: gradient and local monopolistic approximation (LMA). Our findings reveal that the LMA model is more stable in both parameter and state spaces compared to the gradient model. Notably, we prove that the unique non-vanishing equilibrium of the LMA model is globally asymptotically stable.
{"title":"Influence of price elasticity of demand on monopoly games under different returns to scale","authors":"Xiaoliang Li , Jing Yang , Ally Quan Zhang","doi":"10.1016/j.matcom.2025.01.017","DOIUrl":"10.1016/j.matcom.2025.01.017","url":null,"abstract":"<div><div>This paper examines a monopoly market featured by a general isoelastic demand function. With a quadratic cost function for the monopolist, we explore how the price elasticity of demand influences monopolistic behavior under different (decreasing, constant, and increasing) returns to scale. The combination of the general isoelastic demand and quadratic cost functions leads to a transcendental equilibrium equation, making closed-form solutions unattainable. To address this challenge, we develop an innovative approach that leverages the specific structure of marginal revenue and cost to conduct a comprehensive comparative static and stability analysis. Additionally, we introduce two dynamic models based on distinct adjustment mechanisms: gradient and local monopolistic approximation (LMA). Our findings reveal that the LMA model is more stable in both parameter and state spaces compared to the gradient model. Notably, we prove that the unique non-vanishing equilibrium of the LMA model is globally asymptotically stable.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"233 ","pages":"Pages 75-98"},"PeriodicalIF":4.4,"publicationDate":"2025-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143226663","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}
Pub Date : 2025-01-28DOI: 10.1016/S0378-4754(25)00027-8
{"title":"News of IMACS","authors":"","doi":"10.1016/S0378-4754(25)00027-8","DOIUrl":"10.1016/S0378-4754(25)00027-8","url":null,"abstract":"","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"231 ","pages":"Page 352"},"PeriodicalIF":4.4,"publicationDate":"2025-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143133917","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}
Pub Date : 2025-01-28DOI: 10.1016/S0378-4754(25)00028-X
{"title":"IMACS Calendar of Events","authors":"","doi":"10.1016/S0378-4754(25)00028-X","DOIUrl":"10.1016/S0378-4754(25)00028-X","url":null,"abstract":"","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"231 ","pages":"Page 353"},"PeriodicalIF":4.4,"publicationDate":"2025-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143133918","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}
Pub Date : 2025-01-27DOI: 10.1016/j.matcom.2025.01.019
Alberto M. Bersani , Alessandro Borri , Giovanna Tomassetti , Pierluigi Vellucci
In this paper we study the asymptotic properties of the mathematical model of the double phosphorylation (dephosphorylation) enzymatic reaction, or futile cycle. Starting from the total quasi-steady state approximation (tQSSA), and applying singular perturbation techniques, we determine the inner and outer solutions and the corresponding matched expansions, up to the first order, in terms of an appropriate perturbation parameter (related to the kinetic constants and initial conditions of the model). Some numerical results are discussed.
{"title":"Asymptotic expansions beyond the tQSSA for the double phosphorylation mechanism","authors":"Alberto M. Bersani , Alessandro Borri , Giovanna Tomassetti , Pierluigi Vellucci","doi":"10.1016/j.matcom.2025.01.019","DOIUrl":"10.1016/j.matcom.2025.01.019","url":null,"abstract":"<div><div>In this paper we study the asymptotic properties of the mathematical model of the double phosphorylation (dephosphorylation) enzymatic reaction, or futile cycle. Starting from the total quasi-steady state approximation (tQSSA), and applying singular perturbation techniques, we determine the inner and outer solutions and the corresponding matched expansions, up to the first order, in terms of an appropriate perturbation parameter <span><math><mi>ϵ</mi></math></span> (related to the kinetic constants and initial conditions of the model). Some numerical results are discussed.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"233 ","pages":"Pages 137-164"},"PeriodicalIF":4.4,"publicationDate":"2025-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143226662","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}
Pub Date : 2025-01-25DOI: 10.1016/j.matcom.2025.01.016
Néstor García-Chan , Lino J. Alvarez-Vázquez , Aurea Martínez , Miguel E. Vázquez-Méndez
In this paper we propose a novel traffic flow model based on understanding the city as a porous media, this is, streets and building-blocks characterizing the urban landscape are seen now as the fluid-phase and the solid-phase of a porous media, respectively. Moreover, based in the interchange of mass in the porous media models, we can model the interchange of cars between streets and off-street parking-spaces. Therefore, our model is not a standard conservation law, being formulated as the coupling of a non-stationary convection–diffusion–reaction PDE with a Darcy–Brinkman–Forchheimer PDE system. To solve this model, the classical Galerkin finite element method combined with an explicit time marching scheme of strong stability preserving type was enough to stabilize our numerical solutions. Numerical experiences on an urban-porous domain inspired by the city of Guadalajara (Mexico) allow us to simulate the influence of the porosity terms on the traffic speed, the traffic flow at rush-valley hours, and traffic congestion due to the lack of parking spaces.
{"title":"A nonconservative macroscopic traffic flow model in a two-dimensional urban-porous city","authors":"Néstor García-Chan , Lino J. Alvarez-Vázquez , Aurea Martínez , Miguel E. Vázquez-Méndez","doi":"10.1016/j.matcom.2025.01.016","DOIUrl":"10.1016/j.matcom.2025.01.016","url":null,"abstract":"<div><div>In this paper we propose a novel traffic flow model based on understanding the city as a porous media, this is, streets and building-blocks characterizing the urban landscape are seen now as the fluid-phase and the solid-phase of a porous media, respectively. Moreover, based in the interchange of mass in the porous media models, we can model the interchange of cars between streets and off-street parking-spaces. Therefore, our model is not a standard conservation law, being formulated as the coupling of a non-stationary convection–diffusion–reaction PDE with a Darcy–Brinkman–Forchheimer PDE system. To solve this model, the classical Galerkin <span><math><msub><mrow><mi>P</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span> finite element method combined with an explicit time marching scheme of strong stability preserving type was enough to stabilize our numerical solutions. Numerical experiences on an urban-porous domain inspired by the city of Guadalajara (Mexico) allow us to simulate the influence of the porosity terms on the traffic speed, the traffic flow at rush-valley hours, and traffic congestion due to the lack of parking spaces.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"233 ","pages":"Pages 60-74"},"PeriodicalIF":4.4,"publicationDate":"2025-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143226664","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}
Pub Date : 2025-01-23DOI: 10.1016/j.matcom.2025.01.013
Soham Shanbhag, Dong Eui Chang
The estimate of a system state, arrived at using measurements, is often used in design of state controllers in robotics. These measurements are often biased and contain noise. Many such systems usually evolve on matrix Lie groups. In this paper, we propose a globally exponentially convergent observer for systems evolving on matrix Lie groups with bounded velocity. The design of observers on the Lie group prohibits continuous globally convergent observers, which we sidestep by designing the observer in the ambient Euclidean space of the group and show exponential convergence of the observer to the state of the system. The performance of the observer is shown using an example of the rigid body rotation and translation system evolving on the special Euclidean group. We also compare the proposed observer with an observer present in the literature and show the improvements afforded by our observer.
{"title":"Globally exponentially convergent observer for systems evolving on matrix Lie groups","authors":"Soham Shanbhag, Dong Eui Chang","doi":"10.1016/j.matcom.2025.01.013","DOIUrl":"10.1016/j.matcom.2025.01.013","url":null,"abstract":"<div><div>The estimate of a system state, arrived at using measurements, is often used in design of state controllers in robotics. These measurements are often biased and contain noise. Many such systems usually evolve on matrix Lie groups. In this paper, we propose a globally exponentially convergent observer for systems evolving on matrix Lie groups with bounded velocity. The design of observers on the Lie group prohibits continuous globally convergent observers, which we sidestep by designing the observer in the ambient Euclidean space of the group and show exponential convergence of the observer to the state of the system. The performance of the observer is shown using an example of the rigid body rotation and translation system evolving on the special Euclidean group. We also compare the proposed observer with an observer present in the literature and show the improvements afforded by our observer.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"232 ","pages":"Pages 475-482"},"PeriodicalIF":4.4,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143269208","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}
Pub Date : 2025-01-20DOI: 10.1016/j.matcom.2025.01.015
Xin Chen, Zeyu Zhang, Peiqi Huang
This paper investigates linear quadratic (LQ) optimal control problems of forward uncertain and backward stochastic multi-stage systems. First, leveraging dynamic programming, we derive stochastic recursive equations tailored to address an LQ optimal control problem for backward stochastic multi-stage systems within a probabilistic framework. Subsequently, we extend our analysis to an equivalent LQ optimal control problem formulated under chance theory, incorporating both forward uncertain and backward stochastic dynamics. From this, we derive uncertain stochastic recursive equations to solve the equivalent problem and provide explicit analytical expressions for the optimal control strategies and corresponding optimal values. Additionally, we explore the effects of variable separability within uncertain random variables, demonstrating that under chance theory, the optimal solutions of LQ optimal control problems remain consistent when uncertain and random variables are separable. Finally, a numerical example is provided to validate our results.
{"title":"Uncertain stochastic linear quadratic control subject to forward and backward multi-stage systems","authors":"Xin Chen, Zeyu Zhang, Peiqi Huang","doi":"10.1016/j.matcom.2025.01.015","DOIUrl":"10.1016/j.matcom.2025.01.015","url":null,"abstract":"<div><div>This paper investigates linear quadratic (LQ) optimal control problems of forward uncertain and backward stochastic multi-stage systems. First, leveraging dynamic programming, we derive stochastic recursive equations tailored to address an LQ optimal control problem for backward stochastic multi-stage systems within a probabilistic framework. Subsequently, we extend our analysis to an equivalent LQ optimal control problem formulated under chance theory, incorporating both forward uncertain and backward stochastic dynamics. From this, we derive uncertain stochastic recursive equations to solve the equivalent problem and provide explicit analytical expressions for the optimal control strategies and corresponding optimal values. Additionally, we explore the effects of variable separability within uncertain random variables, demonstrating that under chance theory, the optimal solutions of LQ optimal control problems remain consistent when uncertain and random variables are separable. Finally, a numerical example is provided to validate our results.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"233 ","pages":"Pages 1-20"},"PeriodicalIF":4.4,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143226045","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}
Pub Date : 2025-01-18DOI: 10.1016/j.matcom.2025.01.014
Dingding Cao, Changpin Li
In this study, the analysis and computation for quenching phenomenon in the Caputo–Hadamard time-fractional Kawarada problem is investigated. Initial findings confirm that its classical solution exhibits non-negativity and quenching in a finite time. Then the numerical method is established to detect the quenching phenomenon in the considered problem. Numerical simulations are provided to show the effectiveness of the theoretical analysis and computation.
{"title":"Quenching phenomenon in the Caputo–Hadamard time-fractional Kawarada problem: Analysis and computation","authors":"Dingding Cao, Changpin Li","doi":"10.1016/j.matcom.2025.01.014","DOIUrl":"10.1016/j.matcom.2025.01.014","url":null,"abstract":"<div><div>In this study, the analysis and computation for quenching phenomenon in the Caputo–Hadamard time-fractional Kawarada problem is investigated. Initial findings confirm that its classical solution exhibits non-negativity and quenching in a finite time. Then the numerical method is established to detect the quenching phenomenon in the considered problem. Numerical simulations are provided to show the effectiveness of the theoretical analysis and computation.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"233 ","pages":"Pages 21-38"},"PeriodicalIF":4.4,"publicationDate":"2025-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143226046","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}
Pub Date : 2025-01-17DOI: 10.1016/j.matcom.2025.01.012
Marc Vidal , Ana M. Aguilera
We address the mathematical and statistical formalism that underpins optimal estimation of brain activity in artifact-corrupted electroencephalographic (EEG) signals. We argue the reconstruction of artifacts relates to approximating a function in a Hilbert basis that is a realization of a spatio-temporal random variable taking values in a Hilbert space. A model for sparse optimization based on a fixed-point iteration over the spatial domain and posterior enhancement in the temporal domain via wavelet thresholding is discussed under the paradigm of “wide functional data”. Two criteria are introduced for selecting wavelet expansion coefficients in scenarios where noise lacks a precise parametric specification: one based on multiplicative scaling and the other on the entropic NID (ENID), as introduced in Bruni et al. (2020). Through comprehensive numerical simulations and real data analyses of EEG data, we showcase the effectiveness of the proposed methods.
{"title":"Wavelet thresholding on independent subspace factorizations of spatially indexed wide functional data for robust estimation of cortical activity","authors":"Marc Vidal , Ana M. Aguilera","doi":"10.1016/j.matcom.2025.01.012","DOIUrl":"10.1016/j.matcom.2025.01.012","url":null,"abstract":"<div><div>We address the mathematical and statistical formalism that underpins optimal estimation of brain activity in artifact-corrupted electroencephalographic (EEG) signals. We argue the reconstruction of artifacts relates to approximating a function in a Hilbert basis that is a realization of a spatio-temporal random variable taking values in a Hilbert space. A model for sparse optimization based on a fixed-point iteration over the spatial domain and posterior enhancement in the temporal domain via wavelet thresholding is discussed under the paradigm of “wide functional data”. Two criteria are introduced for selecting wavelet expansion coefficients in scenarios where noise lacks a precise parametric specification: one based on multiplicative scaling and the other on the entropic NID (ENID), as introduced in Bruni et al. (2020). Through comprehensive numerical simulations and real data analyses of EEG data, we showcase the effectiveness of the proposed methods.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"232 ","pages":"Pages 346-361"},"PeriodicalIF":4.4,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143269206","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}
Pub Date : 2025-01-17DOI: 10.1016/j.matcom.2025.01.011
Yong Zhang
Image information security is a hot research area in cryptography after text encryption research. To effectively secure digital images, a practical and graceful new image encryption algorithm was proposed in this paper. Firstly, four substitution boxes (S-boxes) are constructed based on the method of generating S-box of AES. Secondly, a chaotic system with uniform probability density function is created by fusing piecewise linear map (PWLM) and Arnold cat map. The resulting system is used to produce an equivalent-key sequence of the same size as the plain image using an external secret key of length 256 bits. Thirdly, a butterfly encoding module based on the butterfly node algorithm is presented. Finally, the basic image cryptosystem based on the butterfly encoding module, the enhanced image cryptosystem with cipher-text sensitivity, and the unified image cryptosystem with identical encryption and decryption processes are sequentially studied. The performance analysis shows that the proposed image encryption systems have a time complexity of 3 and a spatial complexity of approximately 3.03, the generated cipher images are similar to noise images, and the secret key, the equivalent key, and the plain image are all extremely sensitive. Thus, the proposed cryptographies are high-speed and secure image encryption algorithms.
{"title":"Image encryption algorithm based on butterfly module and chaos","authors":"Yong Zhang","doi":"10.1016/j.matcom.2025.01.011","DOIUrl":"10.1016/j.matcom.2025.01.011","url":null,"abstract":"<div><div>Image information security is a hot research area in cryptography after text encryption research. To effectively secure digital images, a practical and graceful new image encryption algorithm was proposed in this paper. Firstly, four substitution boxes (S-boxes) are constructed based on the method of generating S-box of AES. Secondly, a chaotic system with uniform probability density function is created by fusing piecewise linear map (PWLM) and Arnold cat map. The resulting system is used to produce an equivalent-key sequence of the same size as the plain image using an external secret key of length 256 bits. Thirdly, a butterfly encoding module based on the butterfly node algorithm is presented. Finally, the basic image cryptosystem based on the butterfly encoding module, the enhanced image cryptosystem with cipher-text sensitivity, and the unified image cryptosystem with identical encryption and decryption processes are sequentially studied. The performance analysis shows that the proposed image encryption systems have a time complexity of 3 and a spatial complexity of approximately 3.03, the generated cipher images are similar to noise images, and the secret key, the equivalent key, and the plain image are all extremely sensitive. Thus, the proposed cryptographies are high-speed and secure image encryption algorithms.</div></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"232 ","pages":"Pages 382-407"},"PeriodicalIF":4.4,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143269204","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}