A method of finite element tearing and interconnecting and its parallel solution algorithm. (English) Zbl 0758.65075

A domain decomposition method for the parallel finite element solution of equilibrium equations is presented. The advantage of this method is that it requires less interprocessor communication than the classical method of substructuring on local memory multiprocessor systems.
Reviewer: M.Jung (Chemnitz)


65N55 Multigrid methods; domain decomposition for boundary value problems involving PDEs
74S05 Finite element methods applied to problems in solid mechanics
65Y05 Parallel numerical computation
65N30 Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs
74B05 Classical linear elasticity
Full Text: DOI


[1] Farhat, Int. j. numer. methods eng. 24 pp 1771– (1987)
[2] and , ’Solving finite element equations on concurrent computers’, in (ed.), Parallel Computations and Their Impact on Mechanics, ASME, New York, 1987, pp. 209-228.
[3] Ortiz, Comp. Methods Appl. Mech. Eng. 58 pp 151– (1986)
[4] ’A multigrid-like semi-iterative algorithm for the massively parallel solution of large scale finite elements systems’, Multigrid Methods: Proc. Fourth Copper Mountain Conf. on Multigrid Methods, SIAM, Copper Mountain, Colorado, 1989, pp. 171-180.
[5] ’Test on parallel machines of a domain decomposition method for a composite three dimensional structural analysis problem’, Proc. Int. Conf. on Supercomputing, Saint Malo, France, 1988, pp. 273-283.
[6] ’A parallel solver for the linear elasticity equations on a composite beam’, in et al (eds.), Proc. Second Int. Conf. on Domain Decomposition Methods, SIAM, Los Angeles, California, 1989.
[7] Kron, J. Appl. Phys. 24 pp 965– (1953)
[8] ’Finite element formulation by variational principles with relaxed continuity requirements’, in (ed.), The Mathematical Foundation of the Finite Element Method with Applications to Partial Differential Equations, Part II, Academic Press, London, 1972, pp. 671-687.
[9] and , ’Solving elliptic problems by domain decomposition methods with applications’, in (ed.), Elliptic Problem Solvers II, Academic Press, London, 1984. · Zbl 0575.65096
[10] ’Domain decomposition via Lagrange multipliers’, Report No. UCRL-98532, Lawrence Livermore National Laboratory, 1988.
[11] Practical Methods of Optimization, Vol. 2, Constrained Optimization, Wiley, New York, 1981, pp. 86-87.
[12] and , in and (eds.), Numerical Methods for Constrained Optimization, Academic Press, London, 1974, pp. 132-135.
[13] ’Acceleration of the outer conjugate gradient by reorthogonalization for a domain decomposition method for structural analysis problems’, Proc. Third Int. Conf. on Supercomputing, Crete, Greece, 1989, pp. 471-477.
[14] Bokhari, IEEE Trans. Comp. C-30 pp 207– (1981)
[15] Farhat, Comp. Struct. 32 pp 347– (1989)
[16] ’Which parallel finite element algorithm for which architecture and which problem’, in et al (eds.), Computational Structural Mechanics and Multidisciplinary Optimization, AD- Vol. 16, ASME, New York, pp. 35-43.
[17] Farhat, Comp. Struct. 28 pp 579– (1988)
[18] and , ’Benchmarking the iPSC/2’, Report TW 114, Katholieke Universiteit Leuven, Department of Computer Science, Belgium, 1988.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.