The FETI algorithms are a family of numerically scalable substructuring methods with Lagrange multipliers that have been designed for solving iteratively large-scale systems of equations arising from the ΓΏnite element discretization of structural engineering, solid mechanics, and structural dynamics
A hypoquadratic convergence method for Lagrange multipliers
β Scribed by T. Altman; P.F. Boulos
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 399 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A modified augmented Lagrange multiplier method for largeβscale nonlinear optimization problem is studied in this paper. The basic steps of the proposed algorithm comprise an outer iteration, in which the Lagrange multipliers and various penalty parameters are updated, and an inner iter
We propose a novel Lagrange-multiplier method for mesh tying in R 2 that passes a linear patch test for subdomains with non-coincident interfaces. This capability is required in contact problems and finite element analysis of complex bodies that were broken into simpler shapes to aid grid generation
We study a Lagrange multiplier based non-overlapping domain decomposition method for the nonlinear over-pressure equation. Using an additional unknown, the problem is restated as a linearly constrained minimization problem. The resulting Uzawa-type algorithm requires at each iteration the solution o