URN 
etd0629110163913 
Author 
WeiJie Liang 
Author's Email Address 
No Public. 
Statistics 
This thesis had been viewed 5065 times. Download 0 times. 
Department 
Applied Mathematics 
Year 
2009 
Semester 
2 
Degree 
Master 
Type of Document 

Language 
English 
Title 
Averaged mappings and it's applications 
Date of Defense 
20100617 
Page Count 
24 
Keyword 
split feasibility problem
weak convergence
multipleset split feasibility problem
Krasnosel'skiiMann algorithm
averaged mapping
nonexpansive mapping

Abstract 
A sequence fxng generates by the formula x_{n+1} =(1 α\_n)x_n+ α\_nT_nx_n is called the Krasnosel'skiiMann algorithm, where {α\_n} is a sequence in (0,1) and {T_n} is a sequence of nonexpansive mappings. We introduce KM algorithm and prove that the sequence fxng generated by KM algorithm converges weakly. This result is used to solve the split feasibility problem which is to find a point x with the property that x ∈ C and Ax ∈ Q, where C and Q are closed convex subsets form H1 to H2, respectively, and A is a bounded linear operator form H1 to H2. The purpose of this paper is to present some results which apply KM algorithm to solve the split feasibility problem, the multipleset split feasibility problem and other applications. 
Advisory Committee 
none  chair
JenChih Yao  cochair
NgaiChing Wong  cochair
HongKun Xu  advisor

Files 
indicate not accessible 
Date of Submission 
20100629 