953 resultados para iterative method
Resumo:
Some results on fixed points related to the contractive compositions of bounded operators in a class of complete metric spaces which can be also considered as Banach's spaces are discussed through the paper. The class of composite operators under study can include, in particular, sequences of projection operators under, in general, oblique projective operators. In this paper we are concerned with composite operators which include sequences of pairs of contractive operators involving, in general, oblique projection operators. The results are generalized to sequences of, in general, nonconstant bounded closed operators which can have bounded, closed, and compact limit operators, such that the relevant composite sequences are also compact operators. It is proven that in both cases, Banach contraction principle guarantees the existence of unique fixed points under contractive conditions.
Resumo:
A DFT/MD mutual iterative method was employed to give insights into the mechanism of voltage generation based on water-fitted single-walled carbon nanotubes (SWCNTs). Our calculations showed that a constant voltage difference of several mV would generate between the two ends of a carbon nanotube, due to interactions between the water dipole chains and charge carriers in the tube. Our work validates this structure of a water-fitted SWCNT as a promising candidate for a synthetic nanoscale power cell, as well as a practical nanopower harvesting device at the atomic level.
Resumo:
I. Existence and Structure of Bifurcation Branches
The problem of bifurcation is formulated as an operator equation in a Banach space, depending on relevant control parameters, say of the form G(u,λ) = 0. If dimN(G_u(u_O,λ_O)) = m the method of Lyapunov-Schmidt reduces the problem to the solution of m algebraic equations. The possible structure of these equations and the various types of solution behaviour are discussed. The equations are normally derived under the assumption that G^O_λεR(G^O_u). It is shown, however, that if G^O_λεR(G^O_u) then bifurcation still may occur and the local structure of such branches is determined. A new and compact proof of the existence of multiple bifurcation is derived. The linearized stability near simple bifurcation and "normal" limit points is then indicated.
II. Constructive Techniques for the Generation of Solution Branches
A method is described in which the dependence of the solution arc on a naturally occurring parameter is replaced by the dependence on a form of pseudo-arclength. This results in continuation procedures through regular and "normal" limit points. In the neighborhood of bifurcation points, however, the associated linear operator is nearly singular causing difficulty in the convergence of continuation methods. A study of the approach to singularity of this operator yields convergence proofs for an iterative method for determining the solution arc in the neighborhood of a simple bifurcation point. As a result of these considerations, a new constructive proof of bifurcation is determined.
Resumo:
O uso de técnicas com o funcional de Tikhonov em processamento de imagens tem sido amplamente usado nos últimos anos. A ideia básica nesse processo é modificar uma imagem inicial via equação de convolução e encontrar um parâmetro que minimize esse funcional afim de obter uma aproximação da imagem original. Porém, um problema típico neste método consiste na seleção do parâmetro de regularização adequado para o compromisso entre a acurácia e a estabilidade da solução. Um método desenvolvido por pesquisadores do IPRJ e UFRJ, atuantes na área de problemas inversos, consiste em minimizar um funcional de resíduos através do parâmetro de regularização de Tikhonov. Uma estratégia que emprega a busca iterativa deste parâmetro visando obter um valor mínimo para o funcional na iteração seguinte foi adotada recentemente em um algoritmo serial de restauração. Porém, o custo computacional é um fator problema encontrado ao empregar o método iterativo de busca. Com esta abordagem, neste trabalho é feita uma implementação em linguagem C++ que emprega técnicas de computação paralela usando MPI (Message Passing Interface) para a estratégia de minimização do funcional com o método de busca iterativa, reduzindo assim, o tempo de execução requerido pelo algoritmo. Uma versão modificada do método de Jacobi é considerada em duas versões do algoritmo, uma serial e outra em paralelo. Este algoritmo é adequado para implementação paralela por não possuir dependências de dados como de Gauss-Seidel que também é mostrado a convergir. Como indicador de desempenho para avaliação do algoritmo de restauração, além das medidas tradicionais, uma nova métrica que se baseia em critérios subjetivos denominada IWMSE (Information Weighted Mean Square Error) é empregada. Essas métricas foram introduzidas no programa serial de processamento de imagens e permitem fazer a análise da restauração a cada passo de iteração. Os resultados obtidos através das duas versões possibilitou verificar a aceleração e a eficiência da implementação paralela. A método de paralelismo apresentou resultados satisfatórios em um menor tempo de processamento e com desempenho aceitável.
Resumo:
A detailed model for semiconductor linear optical amplifiers (LOAs) with gain clamping by a vertical laser field is presented, which accounts the carrier and photon density distribution in the longitudinal direction as well as the facet reflectivity. The photon iterative method is used in the simulation with output amplified spontaneous emission spectrum in the wide band as iterative variables. The gain saturation behaviors and the noise figure are numerically simulated, and the variation of longitudinal carrier density with the input power is presented which is associated with the ON-OFF state of the vertical lasers. The results show that the LOA can have a gain spectrum clamped in a wide wavelength range and have almost the same value of noise figure as that of conventional semiconductor optical amplifiers (SOAs). Numerical results also show that an LOA can have a noise figure about 2 dB less than that of the SOA gain clamped by a distributed Bragg reflector laser.
Resumo:
迭代方法求解P3P问题的成立条件一直困扰着基于P3P的模型定位方法在实际中的应用。本文对于迭代方法求解P3P问题的成立条件做了比较完整的分析,在对于P3P问题的参数方程和目标方程进行介绍后给出了针对任意三角形用迭代方法求解P3P问题的成立条件。
Resumo:
本文叙述一种用光学反射传感器自动确定机器人在工作坐标中的起始参考位置的方法。装在机器人手爪边上的光学反射传感器与工作面上的T形目标相配合,用自动反复循环定位法确定机器人在工作坐标中的期望起始点。实践和理论分析表明,虽然开机时的机器人手爪的原始位置基本上是随机的,但手爪都能自动精确地收敛到期望的起始点上。
Resumo:
Wydział Fizyki:Instytut Obserwatorium Astronomiczne
Resumo:
An iterative method for reconstructing a 3D polygonal mesh and color texture map from multiple views of an object is presented. In each iteration, the method first estimates a texture map given the current shape estimate. The texture map and its associated residual error image are obtained via maximum a posteriori estimation and reprojection of the multiple views into texture space. Next, the surface shape is adjusted to minimize residual error in texture space. The surface is deformed towards a photometrically-consistent solution via a series of 1D epipolar searches at randomly selected surface points. The texture space formulation has improved computational complexity over standard image-based error approaches, and allows computation of the reprojection error and uncertainty for any point on the surface. Moreover, shape adjustments can be constrained such that the recovered model's silhouette matches those of the input images. Experiments with real world imagery demonstrate the validity of the approach.
Resumo:
New compensation methods are presented that can greatly reduce the slit errors (i.e. transition location errors) and interval errors induced due to non-idealities in optical incremental encoders (square-wave). An M/T-type, constant sample-time digital tachometer (CSDT) is selected for measuring the velocity of the sensor drives. Using this data, three encoder compensation techniques (two pseudoinverse based methods and an iterative method) are presented that improve velocity measurement accuracy. The methods do not require precise knowledge of shaft velocity. During the initial learning stage of the compensation algorithm (possibly performed in-situ), slit errors/interval errors are calculated through pseudoinversebased solutions of simple approximate linear equations, which can provide fast solutions, or an iterative method that requires very little memory storage. Subsequent operation of the motion system utilizes adjusted slit positions for more accurate velocity calculation. In the theoretical analysis of the compensation of encoder errors, encoder error sources such as random electrical noise and error in estimated reference velocity are considered. Initially, the proposed learning compensation techniques are validated by implementing the algorithms in MATLAB software, showing a 95% to 99% improvement in velocity measurement. However, it is also observed that the efficiency of the algorithm decreases with the higher presence of non-repetitive random noise and/or with the errors in reference velocity calculations. The performance improvement in velocity measurement is also demonstrated experimentally using motor-drive systems, each of which includes a field-programmable gate array (FPGA) for CSDT counting/timing purposes, and a digital-signal-processor (DSP). Results from open-loop velocity measurement and closed-loop servocontrol applications, on three optical incremental square-wave encoders and two motor drives, are compiled. While implementing these algorithms experimentally on different drives (with and without a flywheel) and on encoders of different resolutions, slit error reductions of 60% to 86% are obtained (typically approximately 80%).
Resumo:
This paper presents a method for generating Pareto-optimal solutions in multi-party negotiations. In this iterative method, decision makers (DMs) formulate proposals that yield a minimum payoff to their opponents. Each proposal belongs to the efficient frontier, DMs try to adjust to a common one. In this setting, each DM is supposed to have a given bargaining power. More precisely each DM is supposed to have a subjective estimate of the power of the different parties. We study the convergence of the method, and provide examples where there is no possible agreement resulting from it.
Resumo:
Esta dissertação estuda essencialmente dois problemas: (A) uma classe de equações unidimensionais de reacção-difusão-convecção em meios não uniformes (dependentes do espaço), e (B) um problema elíptico não-linear e paramétrico ligado a fenómenos de capilaridade. A Análise de Perturbação Singular e a dinâmica de Hamilton-Jacobi são utilizadas na obtenção de expressões assimptóticas para a solução (com comportamento de frente) e para a sua velocidade de propagação. Os seguintes três métodos de decomposição, Adomian Decomposition Method (ADM), Decomposition Method based on Infinite Products (DIP), e New Iterative Method (NIM), são apresentados e brevemente comparados. Adicionalmente, condições suficientes para a convergência da solução em série, obtida pelo ADM, e uma aplicação a um problema da Telecomunicações por Fibras Ópticas, envolvendo EDOs não-lineares designadas equações de Raman, são discutidas. Um ponto de vista mais abrangente que unifica os métodos de decomposição referidos é também apresentado. Para subclasses desta EDP são obtidas soluções numa forma explícita, para diferentes tipos de dados e usando uma variante do método de simetrias de Bluman-Cole. Usando Teoria de Pontos Críticos (o teorema usualmente designado mountain pass) e técnicas de truncatura, prova-se a existência de duas soluções não triviais (uma positiva e uma negativa) para o problema elíptico não-linear e paramétrico (B). A existência de uma terceira solução não trivial é demonstrada usando Grupos Críticos e Teoria de Morse.
Resumo:
Tese de mestrado integrado em Engenharia da Energia e do Ambiente, apresentada à Universidade de Lisboa, através da Faculdade de Ciências, 2014
Resumo:
Trabalho de Dissertação de natureza científica para obtenção do grau de Mestre em Engenharia Civil na Área de Especialização em Estruturas
Resumo:
Active microwave imaging is explored as an imaging modality for early detection of breast cancer. When exposed to microwaves, breast tumor exhibits electrical properties that are significantly different from that of healthy breast tissues. The two approaches of active microwave imaging — confocal microwave technique with measured reflected signals and microwave tomographic imaging with measured scattered signals are addressed here. Normal and malignant breast tissue samples of same person are subjected to study within 30 minutes of mastectomy. Corn syrup is used as coupling medium, as its dielectric parameters show good match with that of the normal breast tissue samples. As bandwidth of the transmitter is an important aspect in the time domain confocal microwave imaging approach, wideband bowtie antenna having 2:1 VSWR bandwidth of 46% is designed for the transmission and reception of microwave signals. Same antenna is used for microwave tomographic imaging too at the frequency of 3000 MHz. Experimentally obtained time domain results are substantiated by finite difference time domain (FDTD) analysis. 2-D tomographic images are reconstructed with the collected scattered data using distorted Born iterative method. Variations of dielectric permittivity in breast samples are distinguishable from the obtained permittivity profiles.