A PARALLEL ROW-ORIENTED SPARSE SOLUTION METHOD FOR FINITE-ELEMENT STRUCTURAL-ANALYSIS

被引：17

作者：

LAW, KH

MACKAY, DR

机构：

[1] Department of Civil Engineering, Stanford University, Stanford, California

来源：

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING | 1993年 / 36卷 / 17期

关键词：

D O I：

10.1002/nme.1620361704

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This paper describes a parallel implementation of LDL(T) factorization on a distributed-memory parallel computer. Specifically, the parallel LDL(T) factorization procedure is based on a row-oriented sparse storage scheme. In addition, a strategy is proposed for the parallel solution of a triangular system of equations. The strategy is to compute the inverses of the dense principal diagonal block submatrices of the factor L, stored in a row-oriented structure. Experimental results for a number of finite element models are presented to illustrate the effectiveness of the parallel solution schemes.

引用

页码：2895 / 2919

页数：25

共 14 条

[1]

ALVARADO FL, 1990, NASA9036 RES I ADV C

[2] GENERAL SPARSE ELIMINATION REQUIRES NO PERMANENT INTEGER STORAGE [J].

BANK, RE ;

SMITH, RK .

SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1987, 8 (04) :574-584

[3]

Duff I.S., 1986, DIRECT METHODS SPARS

[4] COMMUNICATION RESULTS FOR PARALLEL SPARSE CHOLESKY FACTORIZATION ON A HYPERCUBE [J].

GEORGE, A ;

LIU, JWH ;

NG, E .

PARALLEL COMPUTING, 1989, 10 (03) :287-298

[5]

GEORGE A, 1981, COMPUTER SOLUTION LA

[6]

GOLUB GH, 1989, MATRIX COMPUTATIONS

[7] PARALLEL ALGORITHMS FOR SPARSE LINEAR-SYSTEMS [J].

HEATH, MT ;

NG, E ;

PEYTON, BW .

SIAM REVIEW, 1991, 33 (03) :420-460

[8] A NODE-ADDITION MODEL FOR SYMBOLIC FACTORIZATION [J].

LAW, KH ;

FENVES, SJ .

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1986, 12 (01) :37-50

[9] A COMPACT ROW STORAGE SCHEME FOR CHOLESKY FACTORS USING ELIMINATION TREES [J].

LIU, JWH .

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1986, 12 (02) :127-148

[10]

LIU JWH, 1990, CS9004 YORK U DEP CO

← 1 2 →