981 resultados para complete metric-space
Resumo:
This paper presents some further results on proximal and asymptotic proximal contractions and on a class of generalized weak proximal contractions in metric spaces. The generalizations are stated for non-self-mappings of the forms for and , or , subject to and , such that converges uniformly to T, and the distances are iteration-dependent, where , , and are non-empty subsets of X, for , where is a metric space, provided that the set-theoretic limit of the sequences of closed sets and exist as and that the countable infinite unions of the closed sets are closed. The convergence of the sequences in the domain and the image sets of the non-self-mapping, as well as the existence and uniqueness of the best proximity points, are also investigated if the metric space is complete. Two application examples are also given, being concerned, respectively, with the solutions through pseudo-inverses of both compatible and incompatible linear algebraic systems and with the parametrical
Resumo:
The aim of this paper is to present fixed point result of mappings satisfying a generalized rational contractive condition in the setup of multiplicative metric spaces. As an application, we obtain a common fixed point of a pair of weakly compatible mappings. Some common fixed point results of pair of rational contractive types mappings involved in cocyclic representation of a nonempty subset of a multiplicative metric space are also obtained. Some examples are presented to support the results proved herein. Our results generalize and extend various results in the existing literature.
Resumo:
A new coupled fixed point theorem related to the Pata contraction for mappings having the mixed monotone property in partially ordered complete metric spaces is established. It is shown that the coupled fixed point can be unique under some extra suitable conditions involving mid point lower or upper bound properties. Also the corresponding convergence rate is estimated when the iterates of our function converge to its coupled fixed point.
Resumo:
This paper investigates the boundedness and convergence properties of two general iterative processes which involve sequences of self-mappings on either complete metric or Banach spaces. The sequences of self-mappings considered in the first iterative scheme are constructed by linear combinations of a set of self-mappings, each of them being a weighted version of a certain primary self-mapping on the same space. The sequences of self-mappings of the second iterative scheme are powers of an iteration-dependent scaled version of the primary self-mapping. Some applications are also given to the important problem of global stability of a class of extended nonlinear polytopic-type parameterizations of certain dynamic systems.
Resumo:
Nous présentons dans cette thèse des théorèmes de point fixe pour des contractions multivoques définies sur des espaces métriques, et, sur des espaces de jauges munis d’un graphe. Nous illustrons également les applications de ces résultats à des inclusions intégrales et à la théorie des fractales. Cette thèse est composée de quatre articles qui sont présentés dans quatre chapitres. Dans le chapitre 1, nous établissons des résultats de point fixe pour des fonctions multivoques, appelées G-contractions faibles. Celles-ci envoient des points connexes dans des points connexes et contractent la longueur des chemins. Les ensembles de points fixes sont étudiés. La propriété d’invariance homotopique d’existence d’un point fixe est également établie pour une famille de Gcontractions multivoques faibles. Dans le chapitre 2, nous établissons l’existence de solutions pour des systèmes d’inclusions intégrales de Hammerstein sous des conditions de type de monotonie mixte. L’existence de solutions pour des systèmes d’inclusions différentielles avec conditions initiales ou conditions aux limites périodiques est également obtenue. Nos résultats s’appuient sur nos théorèmes de point fixe pour des G-contractions multivoques faibles établis au chapitre 1. Dans le chapitre 3, nous appliquons ces mêmes résultats de point fixe aux systèmes de fonctions itérées assujettis à un graphe orienté. Plus précisément, nous construisons un espace métrique muni d’un graphe G et une G-contraction appropriés. En utilisant les points fixes de cette G-contraction, nous obtenons plus d’information sur les attracteurs de ces systèmes de fonctions itérées. Dans le chapitre 4, nous considérons des contractions multivoques définies sur un espace de jauges muni d’un graphe. Nous prouvons un résultat de point fixe pour des fonctions multivoques qui envoient des points connexes dans des points connexes et qui satisfont une condition de contraction généralisée. Ensuite, nous étudions des systèmes infinis de fonctions itérées assujettis à un graphe orienté (H-IIFS). Nous donnons des conditions assurant l’existence d’un attracteur unique à un H-IIFS. Enfin, nous appliquons notre résultat de point fixe pour des contractions multivoques définies sur un espace de jauges muni d’un graphe pour obtenir plus d’information sur l’attracteur d’un H-IIFS. Plus précisément, nous construisons un espace de jauges muni d’un graphe G et une G-contraction appropriés tels que ses points fixes sont des sous-attracteurs du H-IIFS.
Resumo:
[EN] The purpose of this paper is to present a fixed point theorem for generalized contractions in partially ordered complete metric spaces. We also present an application to first-order ordinary differential equations.
Resumo:
We quantify the extent to which a supercritical Sobolev mapping can increase the dimension of subsets of its domain, in the setting of metric measure spaces supporting a Poincaré inequality. We show that the set of mappings that distort the dimensions of sets by the maximum possible amount is a prevalent subset of the relevant function space. For foliations of a metric space X defined by a David–Semmes regular mapping Π : X → W, we quantitatively estimate, in terms of Hausdorff dimension in W, the size of the set of leaves of the foliation that are mapped onto sets of higher dimension. We discuss key examples of such foliations, including foliations of the Heisenberg group by left and right cosets of horizontal subgroups.
Resumo:
For each quasi-metric space X we consider the convex lattice SLip(1)(X) of all semi-Lipschitz functions on X with semi-Lipschitz constant not greater than 1. If X and Y are two complete quasi-metric spaces, we prove that every convex lattice isomorphism T from SLip(1)(Y) onto SLip(1)(X) can be written in the form Tf = c . (f o tau) + phi, where tau is an isometry, c > 0 and phi is an element of SLip(1)(X). As a consequence, we obtain that two complete quasi-metric spaces are almost isometric if, and only if, there exists an almost-unital convex lattice isomorphism between SLip(1)(X) and SLip(1) (Y).
Resumo:
In vector space based approaches to natural language processing, similarity is commonly measured by taking the angle between two vectors representing words or documents in a semantic space. This is natural from a mathematical point of view, as the angle between unit vectors is, up to constant scaling, the only unitarily invariant metric on the unit sphere. However, similarity judgement tasks reveal that human subjects fail to produce data which satisfies the symmetry and triangle inequality requirements for a metric space. A possible conclusion, reached in particular by Tversky et al., is that some of the most basic assumptions of geometric models are unwarranted in the case of psychological similarity, a result which would impose strong limits on the validity and applicability vector space based (and hence also quantum inspired) approaches to the modelling of cognitive processes. This paper proposes a resolution to this fundamental criticism of of the applicability of vector space models of cognition. We argue that pairs of words imply a context which in turn induces a point of view, allowing a subject to estimate semantic similarity. Context is here introduced as a point of view vector (POVV) and the expected similarity is derived as a measure over the POVV's. Different pairs of words will invoke different contexts and different POVV's. Hence the triangle inequality ceases to be a valid constraint on the angles. We test the proposal on a few triples of words and outline further research.
Resumo:
Sample complexity results from computational learning theory, when applied to neural network learning for pattern classification problems, suggest that for good generalization performance the number of training examples should grow at least linearly with the number of adjustable parameters in the network. Results in this paper show that if a large neural network is used for a pattern classification problem and the learning algorithm finds a network with small weights that has small squared error on the training patterns, then the generalization performance depends on the size of the weights rather than the number of weights. For example, consider a two-layer feedforward network of sigmoid units, in which the sum of the magnitudes of the weights associated with each unit is bounded by A and the input dimension is n. We show that the misclassification probability is no more than a certain error estimate (that is related to squared error on the training set) plus A3 √((log n)/m) (ignoring log A and log m factors), where m is the number of training patterns. This may explain the generalization performance of neural networks, particularly when the number of training examples is considerably smaller than the number of weights. It also supports heuristics (such as weight decay and early stopping) that attempt to keep the weights small during training. The proof techniques appear to be useful for the analysis of other pattern classifiers: when the input domain is a totally bounded metric space, we use the same approach to give upper bounds on misclassification probability for classifiers with decision boundaries that are far from the training examples.
Resumo:
This paper presents a mapping and navigation system for a mobile robot, which uses vision as its sole sensor modality. The system enables the robot to navigate autonomously, plan paths and avoid obstacles using a vision based topometric map of its environment. The map consists of a globally-consistent pose-graph with a local 3D point cloud attached to each of its nodes. These point clouds are used for direction independent loop closure and to dynamically generate 2D metric maps for locally optimal path planning. Using this locally semi-continuous metric space, the robot performs shortest path planning instead of following the nodes of the graph --- as is done with most other vision-only navigation approaches. The system exploits the local accuracy of visual odometry in creating local metric maps, and uses pose graph SLAM, visual appearance-based place recognition and point clouds registration to create the topometric map. The ability of the framework to sustain vision-only navigation is validated experimentally, and the system is provided as open-source software.
Resumo:
The photoelectron spectrum of the oxyallyl (OXA) radical anion has been measured. The radical anion has been generated in the reaction of the atomic oxygen radical anion (O center dot-) with acetone. Three low-lying electronic states of OXA have been observed in the spectrum. Electronic structure calculations have been performed for the triplet states (B-3(2) and B-3(1)) of OXA and the ground doublet state ((2)A(2)) of the radical anion using density, functional theory (DFT). Spectral simulations have been carried out for the triplet statics based on the results of the DFT calculations. The simulation identifies a vibrational progression of the CCC bending mode of the B-3(2) state of OXA in the lower electron binding energy (eBE) portion of the spectrum. On top of the B-3(2) feature, however, the experimental spectrum exhibits additional photoelectron peaks whose angular distribution is distinct from that for the vibronic peaks of the B-3(2) state. Complete active space self-consistent field (CASSCF) method and second-order perturbation theory based on the CASSCF wave function (CASPT2) have been employed to study the lowest singlet state ((1)A(1)) of OXA. The simulation based on the results of these electronic structure calculations establishes that the overlapping peaks represent the vibrational ground level of the (1)A(1) state and its vibrational progression of the CO stretching mode. The A, state is the lowest electronic state of,OXA, and the electron affinity (EA) of OXA is 1.940 +/- 0.010 eV. The B-3(2) state is the first excited state with an electronic term energy of 55 +/- 2 meV. The widths of the vibronic peaks of the (X) over tilde (1)A(1) state are much broader than those of the (a) over tilde B-3(2) state, implying that the (1)A(1) state is indeed a transition state. The CASSCF and CASPT2 calculations suggest that the (1)A(1) state is at a potential maximum along the nuclear coordinate representing disrotatory motion of the two methylene groups, which leads to three-membered-ring formation, i.e., cydopropanone. The simulation of (b) over tilde B-3(1) OXA reproduces the higher eBE portion of the spectrum very well. The term energy of the B-3(1) state is 0.883 +/- 0.012 eV. Photoelectron spectroscopic measurements have also been conducted for the other ion products of the O center dot- reaction with acetone. The photoelectron imaging spectrum of the acetylcarbene (AC) radical anion exhibits a broad, structureless feature, which is assigned to the (X) over tilde (3)A '' state of AC. The ground ((2)A '') and first excited ((2)A') states of the 1-methylvinoxy (1-MVO) radical have been observed in the photoelectron spectrum of the 1-MVO ion, and their vibronic structure has been analyzed.
Resumo:
The Inönü-Wigner contractions which interrelate the Lie algebras of the isometry groups of metric spaces are discussed with reference to deformations of the absolutes of the spaces. A general formula is derived for the Lie algebra commutation relations of the isometry group for anyN-dimensional metric space. These ideas are illustrated by a discussion of important particular cases, which interrelate the four-dimensional de Sitter, Poincaré, and Galilean groups.
Resumo:
Using excited-state ab initio molecular dynamics simulations employing the complete-active-space self-consistent-field approach, we study the mechanism of photodissociation in terms of time evolution of structure, kinetic energy, charges and potential energy for the first excited state of hydrogen halides and methyl halides. Although the hydrogen halides and methyl halides are similar in the photodissociation mechanism, their dynamics are slightly different. The presence of the methyl group causes delay in photodissociation as compared to hydrogen halides.
Resumo:
For a one-locus selection model, Svirezhev introduced an integral variational principle by defining a Lagrangian which remained stationary on the trajectory followed by the population undergoing selection. It is shown here (i) that this principle can be extended to multiple loci in some simple cases and (ii) that the Lagrangian is defined by a straightforward generalization of the one-locus case, but (iii) that in two-locus or more general models there is no straightforward extension of this principle if linkage and epistasis are present. The population trajectories can be constructed as trajectories of steepest ascent in a Riemannian metric space. A general method is formulated to find the metric tensor and the surface-in the metric space on which the trajectories, which characterize the variations in the gene structure of the population, lie. The local optimality principle holds good in such a space. In the special case when all possible linkage disequilibria are zero, the phase point of the n-locus genetic system moves on the surface of the product space of n higher dimensional unit spheres in a certain Riemannian metric space of gene frequencies so that the rate of change of mean fitness is maximum along the trajectory. In the two-locus case the corresponding surface is a hyper-torus.