Parallel-block iterative scheme applied to computations in structural analysis

Technical Report · Tue Jul 01 04:00:00 EDT 1986

OSTI ID:5471441

Plemmons, R J

In this paper it is shown how a block cyclic successive overrelaxation direct-iterative method can be applied to the parallel solution of certain large-scale linear equality-constrained quadratic programming problems. The scheme is similar in nature to those studied recently by de Pillis, Niethammer and Varga and by Markham, Neumann and Plemmons for solving large sparse least squares problems, It is based upon a partitioning strategy of the fundamental matrix into a block consistently ordered 2-cyclic form where the nonzero and eigenvalues of the Jacobi matrix are all pure imaginary. The method is shown to be globally convergence and convergence rates are established. Applications of the algorithms are discussed for large-scale structural-analysis computations where it is shown how the algorithm can be adapted to the simultaneous computation of the system forces and the nodal displacements. Here, advantage can be taken of the special forms of the matrix involved. In particular, it is shown that much of the algorithm lends itself to efficient implementation of pipelined vector machines and on multiprocessors.

• Research Organization: North Carolina State Univ., Raleigh (USA)
• OSTI ID: 5471441
• Report Number(s): AD-A-186122/8/XAB
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
CONVERGENCE
EIGENVALUES
FUNCTIONS
ITERATIVE METHODS
MATHEMATICAL LOGIC
PARALLEL PROCESSING
PARTITION FUNCTIONS
PROGRAMMING
VECTOR PROCESSING