Open AccessCriteria of strong nearest-cross points and strong best approximation pairs
Author(s) -
Pan Wen-xi,
Jingshi Xu
Publication year - 2006
Publication title -
applied general topology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.638
H-Index - 13
eISSN - 1989-4147
pISSN - 1576-9402
DOI - 10.4995/agt.2006.1931
Subject(s) - mathematics , generalization , uniqueness , point (geometry) , k nearest neighbors algorithm , combinatorics , discrete mathematics , mathematical analysis , geometry , computer science , artificial intelligence
The concept of strong nearest-cross point (strong n.c. point) is introduced, which is the generalization of strong uniqueness of best approximation from a single point. The relation connecting to localization is discussed. Some criteria of strong n.c. points are given. The strong best approximation pairs are also studied
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom