Normal functions and constructive ordinal notations

1976 ◽  
Vol 41 (2) ◽  
pp. 439-459 ◽  
Author(s):  
Larry W. Miller

An r-normal function is a strictly increasing continuous function from r to r where r is a regular ordinal > ω (identify an ordinal with the set of smaller ordinals). Given an r-normal function f one can form a sequence {f(x, −)}x<r of r-normal functions—the Veblen hierarchy [33] on f—as follows: f(0, −) = f and, for x > 0, f(x, −) enumerates in order {z ∣ f(y, z) = z for all y < x}, the common fixed points of the f(y, −)'s for y < x. In this paper we give as readable an exposition as we can of Veblen hierarchies and of Bachmann's and Isles's techniques in [3] and [15] of using higher finite number classes for forming sequences {f(x, −)}x<y where y > r of r-normal functions which extend the Veblen hierarchy on f. We will show how these sequences—Bachmann hierarchies—yield extremely natural constructive notations for ordinals in various initial segments of the second number class. We will also consider various other techniques for obtaining constructive ordinal notations and relate them to the notations obtained by Bachmann's and Isles's techniques. In particular, we will use these notations to characterize as directly and as usefully as we can various of Takeuti's systems of constructive ordinal notations, which he calls ordinal diagrams ([31], [32]).

2004 ◽  
Vol 2004 (37) ◽  
pp. 1965-1971 ◽  
Author(s):  
Hafiz Fukhar-ud-din ◽  
Safeer Hussain Khan

A two-step iterative scheme with errors has been studied to approximate the common fixed points of two asymptotically nonexpansive mappings through weak and strong convergence in Banach spaces.


2018 ◽  
Vol 51 (1) ◽  
pp. 233-240 ◽  
Author(s):  
Badr Alqahtani ◽  
Andreea Fulga ◽  
Erdal Karapınar

Abstract In this paper, we propose a new contraction type for two self-mappings and investigate the necessary conditions for the existence and uniqueness of coincidence points and common fixed points, respectively. We put some examples to illustrate our main results.


2012 ◽  
Vol 2012 ◽  
pp. 1-12
Author(s):  
Rudong Chen

Fixed point (especially, the minimum norm fixed point) computation is an interesting topic due to its practical applications in natural science. The purpose of the paper is devoted to finding the common fixed points of an infinite family of nonexpansive mappings. We introduce an iterative algorithm and prove that suggested scheme converges strongly to the common fixed points of an infinite family of nonexpansive mappings under some mild conditions. As a special case, we can find the minimum norm common fixed point of an infinite family of nonexpansive mappings.


2010 ◽  
Vol 2010 ◽  
pp. 1-11 ◽  
Author(s):  
J. O. Olaleru ◽  
H. Akewe

We introduce the Jungck-multistep iteration and show that it converges strongly to the unique common fixed point of a pair of weakly compatible generalized contractive-like operators defined on a Banach space. As corollaries, the results show that the Jungck-Mann, Jungck-Ishikawa, and Jungck-Noor iterations can also be used to approximate the common fixed points of such maps. The results are improvements, generalizations, and extensions of the work of Olatinwo and Imoru (2008), Olatinwo (2008). Consequently, several results in literature are generalized.


2013 ◽  
Vol 2013 ◽  
pp. 1-8
Author(s):  
Yaqin Wang

A viscosity method for hierarchical fixed point problems is presented to solve variational inequalities, where the involved mappings are nonexpansive nonself-mappings. Solutions are sought in the set of the common fixed points of an infinite family of nonexpansive nonself-mappings. The results generalize and improve the recent results announced by many other authors.


Author(s):  
Ashis Bera ◽  
Ankush Chanda ◽  
Lakshmi Kanta Dey

In this article, we propose the Abbas-Nazir three step iteration scheme and employ the algorithm to study the common fixed points of a pair of generalized $\alpha$-Reich-Suzuki non-expansive mappings defined on a Banach space. Moreover, we explore a few weak and strong convergence results concerning such mappings. Our findings are aptly validated by non-trivial and constructive numerical examples and finally, we compare our results with that of the other noteworthy iterative schemes utilizing MATLAB $2017$a software. However, we perceive that for a different set of parameters and initial points, the newly proposed iterative scheme converges faster than the other well-known algorithms. To be specific, we give an analytic proof of the claim that the novel iteration scheme is also faster than that of Liu et al.


Sign in / Sign up

Export Citation Format

Share Document