The authors' experience in the treatment of grey video compression using fractals is summarized and compared with other research in the same field. Experience with parallel and distributed computing is also discus...
详细信息
The authors' experience in the treatment of grey video compression using fractals is summarized and compared with other research in the same field. Experience with parallel and distributed computing is also discussed.
This article discusses a splitting extrapolation method for solving second-order parabolic equations with curved boundaries by using domain decomposition and d-quadratic isoparametric finite elements. This method poss...
详细信息
This article discusses a splitting extrapolation method for solving second-order parabolic equations with curved boundaries by using domain decomposition and d-quadratic isoparametric finite elements. This method possesses superconvergence, a high order of accuracy and a high degree of parallelism. First, we prove the multi-variable asymptotic expansion of fully discrete d-quadratic isoparametric finite element errors. Based on the expansion, we generate splitting extrapolation formulas. These formulas generate a numerical solution on a globally fine grid with higher accuracy by solving only a set of smaller discrete subproblems on different coarser grids. Therefore, a large-scale multidimensional problem with a curved boundary is turned into a set of smaller discrete subproblems on a polyhedron. Because these subproblems are independent of each other and have similar scales, our algorithm possesses a high degree of parallelism. In addition, this method is effective for solving discontinuous problems if we regard the interfaces of the problems as the interfaces of the initial domain decomposition. Our numerical results also show that the algorithm is effective for solving nonlinear parabolic equations.
Based on overlapping domain decomposition, we give a parallel subspace correction algorithm for semi-linear parabolic problems. We consider the dependence of convergence rate of this algorithm on parameters of time-st...
详细信息
Based on overlapping domain decomposition, we give a parallel subspace correction algorithm for semi-linear parabolic problems. We consider the dependence of convergence rate of this algorithm on parameters of time-step and space-mesh. We give the error estimate, which tell us that the convergence of the approximate solution is independent of the iteration number at each time level. (C) 2006 Elsevier Inc. All rights reserved.
We present in this paper an integrated approach to compute quickly an incompressible Navier-Stokes (NS) flow in a section of a large blood vessel using medical imaging data. The goal is essentially to provide a first-...
详细信息
We present in this paper an integrated approach to compute quickly an incompressible Navier-Stokes (NS) flow in a section of a large blood vessel using medical imaging data. The goal is essentially to provide a first-order approximation of some main quantities of interest in cardiovascular disease: the shear stress and the pressure on the wall. The NS solver relies on the L-2 penalty approach pioneered by Caltagirone and co-workers and combines nicely with a level set method based on the Mumford-Shah energy model. Simulations on stenosis cases based on angiogram are run in parallel with MatlabMPI on a shared-memory machine. While MatlabMPI communications are based on the load and save functions of Matlab and have high latency indeed, we show that our Aitken-Schwarz domain decomposition algorithm provides a good parallel efficiency and scalability of the NS code. Copyright (C) 2006 John Wiley & Sons, Ltd.
The parallel algorithm for solving time-dependent Schrodinger equations devised by De Raedt and based on the Trotter formula is not only simple but also unconditionally stable, explicit, and local. We consider the num...
详细信息
The parallel algorithm for solving time-dependent Schrodinger equations devised by De Raedt and based on the Trotter formula is not only simple but also unconditionally stable, explicit, and local. We consider the numerical errors resulting from the finite-difference approximation of De Raedt's algorithm by comparing an exact solution of a free particle with the approximate solution calculated by using the Trotter formula, which depends on the size of the spatial-temporal lattice. (C) 2007 Elsevier B.V. All rights reserved.
A method, called the (I.) ABS-MPVT algorithm, for solving a system comprising linear equations and linear inequalities is presented. This method is characterized by solving the system of linear equations first via the...
详细信息
A method, called the (I.) ABS-MPVT algorithm, for solving a system comprising linear equations and linear inequalities is presented. This method is characterized by solving the system of linear equations first via the ABS algorithms and then solving an unconstrained minimization obtained by substituting the ABS general form of solutions into the system of linear inequalities. For the unconstrained minimization problem it can be solved by a (modified) parallel algorithm. The convergence of this method is also given. (C) 2007 Elsevier Ltd. All rights reserved.
We present a method for stochastic fiber tract mapping from diffusion tensor MRI (DT-MRI) implemented on graphics hardware. From the simulated fibers we compute a connectivity map that gives an indication of the proba...
详细信息
We present a method for stochastic fiber tract mapping from diffusion tensor MRI (DT-MRI) implemented on graphics hardware. From the simulated fibers we compute a connectivity map that gives an indication of the probability that two points in the dataset are connected by a neuronal fiber path. A Bayesian formulation of the fiber model is given and it is shown that the inversion method can be used to construct plausible connectivity. An implementation of this fiber model on the graphics processing unit (GPU) is presented. Since the fiber paths can be stochastically generated independently of one another, the algorithm is highly parallelizable. This allows us to exploit the data-parallel nature of the GPU fragment processors. We also present a framework for the connectivity computation on the GPU. Our implementation allows the user to interactively select regions of interest and observe the evolving connectivity results during computation. Results are presented from the stochastic generation of over 250,000 fiber steps per iteration at interactive frame rates on consumer-grade graphics hardware.
This paper presents a novel generalized particle model for the parallel optimization of the resource allocation and task assignment in complex environment of enterprise computing. The generalized particle model (GPM) ...
详细信息
This paper presents a novel generalized particle model for the parallel optimization of the resource allocation and task assignment in complex environment of enterprise computing. The generalized particle model (GPM) transforms the optimization process into the kinematics and dynamics of massive particles in a force-field. The GPM approach has many advantages in terms of the high-scale parallelism, multi-objective optimization, multi-type coordination, multi-degree personality, and the ability to handle complex factors. Simulations show the effectiveness and suitability of the proposed GPM approach to optimize the enterprise computing. (c) 2006 Elsevier B.V. All rights reserved.
A programmable turbo decoder is designed to support multiple third-generation wireless communication standards. We propose a hybrid architecture of hardware and software, which has small size, low power, and high perf...
详细信息
A programmable turbo decoder is designed to support multiple third-generation wireless communication standards. We propose a hybrid architecture of hardware and software, which has small size, low power, and high performance like. hardware implementations, as well as the flexibility and programmability of software. It mainly consists of a configurable hardware soft-input-soft-output (SISO) decoder and a 16-b single-instruction multiple-data processor, which is equipped with five processing elements and special instructions customized for interleaving in order to provide interleaved data at the speed of the hardware SISO. A fast and flexible software implementation of the block interleaving algorithm is also proposed. The interleaver generation is split into two parts, preprocessing and on-the-fly generation, to reduce the timing overhead of changing the interleaver structure. We present detailed descriptions of the interleaving implementation applied to the W-CDMA and cdma2000 standard turbo codes. The decoder occupies 8.90 mm(2) in a 0.25-mu m CMOS with five metal layers and exhibits the maximum decoding rate of 5.48 Mb/s.
We address here numerical simulation problems for modeling some phenomena arising in plasmas produced in experimental devices for Inertial Confinement Fusion. The model consists of a compressible fluid dynamics system...
详细信息
We address here numerical simulation problems for modeling some phenomena arising in plasmas produced in experimental devices for Inertial Confinement Fusion. The model consists of a compressible fluid dynamics system coupled with a paraxial equation for modeling the laser propagation. For the fluid dynamics system, a numerical method of Lagrange-Euler type is used. For the paraxial equation, a time implicit discretization is settled which preserves the laser energy balance;the method is based on a splitting of the propagation term and the diffraction terms according to the propagation spatial variable. We give some features on the 3D implementation of the method in the parallel platform HERA. Results showing the accuracy of the numerical scheme are presented and we give also numerical results related to cases corresponding to realistic simulations, with a mesh containing up to 500 millions of cells.
暂无评论