This is an experimental computational account of projection algorithms for the linear best approximation problem. We focus on the sequential and simultaneous versions of Dykstra’s algorithm and the Halpern-Lions-Wittmann-Bauschke algorithm for the best approximation problem from a point to the intersection of closed convex sets in the Euclidean space. These algorithms employ different iterative...

In this paper, we study the concept of S-approximation spaces in fuzzy set theory and investigate its properties. Along introducing three pairs of lower and upper approximation operators for fuzzy S-approximation spaces, their properties under different assumptions, e.g. monotonicity and weak complement compatibility are studied. By employing two thresholds for minimum acceptance accuracy and m...

We prove that some important properties of convex subsets of vector topological spaces remain valid in the space of fuzzy numbers endowed with the Euclidean distance. We use these results to obtain a characterization of fuzzy number-valued Lipschitz functions. This fact helps us to find the best Lipschitz constant of the trapezoidal approximation operator preserving the value and ambiguity intr...

Decision fusion is one of hot research topics in classification area, which aims to achieve the best possible performance for the task at hand. In this paper, we investigate the usefulness of this concept to improve change detection accuracy in remote sensing. Thereby, outputs of two fuzzy change detectors based respectively on simultaneous and comparative analysis of multitemporal data are fus...

in this article, by using chebyshev’s polynomials and chebyshev’s expansion, we obtain the best uniform polynomial approximation out of p2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...