Spelling suggestions: "subject:"iterative methods (mathematics)"" "subject:"iterative methods (amathematics)""
131 |
Iterative detection for wireless communicationsShaheem, Asri January 2008 (has links)
[Truncated abstract] The transmission of digital information over a wireless communication channel gives rise to a number of issues which can detract from the system performance. Propagation effects such as multipath fading and intersymbol interference (ISI) can result in significant performance degradation. Recent developments in the field of iterative detection have led to a number of powerful strategies that can be effective in mitigating the detrimental effects of wireless channels. In this thesis, iterative detection is considered for use in two distinct areas of wireless communications. The first considers the iterative decoding of concatenated block codes over slow flat fading wireless channels, while the second considers the problem of detection for a coded communications system transmitting over highly-dispersive frequency-selective wireless channels. The iterative decoding of concatenated codes over slow flat fading channels with coherent signalling requires knowledge of the fading amplitudes, known as the channel state information (CSI). The CSI is combined with statistical knowledge of the channel to form channel reliability metrics for use in the iterative decoding algorithm. When the CSI is unknown to the receiver, the existing literature suggests the use of simple approximations to the channel reliability metric. However, these works generally consider low rate concatenated codes with strong error correcting capabilities. In some situations, the error correcting capability of the channel code must be traded for other requirements, such as higher spectral efficiency, lower end-to-end latency and lower hardware cost. ... In particular, when the error correcting capabilities of the concatenated code is weak, the conventional metrics are observed to fail, whereas the proposed metrics are shown to perform well regardless of the error correcting capabilities of the code. The effects of ISI caused by a frequency-selective wireless channel environment can also be mitigated using iterative detection. When the channel can be viewed as a finite impulse response (FIR) filter, the state-of-the-art iterative receiver is the maximum a posteriori probability (MAP) based turbo equaliser. However, the complexity of this receiver's MAP equaliser increases exponentially with the length of the FIR channel. Consequently, this scheme is restricted for use in systems where the channel length is relatively short. In this thesis, the use of a channel shortening prefilter in conjunction with the MAP-based turbo equaliser is considered in order to allow its use with arbitrarily long channels. The prefilter shortens the effective channel, thereby reducing the number of equaliser states. A consequence of channel shortening is that residual ISI appears at the input to the turbo equaliser and the noise becomes coloured. In order to account for the ensuing performance loss, two simple enhancements to the scheme are proposed. The first is a feedback path which is used to cancel residual ISI, based on decisions from past iterations. The second is the use of a carefully selected value for the variance of the noise assumed by the MAP-based turbo equaliser. Simulations are performed over a number of highly dispersive channels and it is shown that the proposed enhancements result in considerable performance improvements. Moreover, these performance benefits are achieved with very little additional complexity with respect to the unmodified channel shortened turbo equaliser.
|
132 |
Methods for increased computational efficiency of multibody simulationsEpple, Alexander 08 August 2008 (has links)
This thesis is concerned with the efficient numerical simulation of finite element based flexible multibody systems. Scaling operations are systematically applied to the governing index-3 differential algebraic equations in order to solve the problem of ill conditioning for small time step sizes. The importance of augmented Lagrangian terms is demonstrated. The use of fast sparse solvers is justified for the solution of the linearized equations of motion resulting in significant savings of computational costs.
Three time stepping schemes for the integration of the governing equations of flexible multibody systems are discussed in detail. These schemes are the two-stage Radau IIA scheme, the energy decaying scheme, and the generalized-α method. Their formulations are adapted to the specific structure of the governing equations of flexible multibody systems. The efficiency of the time integration schemes is comprehensively evaluated on a series of test problems.
Formulations for structural and constraint elements are reviewed and the problem of interpolation of finite rotations in geometrically exact structural elements is revisited. This results in the development of a new improved interpolation algorithm, which preserves the objectivity of the strain field and guarantees stable simulations in the presence of arbitrarily large rotations.
Finally, strategies for the spatial discretization of beams in the presence of steep variations in cross-sectional properties are developed. These strategies reduce the number of degrees of freedom needed to accurately analyze beams with discontinuous properties, resulting in improved computational efficiency.
|
133 |
Tuned and asynchronous stencil kernels for CPU/GPU systemsVenkatasubramanian, Sundaresan 18 May 2009 (has links)
We describe heterogeneous multi-CPU and multi-GPU implementations of Jacobi's iterative method for the 2-D Poisson equation on a structured grid, in both single- and double-precision. Properly tuned, our best implementation achieves 98% of the empirical streaming GPU bandwidth (66% of peak) on a NVIDIA C1060. Motivated to find a still faster implementation, we further consider "wildly asynchronous" implementations that can reduce or even eliminate the synchronization bottleneck between iterations. In these versions, which are based on the principle of a chaotic relaxation (Chazan and Miranker, 1969), we simply remove or delay synchronization between iterations, thereby potentially trading off more flops (via more iterations to converge) for a higher degree of asynchronous parallelism. Our relaxed-synchronization implementations on a GPU can be 1.2-2.5x faster than our best synchronized GPU implementation while achieving the same accuracy. Looking forward, this result suggests research on similarly "fast-and-loose" algorithms in the coming era of increasingly massive concurrency and relatively high synchronization or communication costs.
|
134 |
Problemas inversos sobre a esfera / Inverse problems of the sphereFábio Freitas Ferreira 29 August 2008 (has links)
Fundação Carlos Chagas Filho de Amparo a Pesquisa do Estado do Rio de Janeiro / O objetivo desta tese é o desenvolvimento de algoritmos para determinar as soluções, e para determinação de fontes, das equações de Poisson e da condução de calor definidas em uma esfera. Determinamos as formas das equações de Poisson e de calor sobre a esfera, e desenvolvemos métodos iterativos, baseados em uma malha icosaedral e sua respectiva malha dual, para obter as soluções das mesmas. Mostramos que os métodos iterativos convergem para as soluções das equações discretizadas. Empregamos o método de regularização iterada de Alifanov para resolver o problema inverso, de determinação de fonte, definido na esfera. / The objective of this thesis is the development of algorithms to determine the solutions, and for determination of sources of, the equations of Poisson and heat conduction for a sphere. We establish the form of equations of Poisson and heat on the sphere, and developed iterative methods, based on a icosaedral mesh and its dual mesh, to obtain the solutions for them. It is shown that the iterative methods converge to the solutions of the equations discretizadas. It employed the method of settlement of Alifanov iterated to solve the inverse problem, determination of source, set in the sphere.
|
135 |
Reconstrução de imagens de ultrassom utilizando regularização l1 através de mínimos quadrados iterativamente reponderados e gradiente conjugadoPassarin, Thiago Alberto Rigo 13 December 2013 (has links)
Este trabalho apresenta um método de reconstrução de imagens de ultrassom por problemas inversos que tem como penalidade para o erro entre solução e dados a norma L2, ou euclidiana, e como penalidade de regularização a norma L1. A motivação para o uso da regularização L1 é que se trata de um tipo de regularização promotora de esparsidade na solução. A esparsidade da regularização L1 contorna o problema de excesso do artefatos, observado em outras implementações de reconstrução por problemas inversos em ultrassom. Este problema é consequência principalmente da limitação da representação discreta do objeto contínuo no modelo
de aquisição. Por conta desta limitação, objetos refletores na área imageada quase sempre localizam-se em posições que não correspondem precisamente a uma das posições do modelo discreto, gerando dados que não correspondem aos dados modelados. As formulações do problema com regularização L2 e com regularização L1 são apresentadas e comparadas dos pontos de vista geométrico e Bayesiano. O algoritmo de otimização proposto é uma implementação do algoritmo Iteratively Reweighted Least Squares (IRLS) e utiliza o método do Gradiente Conjugado (CG -
Conjugate Gradient) a cada iteração, sendo chamado de IRLS-CG. São realizadas simulações com phantoms computacionais que mostram que o método permite reconstruir imagens a partir da aquisição de dados com refletores em posições não modeladas sem a observação de artefatos. As simulações também mostram melhor resolução espacial do método proposto com relação ao algoritmo delay-and-sum (DAS). Também se observou melhor desempenho computacional do CG com relação à matriz inversa nas iterações do IRLS. / This work presents an inverse problem based method for ultrasound image reconstruction which uses the L2-norm (or euclidean norm) as a penalty for the error between the data and the solution, and the L1-norm as a regularization penalty. The motivation for the use of of L1 regularization is the sparsity promoting property of this type of regularization. The sparsity of L1 regularization circumvents the problem of excess of artifatcts that is observed in other approaches of inverse problem based reconstrucion in ultrasound. Such problem is mainly a consequence of the limitation
in the discrete representation of a continuous object in the acquisition model. Due to this limitation, reflecting objects in the imaged area are often localized in positions that do not correspond precisely to one of the positions in the discrete model, therefore generating data that do not correspond to the model data. The formulations of the problem with L2 regularization and with L1 regularization are presented and compared in geometric and Bayesian terms. The optimization algorithm proposed is an implementation of Iteratively Reweighted Least Squares (IRLS) and uses the Conjugate Gradient (CG) method inside each iteration, thus being called IRLS-CG. Simulations with computer phantoms are realized showing that the proposed method allows for the reconstruction of images, without observable artifacts, from data with reflectors located in non-modeled positions. Simulations also show a better spatial resolution in the proposed method when compared to the delay-and-sum (DAS) algorithm. It was also observed better computational performance of CG when compared to the matrix inversion in the iterations of IRLS.
|
136 |
Reconstrução de imagens de ultrassom utilizando regularização l1 através de mínimos quadrados iterativamente reponderados e gradiente conjugadoPassarin, Thiago Alberto Rigo 13 December 2013 (has links)
Este trabalho apresenta um método de reconstrução de imagens de ultrassom por problemas inversos que tem como penalidade para o erro entre solução e dados a norma L2, ou euclidiana, e como penalidade de regularização a norma L1. A motivação para o uso da regularização L1 é que se trata de um tipo de regularização promotora de esparsidade na solução. A esparsidade da regularização L1 contorna o problema de excesso do artefatos, observado em outras implementações de reconstrução por problemas inversos em ultrassom. Este problema é consequência principalmente da limitação da representação discreta do objeto contínuo no modelo
de aquisição. Por conta desta limitação, objetos refletores na área imageada quase sempre localizam-se em posições que não correspondem precisamente a uma das posições do modelo discreto, gerando dados que não correspondem aos dados modelados. As formulações do problema com regularização L2 e com regularização L1 são apresentadas e comparadas dos pontos de vista geométrico e Bayesiano. O algoritmo de otimização proposto é uma implementação do algoritmo Iteratively Reweighted Least Squares (IRLS) e utiliza o método do Gradiente Conjugado (CG -
Conjugate Gradient) a cada iteração, sendo chamado de IRLS-CG. São realizadas simulações com phantoms computacionais que mostram que o método permite reconstruir imagens a partir da aquisição de dados com refletores em posições não modeladas sem a observação de artefatos. As simulações também mostram melhor resolução espacial do método proposto com relação ao algoritmo delay-and-sum (DAS). Também se observou melhor desempenho computacional do CG com relação à matriz inversa nas iterações do IRLS. / This work presents an inverse problem based method for ultrasound image reconstruction which uses the L2-norm (or euclidean norm) as a penalty for the error between the data and the solution, and the L1-norm as a regularization penalty. The motivation for the use of of L1 regularization is the sparsity promoting property of this type of regularization. The sparsity of L1 regularization circumvents the problem of excess of artifatcts that is observed in other approaches of inverse problem based reconstrucion in ultrasound. Such problem is mainly a consequence of the limitation
in the discrete representation of a continuous object in the acquisition model. Due to this limitation, reflecting objects in the imaged area are often localized in positions that do not correspond precisely to one of the positions in the discrete model, therefore generating data that do not correspond to the model data. The formulations of the problem with L2 regularization and with L1 regularization are presented and compared in geometric and Bayesian terms. The optimization algorithm proposed is an implementation of Iteratively Reweighted Least Squares (IRLS) and uses the Conjugate Gradient (CG) method inside each iteration, thus being called IRLS-CG. Simulations with computer phantoms are realized showing that the proposed method allows for the reconstruction of images, without observable artifacts, from data with reflectors located in non-modeled positions. Simulations also show a better spatial resolution in the proposed method when compared to the delay-and-sum (DAS) algorithm. It was also observed better computational performance of CG when compared to the matrix inversion in the iterations of IRLS.
|
137 |
Problemas inversos sobre a esfera / Inverse problems of the sphereFábio Freitas Ferreira 29 August 2008 (has links)
Fundação Carlos Chagas Filho de Amparo a Pesquisa do Estado do Rio de Janeiro / O objetivo desta tese é o desenvolvimento de algoritmos para determinar as soluções, e para determinação de fontes, das equações de Poisson e da condução de calor definidas em uma esfera. Determinamos as formas das equações de Poisson e de calor sobre a esfera, e desenvolvemos métodos iterativos, baseados em uma malha icosaedral e sua respectiva malha dual, para obter as soluções das mesmas. Mostramos que os métodos iterativos convergem para as soluções das equações discretizadas. Empregamos o método de regularização iterada de Alifanov para resolver o problema inverso, de determinação de fonte, definido na esfera. / The objective of this thesis is the development of algorithms to determine the solutions, and for determination of sources of, the equations of Poisson and heat conduction for a sphere. We establish the form of equations of Poisson and heat on the sphere, and developed iterative methods, based on a icosaedral mesh and its dual mesh, to obtain the solutions for them. It is shown that the iterative methods converge to the solutions of the equations discretizadas. It employed the method of settlement of Alifanov iterated to solve the inverse problem, determination of source, set in the sphere.
|
Page generated in 0.1121 seconds