Algebraic elimination of slide surface constraints in implicit structural analysis

被引:7
作者
Chow, E
Manteuffel, TA
Tong, C
Wallin, BK
机构
[1] Lawrence Livermore Natl Lab, Ctr Appl Sci Comp, Livermore, CA 94551 USA
[2] Univ Colorado, Dept Math Appl, Boulder, CO 80309 USA
[3] Lawrence Livermore Natl Lab, Div B, Livermore, CA 94551 USA
关键词
constraint equations; direct elimination; schur complement; sparsity; iterative methods; graph theory;
D O I
10.1002/nme.720
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Slide surface and contact boundary conditions can be implemented via Lagrange multipliers in the algebraic equations in implicit structural analysis. This indefinite set of equations is difficult to solve by iterative methods and is often too large to be solved by direct methods. When there are m constraints and there exists a set of in variables where each variable is only involved in a single constraint, we advocate a direct elimination technique which leaves a sparse, positive definite system to solve by iterative methods. We prove that the amount of 'fill-in' created by this process is independent of the size of the slide surfaces. In addition, the eigenvalues of the reduced matrix do not differ significantly from the eigenvalues of the unconstrained matrix. This method can be extended to the case where constrained surfaces intersect and leads to a graph theoretic approach for determining which variables can be eliminated efficiently for constraints with more general structure. Published in 2003 by John Wiley Sons, Ltd.
引用
收藏
页码:1129 / 1144
页数:16
相关论文
共 25 条
[1]   ALGORITHM FOR MULTIPOINT CONSTRAINTS IN FINITE-ELEMENT ANALYSIS [J].
ABEL, JF ;
SHEPHARD, MS .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1979, 14 (03) :464-467
[2]  
[Anonymous], 1958, STUD LINEAR NONLINEA
[3]  
BANK RE, 1990, NUMER MATH, V56, P645, DOI 10.1007/BF01405194
[4]  
Belytschko T, 2001, INT J NUMER METH ENG, V50, P993, DOI 10.1002/1097-0207(20010210)50:4<993::AID-NME164>3.0.CO
[5]  
2-M
[6]   LAGRANGE CONSTRAINTS FOR TRANSIENT FINITE-ELEMENT SURFACE-CONTACT [J].
CARPENTER, NJ ;
TAYLOR, RL ;
KATONA, MG .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1991, 32 (01) :103-128
[7]   A priori sparsity patterns for parallel sparse approximate inverse preconditioners [J].
Chow, E .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2000, 21 (05) :1804-1822
[8]   Parallel implementation and practical use of sparse approximate inverse preconditioners with a priori sparsity patterns [J].
Chow, E .
INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS, 2001, 15 (01) :56-74
[9]  
Cook R.D., 1989, CONCEPTS APPL FINITE, V3
[10]   SOLUTION ALGORITHM FOR LINEAR CONSTRAINT EQUATIONS IN FINITE-ELEMENT ANALYSIS [J].
CURISKIS, JI ;
VALLIAPPAN, S .
COMPUTERS & STRUCTURES, 1978, 8 (01) :117-124