Pub Date : 2026-10-01Epub Date: 2025-12-22DOI: 10.1016/j.nonrwa.2025.104583
Qian Jiang , Zhijun Liu , Lianwen Wang
This work proposes a novel age-structured tuberculosis (TB) model to evaluate the impact of pre- and post-exposure vaccinations on TB control, explicitly incorporating the waning of vaccine-induced efficacy over time. Mathematically, we establish a broadly applicable analytical framework for rigorously proving the global stability of steady states in the age-structured model. Furthermore, we formulate an optimal control problem with time-dependent vaccination schedules, identifying cost-effective vaccination strategies under realistic resource constraints. Epidemiologically, our analysis indicates that a combined vaccination strategy is most effective overall. While pre-exposure vaccination proves superior for long-term outbreak control, high-intensity post-exposure vaccination is crucial in high-exposure scenarios to rapidly reduce infected cases. This offers valuable insights for evaluating vaccination-based prevention and control strategies.
{"title":"Global stability analysis and optimal vaccination strategy for an age-structured tuberculosis model with general incidence","authors":"Qian Jiang , Zhijun Liu , Lianwen Wang","doi":"10.1016/j.nonrwa.2025.104583","DOIUrl":"10.1016/j.nonrwa.2025.104583","url":null,"abstract":"<div><div>This work proposes a novel age-structured tuberculosis (TB) model to evaluate the impact of pre- and post-exposure vaccinations on TB control, explicitly incorporating the waning of vaccine-induced efficacy over time. Mathematically, we establish a broadly applicable analytical framework for rigorously proving the global stability of steady states in the age-structured model. Furthermore, we formulate an optimal control problem with time-dependent vaccination schedules, identifying cost-effective vaccination strategies under realistic resource constraints. Epidemiologically, our analysis indicates that a combined vaccination strategy is most effective overall. While pre-exposure vaccination proves superior for long-term outbreak control, high-intensity post-exposure vaccination is crucial in high-exposure scenarios to rapidly reduce infected cases. This offers valuable insights for evaluating vaccination-based prevention and control strategies.</div></div>","PeriodicalId":49745,"journal":{"name":"Nonlinear Analysis-Real World Applications","volume":"91 ","pages":"Article 104583"},"PeriodicalIF":1.8,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145841566","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-10-01Epub Date: 2025-12-30DOI: 10.1016/j.nonrwa.2025.104587
Samuel Carlos S. Ferreira , Bruno R. Freitas , João Carlos R. Medrado
We analyze a 3D discontinuous piecewise linear dynamical system, , with a plane Σ as its switching manifold, which contains two-fold intersection straight lines. The eigenvalues associated with DX and DY are composed of one real eigenvalue and a pair of complex conjugate eigenvalues. A canonical form is obtained using changes in variables and parameters. Two half-return Poincaré maps are generated from two closing equations derived from exponential matrices, leading to a displacement map Δ. Using the Weierstrass Preparation Theorem, we prove the existence of a subclass within this family that admits at least one large amplitude limit cycle. When the real part of the complex eigenvalues is non-zero, the restriction of Δ to space W, formed by the concatenation of bi-dimensional focal planes associated with the complex eigenvalues, can have up to three positive zeros on W ∩ Σ, corresponding to three large amplitude limit cycles. We provide examples with one, two, and three limit cycles.
{"title":"Limit cycles of 3D piecewise linear systems with concurrent tangent lines","authors":"Samuel Carlos S. Ferreira , Bruno R. Freitas , João Carlos R. Medrado","doi":"10.1016/j.nonrwa.2025.104587","DOIUrl":"10.1016/j.nonrwa.2025.104587","url":null,"abstract":"<div><div>We analyze a 3D discontinuous piecewise linear dynamical system, <span><math><mrow><mi>Z</mi><mo>=</mo><mrow><mo>(</mo><mi>X</mi><mo>,</mo><mi>Y</mi><mo>)</mo></mrow></mrow></math></span>, with a plane Σ as its switching manifold, which contains two-fold intersection straight lines. The eigenvalues associated with <em>DX</em> and <em>DY</em> are composed of one real eigenvalue and a pair of complex conjugate eigenvalues. A canonical form is obtained using changes in variables and parameters. Two half-return Poincaré maps are generated from two closing equations derived from exponential matrices, leading to a displacement map Δ. Using the Weierstrass Preparation Theorem, we prove the existence of a subclass within this family that admits at least one large amplitude limit cycle. When the real part of the complex eigenvalues is non-zero, the restriction of Δ to space <em>W</em>, formed by the concatenation of bi-dimensional focal planes associated with the complex eigenvalues, can have up to three positive zeros on <em>W</em> ∩ Σ, corresponding to three large amplitude limit cycles. We provide examples with one, two, and three limit cycles.</div></div>","PeriodicalId":49745,"journal":{"name":"Nonlinear Analysis-Real World Applications","volume":"91 ","pages":"Article 104587"},"PeriodicalIF":1.8,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145885261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-10-01Epub Date: 2026-01-06DOI: 10.1016/j.nonrwa.2025.104599
Youseung Cho, Minsuk Yang
We study smooth solutions to the three-dimensional stationary Navier–Stokes equations and establish new Liouville-type theorems under refined decay assumptions. Building on the work of Cho et al., we introduce a refinement to previously known integrability criteria and analyze the associated averaged quantities. Our main result shows that if the Lp growth rate of a solution remains bounded for some 3/2 < p < 3, then the solution must be trivial. The proof combines averaged decay estimates, energy inequalities, and an iteration scheme.
我们研究了三维平稳Navier-Stokes方程的光滑解，并在精细衰变假设下建立了新的liouville型定理。在Cho等人的工作基础上，我们引入了对先前已知的可积性准则的改进，并分析了相关的平均量。我们的主要结果表明，如果一个解的Lp增长率在3/2的范围内保持有界 <； p <； 3，那么该解一定是平凡的。该证明结合了平均衰减估计、能量不等式和迭代方案。
{"title":"Refined Liouville-type theorems for the stationary Navier–Stokes equations","authors":"Youseung Cho, Minsuk Yang","doi":"10.1016/j.nonrwa.2025.104599","DOIUrl":"10.1016/j.nonrwa.2025.104599","url":null,"abstract":"<div><div>We study smooth solutions to the three-dimensional stationary Navier–Stokes equations and establish new Liouville-type theorems under refined decay assumptions. Building on the work of Cho et al., we introduce a refinement to previously known integrability criteria and analyze the associated averaged quantities. Our main result shows that if the <em>L<sup>p</sup></em> growth rate of a solution remains bounded for some 3/2 < <em>p</em> < 3, then the solution must be trivial. The proof combines averaged decay estimates, energy inequalities, and an iteration scheme.</div></div>","PeriodicalId":49745,"journal":{"name":"Nonlinear Analysis-Real World Applications","volume":"91 ","pages":"Article 104599"},"PeriodicalIF":1.8,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145926980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-10-01Epub Date: 2026-01-22DOI: 10.1016/j.nonrwa.2026.104604
Kh Zennir , S. Bousserhane Reda , T. Miyasita , S.G. Georgiev , K. Bouhali
The study of finite-time blow-up of solutions for coupled systems is a complex and intriguing topic in the theory of partial differential equations, especially when the coupling comes from nonlinear memory sources. This area concerns understanding when the local solutions may “blow up”, meaning they become unbounded in a finite time. The purpose of this study is to use the proof by contradiction to show the finite-time blow-up of solutions for the problem of coupled nonlinear waves in the structural damped model with nonlinear memory sources under certain regularity properties and conditions on the exponents.
{"title":"Finite time blow up of solutions for coupled system of wave equations with nonlinear memory terms","authors":"Kh Zennir , S. Bousserhane Reda , T. Miyasita , S.G. Georgiev , K. Bouhali","doi":"10.1016/j.nonrwa.2026.104604","DOIUrl":"10.1016/j.nonrwa.2026.104604","url":null,"abstract":"<div><div>The study of finite-time blow-up of solutions for coupled systems is a complex and intriguing topic in the theory of partial differential equations, especially when the coupling comes from nonlinear memory sources. This area concerns understanding when the local solutions may “blow up”, meaning they become unbounded in a finite time. The purpose of this study is to use the proof by contradiction to show the finite-time blow-up of solutions for the problem of coupled nonlinear waves in the structural damped model with nonlinear memory sources under certain regularity properties and conditions on the exponents.</div></div>","PeriodicalId":49745,"journal":{"name":"Nonlinear Analysis-Real World Applications","volume":"91 ","pages":"Article 104604"},"PeriodicalIF":1.8,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146037632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-10-01Epub Date: 2026-02-22DOI: 10.1016/j.cam.2026.117493
Megha Varshney , Davut Izci , Serdar Ekinci
Achieving the right trade-off between exploration and exploitation is a critical hurdle in nature-inspired optimization algorithms, particularly when addressing complex, real-world global optimization problems. Maintaining this balance allows the algorithm's agents to efficiently investigate unexplored regions of the search space. The Attaining and Refining Knowledge-Based Optimization Algorithm (ARKO) is a recently developed metaheuristic that draws inspiration from human learning behavior, utilizing shared knowledge across the population to guide the search process. However, ARKO sometimes fails to locate the best solutions, getting trapped in suboptimal points, which results in early convergence and obstructs the discovery of global optima. To overcome these shortcomings, this research introduces an improved version called, DOL (Dynamic Opposition Learning) inspired Attaining-Refining Knowledge based Optimization (DARKO), aimed at enhancing the interplay between exploration and exploitation while avoiding local traps. The approach strengthens ARKO’s exploratory capacity by incorporating Dynamic Oppositional Learning (DOL) that ensures a harmonious balance between the two phases by using its dynamic search process. With its adaptable search domain and minimal computational overhead, the DOL-inspired ARKO mechanism boosts exploration efficiency and supports robust convergence toward superior solutions, effectively curbing premature convergence. The effectiveness of DARKO is assessed using the widely recognized IEEE CEC 2019 and IEEE CEC 2022 benchmark suites, complemented by three practical engineering applications. Comparative analysis with established metaheuristic methods, supported by quantitative data, demonstrates DARKO’s remarkable proficiency and optimization ability.
{"title":"Dynamic opposition learning enhanced attaining and refining knowledge-based optimization algorithm for application to engineering design problems","authors":"Megha Varshney , Davut Izci , Serdar Ekinci","doi":"10.1016/j.cam.2026.117493","DOIUrl":"10.1016/j.cam.2026.117493","url":null,"abstract":"<div><div>Achieving the right trade-off between exploration and exploitation is a critical hurdle in nature-inspired optimization algorithms, particularly when addressing complex, real-world global optimization problems. Maintaining this balance allows the algorithm's agents to efficiently investigate unexplored regions of the search space. The Attaining and Refining Knowledge-Based Optimization Algorithm (ARKO) is a recently developed metaheuristic that draws inspiration from human learning behavior, utilizing shared knowledge across the population to guide the search process. However, ARKO sometimes fails to locate the best solutions, getting trapped in suboptimal points, which results in early convergence and obstructs the discovery of global optima. To overcome these shortcomings, this research introduces an improved version called, DOL (Dynamic Opposition Learning) inspired Attaining-Refining Knowledge based Optimization (DARKO), aimed at enhancing the interplay between exploration and exploitation while avoiding local traps. The approach strengthens ARKO’s exploratory capacity by incorporating Dynamic Oppositional Learning (DOL) that ensures a harmonious balance between the two phases by using its dynamic search process. With its adaptable search domain and minimal computational overhead, the DOL-inspired ARKO mechanism boosts exploration efficiency and supports robust convergence toward superior solutions, effectively curbing premature convergence. The effectiveness of DARKO is assessed using the widely recognized IEEE CEC 2019 and IEEE CEC 2022 benchmark suites, complemented by three practical engineering applications. Comparative analysis with established metaheuristic methods, supported by quantitative data, demonstrates DARKO’s remarkable proficiency and optimization ability.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117493"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147386896","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 : 2026-10-01Epub Date: 2026-02-26DOI: 10.1016/j.cam.2026.117465
Massimo Costabile, Emilio Russo, Fabio Viviano
The paper proposes a lattice-based approximation for pricing bonds and interest-sensitive claims when short-term interest rates fluctuate according to an Ornstein-Uhlenbeck process with the sticky reflecting boundary at zero. The framework is of particular interest when central banks adopt zero interest rate policies, e.g., the US monetary policy response to the financial crisis in 2008. The proposed model provides an evaluation instrument, useful for practitioners too, that is able to manage easily the sticky reflecting feature, thus avoiding to resort to the complex evaluation formulas that can arise when embedding such a feature in the considered dynamics. The underlying interest rate process is discretized through a recombining binomial lattice in which the number of nodes grows up linearly with the number of time steps. The resulting algorithm is applied to evaluate bonds and interest-sensitive claims in order to show its accuracy and efficiency.
{"title":"Efficient pricing of interest rate derivatives under a sticky diffusion","authors":"Massimo Costabile, Emilio Russo, Fabio Viviano","doi":"10.1016/j.cam.2026.117465","DOIUrl":"10.1016/j.cam.2026.117465","url":null,"abstract":"<div><div>The paper proposes a lattice-based approximation for pricing bonds and interest-sensitive claims when short-term interest rates fluctuate according to an Ornstein-Uhlenbeck process with the sticky reflecting boundary at zero. The framework is of particular interest when central banks adopt zero interest rate policies, e.g., the US monetary policy response to the financial crisis in 2008. The proposed model provides an evaluation instrument, useful for practitioners too, that is able to manage easily the sticky reflecting feature, thus avoiding to resort to the complex evaluation formulas that can arise when embedding such a feature in the considered dynamics. The underlying interest rate process is discretized through a recombining binomial lattice in which the number of nodes grows up linearly with the number of time steps. The resulting algorithm is applied to evaluate bonds and interest-sensitive claims in order to show its accuracy and efficiency.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117465"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147386999","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 : 2026-10-01Epub Date: 2026-02-26DOI: 10.1016/j.cam.2026.117521
Janez Puhan, Árpád Bűrmen
The paper outlines the derivation of optimal parameter values for the Nelder–Mead simplex algorithm as a function of the optimization problem’s dimension. The derivation applies to a general, strictly convex quadratic objective function, under the assumption that the simplex’s centroid probability density function within the ellipsoid defined by the simplex’s worst vertex is independent of the centroid’s distance to the worst vertex. The derived dependences of the Nelder–Mead simplex algorithm parameters show similarities with the heuristic solutions proposed so far. The algorithm’s performance, relative to its default parameter settings, was tested on a quadratic function in 10, 20, 50, and 100 dimensions.
{"title":"On the optimal parameter values of the Nelder–Mead simplex algorithm","authors":"Janez Puhan, Árpád Bűrmen","doi":"10.1016/j.cam.2026.117521","DOIUrl":"10.1016/j.cam.2026.117521","url":null,"abstract":"<div><div>The paper outlines the derivation of optimal parameter values for the Nelder–Mead simplex algorithm as a function of the optimization problem’s dimension. The derivation applies to a general, strictly convex quadratic objective function, under the assumption that the simplex’s centroid probability density function within the ellipsoid defined by the simplex’s worst vertex is independent of the centroid’s distance to the worst vertex. The derived dependences of the Nelder–Mead simplex algorithm parameters show similarities with the heuristic solutions proposed so far. The algorithm’s performance, relative to its default parameter settings, was tested on a quadratic function in 10, 20, 50, and 100 dimensions.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117521"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147387002","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 : 2026-10-01Epub Date: 2026-02-18DOI: 10.1016/j.cam.2026.117462
Imen Ferjani
In this work, we study relatively generalized weakly demicompact (GWMD) operators on Banach spaces, a class that extends several compactness-type notions used in operator theory and applications. We give a new characterization of GWMD operators using the De Blasi measure of noncompactness and related weak noncompactness measures, yielding practical criteria for verifying this property. We also prove that the GWMD operators are stable under a class of perturbations. Next, we analyze 2 × 2 block operator matrices and derive simple conditions under which the full block matrix is GWMD. To illustrate the theoretical results, numerical experiments are conducted for weighted-shift and Volterra-type operators using finite-dimensional truncations and finite element discretizations. The experiments confirm the predicted stability and spectral decay behavior, showing that the theoretical properties persist under numerical approximation.
{"title":"Characterization and numerical simulations of relative generalized weak demicompact operators","authors":"Imen Ferjani","doi":"10.1016/j.cam.2026.117462","DOIUrl":"10.1016/j.cam.2026.117462","url":null,"abstract":"<div><div>In this work, we study relatively generalized weakly demicompact (GWMD) operators on Banach spaces, a class that extends several compactness-type notions used in operator theory and applications. We give a new characterization of GWMD operators using the De Blasi measure of noncompactness and related weak noncompactness measures, yielding practical criteria for verifying this property. We also prove that the GWMD operators are stable under a class of perturbations. Next, we analyze 2 × 2 block operator matrices and derive simple conditions under which the full block matrix is GWMD. To illustrate the theoretical results, numerical experiments are conducted for weighted-shift and Volterra-type operators using finite-dimensional truncations and finite element discretizations. The experiments confirm the predicted stability and spectral decay behavior, showing that the theoretical properties persist under numerical approximation.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117462"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147386623","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 : 2026-10-01Epub Date: 2026-02-21DOI: 10.1016/j.cam.2026.117502
Nguyen Van Hung , Nguyen Huynh Vu Duy , Jen Chih Yao , Shengda Zeng
The goal of this paper is to study the convergence analysis of solution sets to fuzzy weak vector quasi-equilibrium problems. Firstly, we introduce some weak vector quasi-equilibrium problems in fuzzy environment. Secondly, we establish several sufficient conditions for the upper convergence for these problems. Thirdly, the auxiliary subsets of solution sets to fuzzy weak vector quasi-equilibrium problems and the concept of weakly K-quasi-concavity of the objective function are obtained. Results on the lower convergence and convergence of the solution sets based on the auxiliary subsets and the concept of weakly K-quasi-concavity for fuzzy weak vector quasi-equilibrium problems are established and studied. Finally, as an application, we consider the upper convergence, lower convergence and convergence of the solution sets of fuzzy vector quasi-optimization problems. Our results in this paper are new and different from some main results in the literature. Many examples are given for the illustration of our results.
{"title":"Convergence analysis of solutions to fuzzy weak vector quasi-equilibrium problems and applications","authors":"Nguyen Van Hung , Nguyen Huynh Vu Duy , Jen Chih Yao , Shengda Zeng","doi":"10.1016/j.cam.2026.117502","DOIUrl":"10.1016/j.cam.2026.117502","url":null,"abstract":"<div><div>The goal of this paper is to study the convergence analysis of solution sets to fuzzy weak vector quasi-equilibrium problems. Firstly, we introduce some weak vector quasi-equilibrium problems in fuzzy environment. Secondly, we establish several sufficient conditions for the upper convergence for these problems. Thirdly, the auxiliary subsets of solution sets to fuzzy weak vector quasi-equilibrium problems and the concept of weakly <em>K</em>-quasi-concavity of the objective function are obtained. Results on the lower convergence and convergence of the solution sets based on the auxiliary subsets and the concept of weakly <em>K</em>-quasi-concavity for fuzzy weak vector quasi-equilibrium problems are established and studied. Finally, as an application, we consider the upper convergence, lower convergence and convergence of the solution sets of fuzzy vector quasi-optimization problems. Our results in this paper are new and different from some main results in the literature. Many examples are given for the illustration of our results.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117502"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147386629","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 : 2026-10-01Epub Date: 2026-02-24DOI: 10.1016/j.cam.2026.117540
Danilo Costarelli, Michele Piconi
In this paper, we provide two algorithms based on the theory of multidimensional neural network (NN) operators activated by hyperbolic tangent sigmoidal functions. Theoretical results are recalled to justify the performance of the here implemented algorithms. Specifically, the first algorithm models multidimensional signals (such as digital images), while the second one addresses the problem of rescaling and enhancement of the considered data. The asymptotic computational complexity of the proposed algorithms is also analyzed. Several applications of the NN-based algorithms for modeling and rescaling/enhancement remote sensing data (represented as images) are discussed, together with numerical experiments conducted on a selection of remote sensing (RS) images from the (open access) RETINA dataset. A comparison with classical interpolation methods, such as bilinear and bicubic interpolation, shows that the proposed algorithms outperform the others, particularly in terms of the Structural Similarity Index (SSIM).
{"title":"Implementation of neural network operators with applications to remote sensing data","authors":"Danilo Costarelli, Michele Piconi","doi":"10.1016/j.cam.2026.117540","DOIUrl":"10.1016/j.cam.2026.117540","url":null,"abstract":"<div><div>In this paper, we provide two algorithms based on the theory of multidimensional neural network (NN) operators activated by hyperbolic tangent sigmoidal functions. Theoretical results are recalled to justify the performance of the here implemented algorithms. Specifically, the first algorithm models multidimensional signals (such as digital images), while the second one addresses the problem of rescaling and enhancement of the considered data. The asymptotic computational complexity of the proposed algorithms is also analyzed. Several applications of the NN-based algorithms for modeling and rescaling/enhancement remote sensing data (represented as images) are discussed, together with numerical experiments conducted on a selection of remote sensing (RS) images from the (open access) RETINA dataset. A comparison with classical interpolation methods, such as bilinear and bicubic interpolation, shows that the proposed algorithms outperform the others, particularly in terms of the Structural Similarity Index (SSIM).</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"484 ","pages":"Article 117540"},"PeriodicalIF":2.6,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147386636","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}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号