Complexity of the contraction mappingprinciple with noises
碩士 === 元智大學 === 資訊工程學系 === 102 === A function f:M→M is called a contraction mapping on a metric space (M,d) if there exists ρ∈(0,1) satisfying d(f(x),f(y) )≤ρd(x,y) for all x,y∈M. The celebrated contraction mapping principle states that each contraction mapping on a complete metric space has a uni...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Online Access: | http://ndltd.ncl.edu.tw/handle/37589268269831562102 |