检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Wasfi Shatanawi Anwar Bataihah Abdalla Tallafha
机构地区:[1]Department of Mathematics and General Courses,Prince Sultan University,Riyadh,11586,Saudi Arabia [2]Department of Medical Research,China Medical University Hospital,China Medical University,Taichung,40402,Taiwan [3]Department of M-Commerce and Multimedia Applications,Asia University,Taichung,41354,Taiwan [4]Department of Mathematics,School of Science,The University of Jordan,Amman,11942,Jordan
出 处:《Computers, Materials & Continua》2020年第9期1491-1504,共14页计算机、材料和连续体(英文)
摘 要:Fixed point theory is one of the most important subjects in the setting of metric spaces since fixed point theorems can be used to determine the existence and the uniqueness of solutions of such mathematical problems.It is known that many problems in applied sciences and engineering can be formulated as functional equations.Such equations can be transferred to fixed point theorems in an easy manner.Moreover,we use the fixed point theory to prove the existence and uniqueness of solutions of such integral and differential equations.Let X be a non-empty set.A fixed point for a self-mapping T on X is a point𝑒𝑒∈𝑋𝑋that satisfying T e=e.One of the most challenging problems in mathematics is to construct some iterations to faster the calculation or approximation of the fixed point of such problems.Some mathematicians constructed and generated some new iteration schemes to calculate or approximate the fixed point of such problems such as Mann et al.[Mann(1953);Ishikawa(1974);Sintunavarat and Pitea(2016);Berinde(2004b);Agarwal,O’Regan and Sahu(2007)].The main purpose of the present paper is to introduce and construct a new iteration scheme to calculate or approximate the fixed point within a fewer number of steps as much as we can.We prove that our iteration scheme is faster than the iteration schemes given by Sintunavarat et al.[Sintunavarat and Pitea(2016);Agarwal,O’Regan and Sahu(2007);Mann(1953);Ishikawa(1974)].We give some numerical examples by using MATLAB to compare the efficiency and effectiveness of our iterations scheme with the efficiency of Mann et al.[Mann(1953);Ishikawa(1974);Sintunavarat and Pitea(2016);Abbas and Nazir(2014);Agarwal,O’Regan and Sahu(2007)]schemes.Moreover,we introduce a problem raised from Newton’s law of cooling as an application of our new iteration scheme.Also,we support our application with a numerical example and figures to illustrate the validity of our iterative scheme.
关 键 词:Weak contraction fixed point iteration scheme mean value theorem
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.206.183