Wyniki wyszukiwania - BazTech

1

Parallel solution of electrostatic and static magnetic field problems by domain decomposition metod

Marcsa D., Kuczmann M.

Przegląd Elektrotechniczny

|

2013

|

R. 89, nr 2b

49--52

EN

The paper presents a parallel approach for the efficient solution of a one-dimensional and a two-dimensional problem by parallel finite element method. These problems are case studies. The non-overlapping domain decomposition method has been used to cut the problem into subregions or also called sub-domains, and it reduces the large mass matrix into smaller parts. The independent sub-domains, and the assembling of these equation systems can be handled by the independent processors of a supercomputer, i.e. in a parallel way. The execution time and speedup of parallel finite element method have been compared to the serial one.

PL

W artykule opisano metodę efektywnego rozwiązywania problemów jedno- i dwuwymiarowych, poprzez równoległe analizy metodą elementów skończonych. Analizowany obiekt jest dzielony na podregiony co zmniejsza rozmiary jego macierzy i dzieli ją na mniejsze (poddziedziny). Te z kolei mogą być obliczane przez niezależne procesory superkomputera.

2

Mobile sensor routing for parameter estimation of distributed systems using the parallel tunneling method

Zięba T., Uciński D.

International Journal of Applied Mathematics and Computer Science

|

2008

|

Vol. 18, no 3

307-318

EN

The paper deals with the problem of optimal path planning for a sensor network with mutliple mobile nodes, whose measurements are supposed to be primarily used to estimate unknown parameters of a system modelled by a partial differential equation. The adopted framework permits to consider two- or three-dimensional spatial domains and correlated observations. Since the aim is to maximize the accuracy of the estimates, a general functional defined on the relevant Fisher information matrix is used as the design criterion. Central to the approach is the parameterization of the sensor trajectories based on cubic B-splines. The resulting finite-dimensional global optimization problem is then solved using a parallel version of the tunneling algorithm. A numerical example is included to clearly demonstrate the idea presented in the paper.

3

A transputer implementation of systolic arrays design for low-level medical image processing

Amin S., Saeed M.

Image Processing & Communications

|

2000

|

Vol. 6, no 3-4

35-45

EN

Many low-level image processing operations, termed local operators, require access to the four or eight neighbouring intensity values of a pixel, when computing the new value for the pixel and need large amounts of computing i.e., banded matrix operations. However, these algorithms contain explicit parallelism which can be efficiently exploited by processor arrays. The purpose of this paper is to identify a set of systolic array designs suitable for implementing low level image processing algorithms for medical images of tissues on VLSI processing arrays, in particular we consider the sigma, inverse gradient and mean filters. To achieve high performance we have developed several models of systolic arrays. One of the aims of this is to design and build a programming workbench for developing image processing operations for low-level vision. The motivation for the work is to develop a methodology for the implementation of an image processing library on the Transputer network, which holds a library of precoded software components in a generalised configuration-independent style for medical images. The digital image processing filter library is discussed in thispaper.