Alternating-Direction Line-Relaxation Methods on Multicomputers

We study the multicom.puter performance of a three-dimensional Navier–Stokes solver based on alternating-direction line-relaxation methods. We compare several multicomputer implementations, each of which combines a particular line-relaxation method and a particular distributed block-tridiagonal solver. In our experiments, the problem size was determined by resolution requirements of the application. As a result, the granularity of the computations of our study is finer than is customary in the performance analysis of concurrent block-tridiagonal solvers. Our best results were obtained with a modified half-Gauss–Seidel line-relaxation method implemented by means of a new iterative block-tridiagonal solver that is developed here. Most computations were performed on the Intel Touchstone Delta, but we also used the Intel Paragon XP/S, the Parsytec SC-256, and the Fujitsu S-600 for comparison

Parallel algorithms for the solution of elliptic and parabolic problems on transputer networks

This thesis is a study of the implementation of parallel algorithms for solving elliptic and parabolic partial differential equations on a network of transputers. The thesis commences with a general introduction to parallel processing. Here a discussion of the various ways of introducing parallelism in computer systems and the classification of parallel architectures is presented. In chapter 2, the transputer architecture and the associated language OCCAM are described. The transputer development system (TDS) is also described as well as a short account of other transputer programming languages. Also, a brief description of the methodologies for programming transputer networks is given. The chapter is concluded by a detailed description of the hardware used for the research. [Continues.

the arithmetic mean solver in lagged diffusivity method for nonlinear diffusion equations

Th is paper deals with the solution of nonlinear system arising fro m finite difference discretization of nonlinear diffusion convection equations by the lagged diffusivity functional iteration method co mbined with d ifferent inner iterative solvers. The analysis of the whole procedure with the splitt ing methods of the Arith met ic Mean (AM) and of the Alternating Group Exp licit (A GE) has been developed. A comparison in terms of number of iterations has been done with the BiCG-STA B algorith m. So me nu merical experiments have been carried out and they seem to show the effectiveness of the lagged diffusivity procedure with the Arithmet ic Mean method as inner solver

A nonlinearity lagging for the solution of nonlinear steady state reaction diffusion problems

This paper concerns with the analysis of the iterative procedure for the solution of a nonlinear reaction diffusion equation at the steady state in a two dimensional bounded domain supplemented by suitable boundary conditions. This procedure, called Lagged Diffusivity Functional Iteration (LDFI)-procedure, computes the solution by "lagging'' the diffusion term. A model problem is considered and a finite difference discretization for that model problem is described.Furthermore, properties of the finite difference operator are proved. Then, sufficient conditions for the convergence of the LDFI-procedure are given. At each stage of the LDFI-procedure a weakly nonlinearalgebraic system has to be solved and the simplified Newton-Arithmetic Mean method is used. This method is particularly well suited for implementation on parallel computers.Numerical studies show the efficiency, for different test functions, of the LDFI-procedure combined with the simplified Newton-Arithmetic Mean method. Better results are obtained when in the reaction diffusion equation also a convection term is present

Lewis Structures Technology, 1988. Volume 1: Structural Dynamics

The specific purpose of the symposium was to familiarize the engineering structures community with the depth and range of research performed by the Structures Division of the Lewis Research Center and its academic and industrial partners. Sessions covered vibration control, fracture mechanics, ceramic component reliability, parallel computing, nondestructive testing, dynamical systems, fatigue and damage, wind turbines, hot section technology, structural mechanics codes, computational methods for dynamics, structural optimization, and applications of structural dynamics

Parallel solution of power system linear equations

At the heart of many power system computations lies the solution of a large sparse set of linear equations. These equations arise from the modelling of the network and are the cause of a computational bottleneck in power system analysis applications. Efficient sequential techniques have been developed to solve these equations but the solution is still too slow for applications such as real-time dynamic simulation and on-line security analysis. Parallel computing techniques have been explored in the attempt to find faster solutions but the methods developed to date have not efficiently exploited the full power of parallel processing. This thesis considers the solution of the linear network equations encountered in power system computations. Based on the insight provided by the elimination tree, it is proposed that a novel matrix structure is adopted to allow the exploitation of parallelism which exists within the cutset of a typical parallel solution. Using this matrix structure it is possible to reduce the size of the sequential part of the problem and to increase the speed and efficiency of typical LU-based parallel solution. A method for transforming the admittance matrix into the required form is presented along with network partitioning and load balancing techniques. Sequential solution techniques are considered and existing parallel methods are surveyed to determine their strengths and weaknesses. Combining the benefits of existing solutions with the new matrix structure allows an improved LU-based parallel solution to be derived. A simulation of the improved LU solution is used to show the improvements in performance over a standard LU-based solution that result from the adoption of the new techniques. The results of a multiprocessor implementation of the method are presented and the new method is shown to have a better performance than existing methods for distributed memory multiprocessors

Parallel algorithm for large scale electronic structure calculations

SIGLEAvailable from British Library Document Supply Centre- DSC:DX84152 / BLDSC - British Library Document Supply CentreGBUnited Kingdo