Made available in DSpace on 2014-11-10T11:09:53Z (GMT). No. of bitstreams: 0 Previous issue date: 2014-02-21Bitstream added on 2014-11-10T11:57:46Z : No. of bitstreams: 1 000790735.pdf: 1590232 bytes, checksum: 5297d173df2a824606d944767eb1610c (MD5) / O principal objetivo deste trabalho consiste na produção de um referencial teórico relacionado aos conceitos de ponto fixo, que possibilite, aos alunos do Ensino Médio, o desenvolvimento de habilidades e competências relacionadas à Matemática. Neste trabalho são colocadas abordagens contextualizadas e proposições referentes às noções de ponto fixo nas principais funções reais (afim, quadrática, modular, dentre outras) e sua interpretação geométrica. São abordados de maneira introdutória os conceitos do teorema do ponto fixo de Brouwer, o teorema do ponto fixo de Banach e o método de resolução de equações por aproximações sucessivas / The main objective of this work is to produce a theoretical concepts related to fixed point, enabling, for high school students, the development of skills and competencies related to Mathematics. This work placed contextualized approaches and proposals relating to notions of fixed point in the main real functions (affine, quadratic, modular, among others) and its geometric interpretation. Are approached introductory concepts of the fixed point theorem of Brouwer's, fixed point theorem of Banach and the method of solving equations by successive approximations

Banach's contraction principle is probably one of the most important theorems in fixed point theory. It has been used to develop much of the rest of fixed point theory. Another key result in the field is a theorem due to Browder, Göhde, and Kirk involving Hilbert spaces and nonexpansive mappings. Several applications of Banach's contraction principle are made. Some of these applications involve obtaining new metrics on a space, forcing a continuous map to have a fixed point, and using conditions on the boundary of a closed ball in a Banach space to obtain a fixed point. Finally, a development of the theorem due to Browder et al. is given with Hilbert spaces replaced by uniformly convex Banach spaces.

Orientador: German Jesus Lozada Cruz / Banca: Cosme Eustaquio Rubio Mercedes / Banca: Rita de Cássia Pavani Lamas / Resumo: O principal objetivo deste trabalho consiste na produção de um referencial teórico relacionado aos conceitos de ponto fixo, que possibilite, aos alunos do Ensino Médio, o desenvolvimento de habilidades e competências relacionadas à Matemática. Neste trabalho são colocadas abordagens contextualizadas e proposições referentes às noções de ponto fixo nas principais funções reais (afim, quadrática, modular, dentre outras) e sua interpretação geométrica. São abordados de maneira introdutória os conceitos do teorema do ponto fixo de Brouwer, o teorema do ponto fixo de Banach e o método de resolução de equações por aproximações sucessivas / Abstract: The main objective of this work is to produce a theoretical concepts related to fixed point, enabling, for high school students, the development of skills and competencies related to Mathematics. This work placed contextualized approaches and proposals relating to notions of fixed point in the main real functions (affine, quadratic, modular, among others) and its geometric interpretation. Are approached introductory concepts of the fixed point theorem of Brouwer's, fixed point theorem of Banach and the method of solving equations by successive approximations / Mestre

Orientador: Prof. Dr. Eduardo Guéron / Dissertação (mestrado) - Universidade Federal do ABC, Programa de Pós-Graduação em Mestrado Profissional em Matemática em Rede Nacional, 2016. / Apresentamos neste trabalho um estudo sobre as equações de diferenças autônomas li-neares e não lineares que descreve um sistema dinâmico discreto. Para o caso linear, o objeti-vo foi encontrar uma solução analítica da evolução temporal do sistema e a partir desta solu-ção estudamos a estabilidade do sistema. No caso do não linear, na impossibilidade de deter-minar uma solução analítica, o que procuramos foi uma compreensão sobre a evolução quali-tativa do sistema, ou seja, fizemos um estudo qualitativo de uma família de mapas logísticos discretos, onde a partir da variação de um parâmetro verificamos alguns comportamentos co-mo: pontos fixos, órbitas periódicas, bifurcação e caos. Em ambos os casos, estudamos alguns modelos simples relacionados à Economia, Demografia ou Ecologia como exemplos de apli-cações dos aspectos teóricos estudados. / Here we present a study of the equations of linear and nonlinear autonomous differ-ences that describes a dynamic discrete system. For the linear case, the objective was to find an analytical solution of the time evolution of the system and from this solution we study the system stability. In the case of nonlinear, it is impossible to determine an analytical solution, what we seek is an understanding of the qualitative evolution of the system, ie, did a qualita-tive study of a family of discrete logistic maps, where from the change in a parameter we found some behaviors such as fixed points, periodic orbits, bifurcation and chaos. In both cas-es, we study some simple models related to Economics, Demography and Ecology as exam-ples of applications of the theoretical aspects studied.

Made available in DSpace on 2016-06-02T20:27:40Z (GMT). No. of bitstreams: 1 4629.pdf: 1448309 bytes, checksum: c6f5e451b1247c565791c643df7dc7d5 (MD5) Previous issue date: 2012-10-23 / Financiadora de Estudos e Projetos / This thesis was developed in two parts. Firstly, we consider a pair of fiber-preserving maps f1, f2 : M → M in a fiber bundle with base S1 and fiber Klein bottle. Using an algebraic system of equations we found in what situations the minimal coincidence set over S1 of the pair (f1, f2) is empty. In the second part, motivated by this problem, we consider a fiber-preserving map f : M → M in a fiber bundle with base S1 and fiber torus. Using the one-parameter fixed point theory we studied the minimal fixed point set over S1 of the map f. In some fiber bundle we classified completely this sets. / Esta tese foi desenvolvida em duas partes. Inicialmente, consideramos um par de aplicações que preserva fibra, f1, f2 : M → M, em um fibrado com base S1 e fibra garrafa de Klein. Utilizando-se de um sistema algébrico de equações, descobrimos em que situações o conjunto minimal de coincidências sobre S1 do par (f1, f2) é vazio. Na segunda parte, motivado por esse problema, consideramos uma aplicação que preserva fibra, f : M → M, em um fibrado com base S1 e fibra toro. Usando a teoria algébrica de ponto fixo a 1-parâmetro estudamos o conjunto minimal dos pontos fixos sobre S1 da aplicação f. Em alguns fibrados foi possível obter uma classificação completa desses conjuntos.

<div>In recent years, the amount of data in the information processing systems has significantly increased, which is also referred to as big-data. The design of systems handling big-data calls for a scalable approach, which brings distributed systems into the picture. In contrast to centralized systems, data are spread across the network of agents in the distributed system, and agents cooperatively complete tasks through local communications and local computations. However, the design and analysis of distributed systems, in which no central coordinators with complete information are present, are challenging tasks. In order to support communication among agents to enable multi-agent coordination among others, practical communication constraints should be taken into consideration in the design and analysis of such systems. The focus of this dissertation is to provide design and analysis of distributed network processing using finite-rate communications among agents. In particular, we address the following open questions: 1) can one design algorithms balancing a graph weight matrix using finite-rate and simplex communications among agents? 2) can one design algorithms computing the average of agents’ states using finite-rate and simplex communications? and 3) going beyond of ad-hoc algorithmic designs, can one design a black-box mechanism transforming a general class of algorithms with unquantized communication to their finite-bit quantized counterparts?</div><div><br></div><div>This dissertation addresses the above questions. First, we propose novel distributed algorithms solving the weight-balancing and average consensus problems using only finite-rate simplex communications among agents, compliant to the directed nature of the network topology. A novel convergence analysis is put forth, based on a new metric inspired by the</div><div>positional system representations. In the second half of this dissertation, distributed optimization subject to quantized communications is studied. Specifically, we consider a general class of linearly convergent distributed algorithms cast as fixed-point iterate, and propose a novel black-box quantization mechanism. In the proposed mechanism, a novel quantizer preserving linear convergence is proposed, which is proved to be more communication efficient than state-of-the-art quantization mechanisms. Extensive numerical results validate our theoretical findings.</div>

The thesis deals with a general access to topological transversality in uniform spaces. / Die Arbeit behandelt einen allgemeinen Zugang zur Topologischen Transversalität in uniformen Räumen.

The realisation of signal processing algorithms in fixed-point offers substantial performance advantages over floating-point realisations. However, it is widely acknowledged that the task of realising algorithms in fixed-point is a challenging one with limited tool support. This thesis examines various aspects related to the translation of algorithms, given in infinite precision or floating-point, into fixed-point. In particular, this thesis reports on the implementation of a given algorithm, an EDFA (Erbium-Doped Fibre Amplifier) control algorithm, on a FPGA (Field Programmable Gate Array) using fixed-point arithmetic. An analytical approach is proposed that allows the automated realisation of algorithms in fixedpoint. The technique provides fixed-point parameters for a given floating-point model that satisfies a precision constraint imposed on the primary output of the algorithm to be realised. The development of a simulation framework based on this analysis allows fixed-point designs to be generated in a shorter time frame. Albeit being limited to digital algorithms that can be represented as a data flow graph (DFG), the approach developed in the thesis allows for a speed up in the design and development cycle, reduces the possibility of error and eases the overall effort involved in the process. It is shown in this thesis that a fixed-point realisation of an EDFA control algorithm using this technique produces results that satisfy the given constraints.

The thesis deals with a general access to topological transversality in uniform spaces. / Die Arbeit behandelt einen allgemeinen Zugang zur Topologischen Transversalität in uniformen Räumen.

The purpose of the thesis is to study completeness of abstract spaces. In particular, we study completeness in partial metric spaces, partial metric type spaces, dislocated metric spaces, dislocated metric type spaces and symmetric spaces that are generalizations of metric spaces. It is well known that complete metric spaces have a wide range of applications. For instance, the classical Banach contraction principle is phrased in the context of complete metric spaces. Analogously, the Banach's xed point theorem and xed point results for Lipschitzian maps are discussed in this context, namely in, partial metric spaces and metric type spaces. Finally, xed point results are presented for symmetric spaces. / Geography / Ph. D. (Mathematics)