Let f: D ⊂ ℝⁿ → ℝⁿ. f is a contraction if: ‖f(x) - f(y)‖ ≤ c · ‖x - y‖ for some 0 < c < 1. The system computes gaps g(x) = ‖f(x) - x‖ to assess convergence. [verify] domain: 2D unit square, 1000 ...
This repository contains Pytorch code for the paper entitled with"Contraction Mapping of Feature Norms for Data Quality Imbalance Learning" . This paper will be released soon. In the field of deep ...
ABSTRACT: In this paper, we introduce the concept of weakly C-contraction mapping in modular metric spaces. And we established some fixed point results in w-complete spaces. Our results encompass ...
Kohlberg, Elon, and John W. Pratt. "The Contraction Mapping Approach to the Perron-Frobenius Theory: Why Hilbert's Metric?" Mathematics of Operations Research, no. 7 (1982): 198–210.
ABSTRACT: In this work, we recall definition of functions called as C-class and use the concepts of dislocated metric, b-dislocated metric, altering distance function. We prove some coincidence, fixed ...
Abstract: We discuss the class of proximal contraction mappings, and we show that this singularity of best proximity point results for such mapping, is a directly concluded from it’s fixed point ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results