29 resultados para Rigid body with a fixed point

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

100.00% 100.00%

Publicador:

Resumo:

∗ The final version of this paper was sent to the editor when the author was supported by an ARC Small Grant of Dr. E. Tarafdar.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

AMS subject classification: 65K10, 49M07, 90C25, 90C48.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this article on quasidifferential equation with non-fixed time of impulses we consider the continuous dependence of the solutions on the initial conditions as well as the mappings defined by these equations. We prove general theorems for quasidifferential equations from which follows corresponding results for differential equations, differential inclusion and equations with Hukuhara derivative.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The main aim of this paper is to obtain fixed point theorems for Kannan and Zamfirescu operators in the presence of cyclical contractive condition. A method for approximation of the fixed points is also provided, for which both a priori and a posteriori error estimates are given. Our results generalize, unify and extend several important fixed points theorems in literature. In order to illustrate the efficiency of our generalizations five significant examples are also given.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 47H10, 54E15.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary: 47H10; Secondary: 54H25.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Здравко Д. Славов - В тази статия се разглежда математически модел на икономика с фиксирани общи ресурси, както и краен брой агенти и блага. Обсъжда се ролята на някои предположения за отношенията на предпочитание на икономическите агенти, които влияят на характеристиките на оптимално разпределените дялове. Доказва се, че множеството на оптимално разпределените дялове е свиваемо и притежава свойството на неподвижната точка.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Mathematics Subject Classification: 26A33, 34A60, 34K40, 93B05

Relevância:

100.00% 100.00%

Publicador:

Resumo:

MSC 2010: 26A33, 34A37, 34K37, 34K40, 35R11

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 65H10.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 54H25, 55M20.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 58C06, 47H10, 34A60.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

When Recurrent Neural Networks (RNN) are going to be used as Pattern Recognition systems, the problem to be considered is how to impose prescribed prototype vectors ξ^1,ξ^2,...,ξ^p as fixed points. The synaptic matrix W should be interpreted as a sort of sign correlation matrix of the prototypes, In the classical approach. The weak point in this approach, comes from the fact that it does not have the appropriate tools to deal efficiently with the correlation between the state vectors and the prototype vectors The capacity of the net is very poor because one can only know if one given vector is adequately correlated with the prototypes or not and we are not able to know what its exact correlation degree. The interest of our approach lies precisely in the fact that it provides these tools. In this paper, a geometrical vision of the dynamic of states is explained. A fixed point is viewed as a point in the Euclidean plane R2. The retrieving procedure is analyzed trough statistical frequency distribution of the prototypes. The capacity of the net is improved and the spurious states are reduced. In order to clarify and corroborate the theoretical results, together with the formal theory, an application is presented

Relevância:

100.00% 100.00%

Publicador:

Resumo:

* Partially supported by Grant MM523/95 with Ministry of Science and Technologies.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The "recursive" definition of Default Logic is shown to be representable in a monotonic Modal Quantificational Logic whose modal laws are stronger than S5. Specifically, it is proven that a set of sentences of First Order Logic is a fixed-point of the "recursive" fixed-point equation of Default Logic with an initial set of axioms and defaults if and only if the meaning of the fixed-point is logically equivalent to a particular modal functor of the meanings of that initial set of sentences and of the sentences in those defaults. This is important because the modal representation allows the use of powerful automatic deduction systems for Modal Logic and because unlike the original "recursive" definition of Default Logic, it is easily generalized to the case where quantified variables may be shared across the scope of the components of the defaults.