scholarly journals Latent Infectious Capacities of Dengue Fever: Mathematical Modeling and Eco-Friendly Prevention Strategy

Symmetry ◽  
2020 ◽  
Vol 12 (2) ◽  
pp. 263
Author(s):  
Chung-Chien Hong ◽  
Wei-Shih Du ◽  
Yu-Hong Ge
Keyword(s):  
Mathematical Modeling ◽  
Dengue Fever ◽  
Iterative Scheme ◽  
High Capacity ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Public Data ◽  
The Split Feasibility Problem ◽  
Split Feasibility ◽  
Kaohsiung City

The main aim of this article is to propose a method for exploring the latent values about the capacities of spreading dengue for each potential site. First, a mathematical model connecting the observable public data and the capacities of spreading dengue is provided based on the split feasibility problem (SFP). Then, a proper iterative scheme for the SFP is presented to approach the values of infectious capacities (ICs) of potential sites—the capacities of spreading. The performance of our proposed method is demonstrated using public data from Kaohsiung City for 2014 and 2015. The results presented in this paper show that our proposed method is reliable and the sites with a high capacity of spreading are only a small portion of thousands of all potential sites and could be an alternative strategy for preventing the outbreak of dengue fever whilst also avoiding the damage of ecosystems caused by chemical insecticides.

A halpern-type iteration for solving the split feasibility problem and the fixed point problem of Bregman relatively nonexpansive semigroup in Banach spaces

Filomat ◽  
2018 ◽  
Vol 32 (9) ◽  
pp. 3211-3227 ◽  
Author(s):  
Prasit Cholamjiak ◽  
Pongsakorn Sunthrayuth
Keyword(s):  
Fixed Point ◽  
Banach Spaces ◽  
Iterative Scheme ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Strong Convergence Theorem ◽  
Nonexpansive Semigroup ◽  
Relatively Nonexpansive ◽  
The Split Feasibility Problem ◽  
Split Feasibility

We study the split feasibility problem (SFP) involving the fixed point problems (FPP) in the framework of p-uniformly convex and uniformly smooth Banach spaces. We propose a Halpern-type iterative scheme for solving the solution of SFP and FPP of Bregman relatively nonexpansive semigroup. Then we prove its strong convergence theorem of the sequences generated by our iterative scheme under implemented conditions. We finally provide some numerical examples and demonstrate the efficiency of the proposed algorithm. The obtained result of this paper complements many recent results in this direction.

scholarly journals A Modified Halpern's Iterative Scheme for Solving Split Feasibility Problems

2012 ◽  
Vol 2012 ◽  
pp. 1-8 ◽  
Author(s):  
Jitsupa Deepho ◽  
Poom Kumam
Keyword(s):  
Hilbert Space ◽  
Hilbert Spaces ◽  
Iterative Scheme ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Strong Convergence Theorem ◽  
Infinite Dimensional ◽  
Infinite Dimensional Hilbert Space ◽  
The Split Feasibility Problem ◽  
Split Feasibility

The purpose of this paper is to introduce and study a modified Halpern’s iterative scheme for solving the split feasibility problem (SFP) in the setting of infinite-dimensional Hilbert spaces. Under suitable conditions a strong convergence theorem is established. The main result presented in this paper improves and extends some recent results done by Xu (Iterative methods for the split feasibility problem in infinite-dimensional Hilbert space, Inverse Problem 26 (2010) 105018) and some others.

An iterative algorithm with inertial technique for solving the split common null point problem in Banach spaces

2021 ◽  
pp. 2250120
Author(s):  
Yan Tang ◽  
Pongsakorn Sunthrayuth
Keyword(s):  
Banach Spaces ◽  
Split Feasibility Problem ◽  
Null Point ◽  
Feasibility Problem ◽  
Strong Convergence Theorem ◽  
Point Problem ◽  
Inertial Algorithm ◽  
The Split Feasibility Problem ◽  
Inertial Technique ◽  
Split Feasibility

In this work, we introduce a modified inertial algorithm for solving the split common null point problem without the prior knowledge of the operator norms in Banach spaces. The strong convergence theorem of our method is proved under suitable assumptions. We apply our result to the split feasibility problem, split equilibrium problem and split minimization problem. Finally, we provide some numerical experiments including compressed sensing to illustrate the performances of the proposed method. The result presented in this paper improves and generalizes many recent important results in the literature.

scholarly journals New Inertial Relaxed CQ Algorithms for Solving Split Feasibility Problems in Hilbert Spaces

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Haiying Li ◽  
Yulian Wu ◽  
Fenghui Wang
Keyword(s):  
Hilbert Spaces ◽  
Split Feasibility Problem ◽  
Linear Operators ◽  
Feasibility Problem ◽  
Variable Step Size ◽  
Step Size ◽  
Bounded Linear ◽  
Variable Step ◽  
The Split Feasibility Problem ◽  
Split Feasibility

The split feasibility problem SFP has received much attention due to its various applications in signal processing and image reconstruction. In this paper, we propose two inertial relaxed C Q algorithms for solving the split feasibility problem in real Hilbert spaces according to the previous experience of applying inertial technology to the algorithm. These algorithms involve metric projections onto half-spaces, and we construct new variable step size, which has an exact form and does not need to know a prior information norm of bounded linear operators. Furthermore, we also establish weak and strong convergence of the proposed algorithms under certain mild conditions and present a numerical experiment to illustrate the performance of the proposed algorithms.

Sign in / Sign up

Export Citation Format

Share Document