• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 118
  • 41
  • 17
  • 9
  • 5
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 225
  • 225
  • 59
  • 36
  • 36
  • 35
  • 30
  • 27
  • 20
  • 19
  • 18
  • 16
  • 15
  • 15
  • 15
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
101

Iterative Methods for Minimization Problems over Fixed Point Sets

Chen, Yen-Ling 02 June 2011 (has links)
In this paper we study through iterative methods the minimization problem min_{x∈C} £K(x) (P) where the set C of constraints is the set of fixed points of a nonexpansive mapping T in a real Hilbert space H, and the objective function £K:H¡÷R is supposed to be continuously Gateaux dierentiable. The gradient projection method for solving problem (P) involves with the projection P_{C}. When C = Fix(T), we provide a so-called hybrid iterative method for solving (P) and the method involves with the mapping T only. Two special cases are included: (1) £K(x)=(1/2)||x-u||^2 and (2) £K(x)=<Ax,x> - <x,b>. The first case corresponds to finding a fixed point of T which is closest to u from the fixed point set Fix(T). Both cases have received a lot of investigations recently.
102

Inverse strongly monotone operators and variational inequalities

Chi, Wen-te 23 June 2009 (has links)
In this paper, we report existing convergence results on monotone variational inequalities where the governing monotone operators are either strongly monotone or inverse strongly monotone. We reformulate the variational inequality problem as an equivalent fixed point problem and then use fixed point iteration method to solve the original variational inequality problem. In the case of strong monotonicity case we use the Banach¡¦s contraction principle to define out iteration sequence; while in the case of inverse strong monotonicity we use the technique of averaged mappings to define our iteration sequence. In both cases we prove strong convergence for our iteration methods. An application to a minimization problem is also included.
103

Orbital-free density functional theory using higher-order finite differences

Ghosh, Swarnava Ghosh 08 June 2015 (has links)
Density functional theory (DFT) is not only an accurate but also a widely used theory for describing the quantum-mechanical electronic structure of matter. In this approach, the intractable problem of interacting electrons is simplified to a tractable problem of non-interacting electrons moving in an effective potential. Even with this simplification, DFT remains extremely computationally expensive. In particular, DFT scales cubically with respect to the number of atoms, which restricts the size of systems that can be studied. Orbital free density functional theory (OF-DFT) represents a simplification of DFT applicable to metallic systems that behave like a free-electron gas. Current implementations of OF-DFT employ the plane-wave basis, the global nature of the basis prevents the efficient use of modern high-performance computer archi- tectures. We present a real-space formulation and higher-order finite-difference implementation of periodic Orbital-free Density Functional Theory (OF-DFT). Specifically, utilizing a local reformulation of the electrostatic and kernel terms, we develop a gener- alized framework suitable for performing OF-DFT simulations with different variants of the electronic kinetic energy. In particular, we develop a self-consistent field (SCF) type fixed-point method for calculations involving linear-response kinetic energy functionals. In doing so, we make the calculation of the electronic ground-state and forces on the nuclei amenable to computations that altogether scale linearly with the number of atoms. We develop a parallel implementation of our method using Portable, Extensible Toolkit for scientific computations (PETSc) suite of data structures and routines. The communication between processors is handled via the Message Passing Interface(MPI). We implement this formulation using the finite-difference discretization, us- ing which we demonstrate that higher-order finite-differences can achieve relatively large convergence rates with respect to mesh-size in both the energies and forces. Additionally, we establish that the fixed-point iteration converges rapidly, and that it can be further accelerated using extrapolation techniques like Anderson mixing. We verify the accuracy of our results by comparing the energies and forces with plane-wave methods for selected examples, one of which is the vacancy formation energy in Aluminum. Overall, we demonstrate that the proposed formulation and implementation is an attractive choice for performing OF-DFT calculations.
104

Signal Processing on Ambric Processor Array : Baseband processing in radio base stations

Qasim, Muhammad, Majid Ali, Chaudhry January 2008 (has links)
The advanced signal processing systems of today require extreme data throughput and low power consumption. The only way to accomplish this is to use parallel processor architecture. The aim of this thesis was to evaluate the use of parallel processor architecture in baseband signal processing. This has been done by implementing three demanding algorithms in LTE on Ambric Am2000 family Massively Parallel Processor Array (MPPA). The Ambric chip is evaluated in terms of computational performance, efficiency of the development tools, algorithm and I/O mapping. Implementations of Matrix Multiplication, FFT and Block Interleaver were performed. The implementation of algorithms shows that high level of parallelism can be achieved in MPPA especially on complex algorithms like FFT and Matrix multiplication. Different mappings of the algorithms are compared to see which best fit the architecture.
105

Sobre coincidências e pontos fixos de aplicações /

Cobra, Thiago Taglialatela. January 2010 (has links)
Orientador: Alice Kimie Miwa Libardi / Banca: Edson de Oliveira / Banca: Thiago de Melo / Resumo: O principal objetivo deste trabalho é apresentar conceitos básicos sobre coincidências e pontos fixos de aplicações contínuas usando como ferramentas os Lemas Combinatórios de Sperner e grau de aplicações. Apresentamos também um cálculo do número de Lefschetz de f; g : T2 ¡! T3, onde Th denota uma superfície de genus h, através da fórmula dada por Gonçalves e Oliveira em [3] / Abstract: The main goal of this work is present basic concepts on coincidences and fixed points of continuous maps with Sperner's Combinatorial Lemmas, and degree maps approaches. We also present a calculation of the Lefschetz number of f; g : T2 ¡! T3, where Th denotes surface of genus h, by using the formula given by Gonçalves and Oliveira in [3] / Mestre
106

Teoremas de ponto fixo, teoria dos jogos e existência do Equilíbrio de Nash em jogos finitos em forma normal

Guarnieri, Felipe Milan January 2018 (has links)
Neste trabalho demonstram-se os teoremas de ponto fixo de Brouwer e Kakutani com o objetivo de provar a existência do equilíbrio de Nash em jogos finitos em forma normal. No primeiro capítulo apresentam-se as definições de teoria dos jogos, começando com jogos finitos em forma normal e terminando com o conceito de equilíbrio de Nash. Na primeira seção do capítulo dois desenvolve-se a teoria de simplexes, em Rn, e se demonstra o teorema de Brouwer. Na seção seguinte, são relacionadas as propriedades de semi-continuidade superior e gráfico fechado em set functions, para então provar os teoremas de Celina e von Neumann que, em conjunto com o teorema de Brouwer, resultam no teorema de Kakutani no fim da seção. Como último resultado é demonstrado o teorema de existência do equilíbrio de Nash em jogos finitos em forma normal através do teorema de Kakutani, mostrando que o equilíbrio de Nash é um ponto fixo de uma set function. / In this work, the fixed-point theorems of Kakutani and Brouwer are proved with the intention of showing the existence of Nash equilibrium in finite normal-form games. In the first chapter the needed definitions of game theory are shown, starting with finite normal-form games and ending with the concept of Nash equilibrium. In the first section of chapter two, simplex theory in Rn is developed and then the Brouwer fixer point theorem is proved. In the next section, some relations of upper hemi-continuity and closed graph in set functions are shown, then proving the theorems of Celina and von Neumann that, along with Brouwer theorem, result in Kakutani fixed-point theorem in the end of the section. As the last result, the existence of Nash equilibrium in finite normal-form games is proved through Kakutani’s theorem, relating the Nash equilibrium to the fixed-point of a set function.
107

Ponto fixo: uma introdução no ensino médio

Albuquerque, Philipe Thadeo Lima Ferreira [UNESP] 21 February 2014 (has links) (PDF)
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
108

O teorema de Lefschetz-Hopf e sua relação com outros teoremas clássicos da topologia /

Galves, Ana Paula Tremura. January 2009 (has links)
Orientador: Maria Gorete Carreira Andrade / Banca: Denise de Mattos / Banca: Ermínia de Lourdes Campello Fanti / Resumo: Em Topologia, mais especificamente em Topologia Algébrica, temos alguns resultados clássicos que de alguma forma estão relacionados. No desenvolvimento deste trabalho, estudamos alguns desses resultados, a saber: Teorema de Lefschetz-Hopf, Teorema do Ponto Fixo de Lefschetz, Teorema do Ponto Fixo de Brouwer, Teorema da Curva de Jordan e o Teorema Clássico de Borsuk-Ulam. Além disso, tivemos como objetivo principal mostrar relações existentes entre esses teoremas a partir do Teorema de Lefschetz-Hopf. / Abstract: In Topology, more specifically in Algebraic Topology, we have some classical results that are in some way related. In developing this work, we studied some of these results, namely the Lefschetz-Hopf Theorem, the Lefschetz Fixed Point Theorem, the Brouwer Fixed Point Theorem, the Jordan Curve Theorem and the Classic Borsuk-Ulam Theorem. Moreover, our main objective was to show relationships among those theorems by using Lefschetz-Hopf Theorem. / Mestre
109

Soluções clássicas para uma equação elíptica semilinear não homogênea

Rocha, Suelen de Souza 25 August 2011 (has links)
Submitted by Maike Costa (maiksebas@gmail.com) on 2016-03-29T13:33:49Z No. of bitstreams: 1 arquivo total.pdf: 5320246 bytes, checksum: 158dd460a20ce46c96d4a34623612264 (MD5) / Made available in DSpace on 2016-03-29T13:33:49Z (GMT). No. of bitstreams: 1 arquivo total.pdf: 5320246 bytes, checksum: 158dd460a20ce46c96d4a34623612264 (MD5) Previous issue date: 2011-08-25 / This work is mainly concerned with the existence and nonexistence of classical solution to the nonhomogeneous semilinear equation Δu + up + f(x) = 0 in Rn, u > 0 in Rn, when n 3, where f 0 is a Hölder continuous function. The nonexistence of classical solution is established when 1 < p n=(n 􀀀 2). For p > n=(n 􀀀 2) there may be both existence and nonexistence results depending on the asymptotic behavior of f at infinity. The existence results were obtained by employed sub and supersolutions techniques and fixed point theorem. For the nonexistence of classical solution we used a priori integral estimates obtained via averaging. / Neste trabalho, estamos interessados na existência e não existência de solução clássica para a equação não homogênea semilinear Δu + up + f(x) = 0 em Rn; u > 0 em Rn, n 3 onde f 0 é uma função Hölder contínua. A não existência de solução clássica é estabelecida quando 1 < p n=(n 􀀀 2). Para p > n=(n 􀀀 2), temos resultados de existência e não existência de solução clássica, dependendo do comportamento assin- tótico de f no infinito. Os resultados de existência foram obtidos usando o método de sub e supersolução e teoremas de ponto fixo. A não existência de solução clássica é obtida usando-se estimativas integrais a priori via média esférica.
110

Methods to evaluate accuracy-energy trade-off in operator-level approximate computing / Méthodes d'évaluation du compromis précision-énergie pour le calcul approximatif niveau opérateur

Barrois, Benjamin 11 December 2017 (has links)
Les limites physiques des circuits à base de silicium étant en passe d'être atteintes, de nouveaux moyens doivent être trouvés pour outrepasser la fin de la loi de Moore. Beaucoup d'applications peuvent tolérer des approximations dans leurs calculs à différents niveaux, sans dégrader la qualité de leur sortie, ou en la dégradant de manière acceptable. Cette thèse se concentre sur les architectures arithmétiques approximatives afin de saisir cette opportunité. Tout d'abord, une étude critique de l'état de l'art des additionneurs et multiplieurs approximatifs est présentée. Ensuite, un modèle de propagation d'erreur virgule-fixe mettant en œuvre la densité spectrale de puissance est proposée, suivi d'un modèle de propagation du taux d'erreur binaire positionnel des opérateurs approximatifs. Les opérateurs approximatifs sont ensuite utilisés pour la reproduction des effets de la VOS dans les opérateurs arithmétiques exacts. Grâce à notre outil de travail open-source ApxPerf et ses bibliothèques synthétisables C++ apx_fixed pour les opérateurs approximatifs et ct_float pour l'arithmétique flottante basse consommation, deux études consécutives sont proposées, basées sur des applications de traitement du signal complexes. Tout d'abord, les opérateurs approximatifs sont comparés à l'arithmétique virgule-fixe, et la supériorité de la virgule-fixe est soulignée. Enfin, la virgule fixe est comparée aux petits flottants dans des conditions équivalentes. En fonction des conditions applicatives, la virgule-flottante montre une compétitivité inattendue face à la virgule-fixe. Les résultats et discussions de cette thèse donnent un regard nouveau sur l'arithmétique approximative et suggère de nouvelles directions pour le futur des architectures efficaces en énergie. / The physical limits being reached in silicon-based computing, new ways have to be found to overcome the predicted end of Moore's law. Many applications can tolerate approximations in their computations at several levels without degrading the quality of their output, or degrading it in an acceptable way. This thesis focuses on approximate arithmetic architectures to seize this opportunity. Firstly, a critical study of state-of-the-art approximate adders and multipliers is presented. Then, a model for fixed-point error propagation leveraging power spectral density is proposed, followed by a model for bitwise-error rate propagation of approximate operators. Approximate operators are then used for the reproduction of voltage over-scaling effects in exact arithmetic operators. Leveraging our open-source framework ApxPerf and its synthesizable template-based C++ libraries apx_fixed for approximate operators, and ct_float for low-power floating-point arithmetic, two consecutive studies are proposed leveraging complex signal processing applications. Firstly, approximate operators are compared to fixed-point arithmetic, and the superiority of fixed-point is highlighted. Secondly, fixed-point is compared to small-width floating-point in equivalent conditions. Depending on the applicative conditions, floating-point shows an unexpected competitiveness compared to fixed-point. The results and discussions of this thesis give a fresh look on approximate arithmetic and suggest new directions for the future of energy-efficient architectures.

Page generated in 0.0652 seconds