Numerical Reckoning Fixed Points for Nonexpansive Mappings via a Faster Iteration Process and Its Application to Constrained Minimization Problems, Split Feasibility Problems and Image Deblurring Problems

Chonjaroen Chairatsiripong, Damrongsak Yambangwai, Tanakit Thianwan


In this paper, we introduce a new faster iteration scheme and establish convergence results for approximation of fixed points of nonexpansive mappings in the framework of Banach space. Further, we show that our iteration process is faster than a number of existing iteration processes.  We support our analytic proof by  numerical examples in which we approximate the fixed point by a computer using Matlab program. Furthermore, we apply our results to find solutions of constrained minimization problems, split feasibility problems and image deblurring problems. Our results are the extension, improvement and generalizationof many known results in the literature of iterations in fixed point theory.

Full Text: PDF


  • There are currently no refbacks.

The Thai Journal of Mathematics organized and supported by The Mathematical Association of Thailand and Thailand Research Council and the Center for Promotion of Mathematical Research of Thailand (CEPMART).

Copyright 2020 by the Mathematical Association of Thailand.

All rights reserve. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission of the Mathematical Association of Thailand.

|ISSN 1686-0209|