A generalized alternating-direction implicit scheme for incompressible magnetohydrodynamic viscous flows at low magnetic Reynolds number

This paper presents numerical simulations of incompressible fluid flows in the presence of a magnetic field at low magnetic Reynolds number. The equations governing the flow are the Navier-Stokes equations of fluid motion coupled with Maxwell's equations of electromagnetics. The study of fluid flows under the influence of a magnetic field and with no free electric charges or electric fields is known as magnetohydrodynamics. The magnetohydrodynamics approximation is considered for the formulation of the non-dimensional problem and for the characterization of similarity parameters. A finite-difference technique is used to discretize the equations. In particular, an extension of the generalized Peaceman and Rachford alternating-direction implicit (ADI) scheme for simulating two-dimensional fluid flows is presented. The discretized conservation equations are solved in stream function-vorticity formulation. We compare the ADI and generalized ADI schemes, and show that the latter is more efficient in simulating low Reynolds number and magnetic Reynolds number problems. Numerical results demonstrating the applicability of this technique are also presented. The simulation of incompressible magneto hydrodynamic fluid flows is illustrated by numerical solution for two-dimensional cases. (c) 2007 Elsevier B.V. All rights reserved.

Numerical studies of the Stone algorithm and comparisons with Alternating Direction Implicit methods /

Thesis (M.S.)--University of Illinois, 1970.

Security and Trust in Distributed Computation

We propose three research problems to explore the relations between trust and security in the setting of distributed computation. In the first problem, we study trust-based adversary detection in distributed consensus computation. The adversaries we consider behave arbitrarily disobeying the consensus protocol. We propose a trust-based consensus algorithm with local and global trust evaluations. The algorithm can be abstracted using a two-layer structure with the top layer running a trust-based consensus algorithm and the bottom layer as a subroutine executing a global trust update scheme. We utilize a set of pre-trusted nodes, headers, to propagate local trust opinions throughout the network. This two-layer framework is flexible in that it can be easily extensible to contain more complicated decision rules, and global trust schemes. The first problem assumes that normal nodes are homogeneous, i.e. it is guaranteed that a normal node always behaves as it is programmed. In the second and third problems however, we assume that nodes are heterogeneous, i.e, given a task, the probability that a node generates a correct answer varies from node to node. The adversaries considered in these two problems are workers from the open crowd who are either investing little efforts in the tasks assigned to them or intentionally give wrong answers to questions. In the second part of the thesis, we consider a typical crowdsourcing task that aggregates input from multiple workers as a problem in information fusion. To cope with the issue of noisy and sometimes malicious input from workers, trust is used to model workers' expertise. In a multi-domain knowledge learning task, however, using scalar-valued trust to model a worker's performance is not sufficient to reflect the worker's trustworthiness in each of the domains. To address this issue, we propose a probabilistic model to jointly infer multi-dimensional trust of workers, multi-domain properties of questions, and true labels of questions. Our model is very flexible and extensible to incorporate metadata associated with questions. To show that, we further propose two extended models, one of which handles input tasks with real-valued features and the other handles tasks with text features by incorporating topic models. Our models can effectively recover trust vectors of workers, which can be very useful in task assignment adaptive to workers' trust in the future. These results can be applied for fusion of information from multiple data sources like sensors, human input, machine learning results, or a hybrid of them. In the second subproblem, we address crowdsourcing with adversaries under logical constraints. We observe that questions are often not independent in real life applications. Instead, there are logical relations between them. Similarly, workers that provide answers are not independent of each other either. Answers given by workers with similar attributes tend to be correlated. Therefore, we propose a novel unified graphical model consisting of two layers. The top layer encodes domain knowledge which allows users to express logical relations using first-order logic rules and the bottom layer encodes a traditional crowdsourcing graphical model. Our model can be seen as a generalized probabilistic soft logic framework that encodes both logical relations and probabilistic dependencies. To solve the collective inference problem efficiently, we have devised a scalable joint inference algorithm based on the alternating direction method of multipliers. The third part of the thesis considers the problem of optimal assignment under budget constraints when workers are unreliable and sometimes malicious. In a real crowdsourcing market, each answer obtained from a worker incurs cost. The cost is associated with both the level of trustworthiness of workers and the difficulty of tasks. Typically, access to expert-level (more trustworthy) workers is more expensive than to average crowd and completion of a challenging task is more costly than a click-away question. In this problem, we address the problem of optimal assignment of heterogeneous tasks to workers of varying trust levels with budget constraints. Specifically, we design a trust-aware task allocation algorithm that takes as inputs the estimated trust of workers and pre-set budget, and outputs the optimal assignment of tasks to workers. We derive the bound of total error probability that relates to budget, trustworthiness of crowds, and costs of obtaining labels from crowds naturally. Higher budget, more trustworthy crowds, and less costly jobs result in a lower theoretical bound. Our allocation scheme does not depend on the specific design of the trust evaluation component. Therefore, it can be combined with generic trust evaluation algorithms.

Regolarizzazione con Variazione Totale per il miglioramento di immagini di Risonanza Magnetica

In questo elaborato si propone il metodo di regolarizzazione mediante Variazione Totale per risolvere gli artefatti presenti nelle immagini di Risonanza Magnetica. Di particolare interesse sono gli artefatti di Gibbs, dovuti al troncamento dei dati, nel processo di acquisizione, e alla tecnica di ricostruzione basata sulla trasformata di Fourier. Il metodo proposto si fonda su un problema di minimo la cui funzione obiettivo è data dalla somma di un termine che garantisce la consistenza con i dati, e di un termine di penalizzazione, ovvero la Variazione Totale. Per la risoluzione di tale problema, si utilizza il metodo Alternating Direction Method of Multipliers (ADMM). In conclusione, si mostra l’efficacia del metodo descritto applicandolo ad alcuni problemi test con dati sintetici e reali.

An alternating boundary integral based method for a Cauchy problem for the Laplace equation in a quadrant

We study the Cauchy problem for the Laplace equation in a quadrant (quarter-plane) containing a bounded inclusion. Given the values of the solution and its derivative on the edges of the quadrant the solution is reconstructed on the boundary of the inclusion. This is achieved using an alternating iterative method where at each iteration step mixed boundary value problems are being solved. A numerical method is also proposed and investigated for the direct mixed problems reducing these to integral equations over the inclusion. Numerical examples verify the efficiency of the proposed scheme.

An alternating method for Cauchy problems for Helmholtz-type operators in non-homogeneous medium

Kozlov & Maz'ya (1989, Algebra Anal., 1, 144–170) proposed an alternating iterative method for solving Cauchy problems for general strongly elliptic and formally self-adjoint systems. However, in many applied problems, operators appear that do not satisfy these requirements, e.g. Helmholtz-type operators. Therefore, in this study, an alternating procedure for solving Cauchy problems for self-adjoint non-coercive elliptic operators of second order is presented. A convergence proof of this procedure is given.

An alternating boundary integral based method for a Cauchy problem for the Laplace equation in semi-infinite regions

We consider a Cauchy problem for the Laplace equation in a two-dimensional semi-infinite region with a bounded inclusion, i.e. the region is the intersection between a half-plane and the exterior of a bounded closed curve contained in the half-plane. The Cauchy data are given on the unbounded part of the boundary of the region and the aim is to construct the solution on the boundary of the inclusion. In 1989, Kozlov and Maz'ya [10] proposed an alternating iterative method for solving Cauchy problems for general strongly elliptic and formally self-adjoint systems in bounded domains. We extend their approach to our setting and in each iteration step mixed boundary value problems for the Laplace equation in the semi-infinite region are solved. Well-posedness of these mixed problems are investigated and convergence of the alternating procedure is examined. For the numerical implementation an efficient boundary integral equation method is proposed, based on the indirect variant of the boundary integral equation approach. The mixed problems are reduced to integral equations over the (bounded) boundary of the inclusion. Numerical examples are included showing the feasibility of the proposed method.

Numerical solution of an elliptic 3-dimensional Cauchy problem by the alternating method and boundary integral equations

We consider the Cauchy problem for the Laplace equation in 3-dimensional doubly-connected domains, that is the reconstruction of a harmonic function from knowledge of the function values and normal derivative on the outer of two closed boundary surfaces. We employ the alternating iterative method, which is a regularizing procedure for the stable determination of the solution. In each iteration step, mixed boundary value problems are solved. The solution to each mixed problem is represented as a sum of two single-layer potentials giving two unknown densities (one for each of the two boundary surfaces) to determine; matching the given boundary data gives a system of boundary integral equations to be solved for the densities. For the discretisation, Weinert's method [24] is employed, which generates a Galerkin-type procedure for the numerical solution via rewriting the boundary integrals over the unit sphere and expanding the densities in terms of spherical harmonics. Numerical results are included as well.

A Study on Unconditionally Stable FDTD Methods for the Modeling of Metamaterials

We assess the performance of three unconditionally stable finite-difference time-domain (FDTD) methods for the modeling of doubly dispersive metamaterials: 1) locally one-dimensional FDTD; 2) locally one-dimensional FDTD with Strang splitting; and (3) alternating direction implicit FDTD. We use both double-negative media and zero-index media as benchmarks.

Modelagem de perfis de indução no domínio do tempo por diferenças finitas

Apresentamos aqui uma metodologia alternativa para modelagem de ferramentas de indução diretamente no domínio do tempo. Este trabalho consiste na solução da equação de difusão do campo eletromagnético através do método de diferenças finitas. O nosso modelo consiste de um meio estratificado horizontalmente, através do qual simulamos um deslocamento da ferramenta na direção perpendicular às interfaces. A fonte consiste de uma bobina excitada por uma função degrau de corrente e o registro do campo induzido no meio é feito através de uma bobina receptora localizada acima da bobina transmissora. Na solução da equação de difusão determinamos o campo primário e o campo secundário separadamente. O campo primário é obtido analiticamente e o campo secundário é determinado utilizando-se o método de Direção Alternada Implícita, resultando num sistema tri-diagonal que é resolvido através do método recursivo proposto por Claerbout. Finalmente, determina-se o valor máximo do campo elétrico secundário em cada posição da ferramenta ao longo da formação, obtendo-se assim uma perfilagem no domínio do tempo. Os resultados obtidos mostram que este método é bastante eficiente na determinação do contato entre camadas, inclusive para camadas de pequena espessura.

An alternating potential based approach for a Cauchy problem for the Laplace equation in a planar domain with a cut

We consider a Cauchy problem for the Laplace equation in a bounded region containing a cut, where the region is formed by removing a sufficiently smooth arc (the cut) from a bounded simply connected domain D. The aim is to reconstruct the solution on the cut from the values of the solution and its normal derivative on the boundary of the domain D. We propose an alternating iterative method which involves solving direct mixed problems for the Laplace operator in the same region. These mixed problems have either a Dirichlet or a Neumann boundary condition imposed on the cut and are solved by a potential approach. Each of these mixed problems is reduced to a system of integral equations of the first kind with logarithmic and hypersingular kernels and at most a square root singularity in the densities at the endpoints of the cut. The full discretization of the direct problems is realized by a trigonometric quadrature method which has super-algebraic convergence. The numerical examples presented illustrate the feasibility of the proposed method.

An iterative method based on boundary integrals for elliptic Cauchy problems in semi-infinite domains

In this study, we investigate the problem of reconstruction of a stationary temperature field from given temperature and heat flux on a part of the boundary of a semi-infinite region containing an inclusion. This situation can be modelled as a Cauchy problem for the Laplace operator and it is an ill-posed problem in the sense of Hadamard. We propose and investigate a Landweber-Fridman type iterative method, which preserve the (stationary) heat operator, for the stable reconstruction of the temperature field on the boundary of the inclusion. In each iteration step, mixed boundary value problems for the Laplace operator are solved in the semi-infinite region. Well-posedness of these problems is investigated and convergence of the procedures is discussed. For the numerical implementation of these mixed problems an efficient boundary integral method is proposed which is based on the indirect variant of the boundary integral approach. Using this approach the mixed problems are reduced to integral equations over the (bounded) boundary of the inclusion. Numerical examples are included showing that stable and accurate reconstructions of the temperature field on the boundary of the inclusion can be obtained also in the case of noisy data. These results are compared with those obtained with the alternating iterative method.

Hitsatun rakenteen lujuustarkastelu kokeellisesti määritetyn kuormitushistorian perusteella

Työssä tutkittiin jätteen murskauksesta murskaimeen aiheutuvia kuormituksia vastusvenymäliuskamittauksilla. Eri jätetyyppien aiheuttamia kuormituksia tutkittiin erillisinä tapauksina ja näistä tyyppikuormituksista johdettiin rakenteen normaalia käyttöä vastaava kuormitushistoria käyttäen painokertoimia eri tyyppikuormien kesken. Murskaimen runkorakennetta tutkittiin FE-analyysillä käyttäen kuormituksena kenttämittauksilla saatua todellista kuormitusta. FE-menetelmällä tutkittiin väsymisen kannalta kriittisiä kohtia rakenteesta. Tulosten perusteella kriittisiin yksityiskohtiin laadittiin parannusehdotuksia, joiden perusteella yhteistyössä työn teettäjän kanssa laadittiin uudet rakenneratkaisut. Rakenteen kestoikä määritettiin väsymisvaurion kannalta kriittisimmän yksityiskohdan mukaan. Kestoiän määrittämiseen käytettiin Palmgren-Miner menetelmää ja Palmgren-Miner menetelmästä johdettua ekvivalentin jännitysvaihtelun menetelmää. Muutosten jälkeen rakenne täyttää sille asetetun suunnittelukestoiän käytettyjen menetelmien perusteella.