نتایج جستجو برای: posed fixed point problem

تعداد نتایج: 1479822  

2003
Lorenzo Torresani Aaron Hertzmann Christoph Bregler

This paper presents an algorithm for learning the time-varying shape of a non-rigid 3D object from uncalibrated 2D tracking data. We model shape motion as a rigid component (rotation and translation) combined with a non-rigid deformation. Reconstruction is ill-posed if arbitrary deformations are allowed. We constrain the problem by assuming that the object shape at each time instant is drawn fr...

1997
B. C. Allanach S. F. King

We provide the solutions of the fixed point conditions of the Yukawa sector for a large class of N = 1 supersymmetric theories including the minimal and next-to-minimal supersymmetric standard models and their grand unified and other extensions. We also introduce a test which can discriminate between infra-red stable, infra-red unstable and saddle point solutions, and illustrate our methods wit...

1988
ALVIN E. ROTH MARILDA SOTOMAYOR

Theoretical work on two-sided matching markets has focussed on the stable outcomes that are optimal for one side of the market. An innovative exception is a paper by Rochford, who shows how to identify a nonempty set of interior points of the core of the assignment market first studied by Shapley and Shubik. We strengthen Rochfold’s results, by showing that such a set of fixed points must refle...

2012
Hemant Kumar Nashine Zoran Kadelburg Stojan Radenović Jong Kyu Kim

*Correspondence: [email protected] 4Department of Mathematics, Kyungnam University Masan, Kyungnam, 631-701, Korea Full list of author information is available at the end of the article Abstract A fixed point theorem is obtained for a monotone self-map in a 0-complete ordered partial metric space under Hardy-Rogers-type contractive condition. This result improves some recently obtained on...

1999
B. Ananthanarayan P. N. Pandita

We study the renormalization group evolution and infra-red stable fixed points of the Yukawa couplings and the soft supersymmetry breaking trilinear couplings of the minimal supersymmetric standard model with baryon and lepton number (and R-parity) violation involving the heaviest generations. We show analytically that in the Yukawa sector there is only one infra-red stable fixed point. This co...

1999
K. Pinn M. Rehwald

We compute renormalization group fixed points and their spectrum in an ultralocal approximation. We study a case of two competing non-trivial fixed points for a three-dimensional real N -component field: the O(N)-invariant fixed point vs. the cubic-invariant fixed point. We compute the critical value Nc of the cubic φ -perturbation at the O(N)-fixed point. The O(N) fixed point is stable under a...

2012
Mohamed Akkouchi

In this paper, we prove a general common fixed point theorem for two pairs of weakly compatible self-mappings of a metric space satisfying a weak Meir-Keeler type contractive condition by using a class of implicit relations. In particular, our result generalizes and improves a result of K. Jha, R.P. Pant, S.L. Singh, by removing the assumption of continuity, relaxing compatibility to weakly com...

2012
Khaled Abd-Rabou

The purpose of this paper is to study common fixed point theorems for six (four single-valued and two set-valued) mappings in fuzzy metric spaces. without assuming compatibility and continuity of any mapping on non complete metric spaces. To prove the theorem, we use a non compatible condition, that is, weak commutativity of type (Kh)in fuzzy metric spaces. We show that completeness of the whol...

2016
Bjørn Fredrik Nielsen John Wyller

We show that point-neuron models with a Heaviside firing rate function can be ill posed. More specifically, the initial-condition-to-solution map might become discontinuous in finite time. Consequently, if finite precision arithmetic is used, then it is virtually impossible to guarantee the accurate numerical solution of such models. If a smooth firing rate function is employed, then standard O...

Journal: :Theor. Comput. Sci. 1982
Dexter Kozen

Abstrack In this paper we define and study a propositional p-calculur Lp, which consists essentialI) ol propositional modal logic with a least fixpoint operator. Lp is syntactically simpler yet strictly nwc exprcsk~e than Propositional Dqnamic Logic (PDL). For a rtxtrictcd version \\L‘ give an cuponcntinl-time decision procedure. small model prcqwty. and complete deductive system. thcri,, wbumi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید