Common fixed points versus best approximations | Zendy

Abdul Latif | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Common fixed points versus best approximations

Author(s) -

Abdul Latif

Publication year - 2001

Publication title -

tamkang journal of mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.324

H-Index - 18

eISSN - 0049-2930

pISSN - 2073-9826

DOI - 10.5556/j.tkjm.32.2001.373

Subject(s) - approx , mathematics , fixed point , fixed point theorem , combinatorics , discrete mathematics , mathematical analysis , computer science , operating system

We obtain a common fixed point theorem for $ (f,g) $-nonexpansive maps in $ p $-normed spaces. Some results on best approximation are also derived via common fixed points. Our results generalize and extend the work of Al-Thaghafi [J. Approx. Theory 85 (1996), 318-323], Khan and Khan [Approx. Theory & its Appl., 11 (1995), 1-5], Habiniak [J. Approx. Theory, 56 (1989), 241-244], Sahab, Khan and Sessa [J. Approx. Theory, 55 (1988), 349-351], and many of the others

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research