This paper provides a general means, called the parametrized Lagrange multiplier method (PLM), for constructing new variational principles from any existing one. PLM is more powerful than the traditional Lagrange multiplier (TLM) in many aspects; it can explain many theoretical problems and do plent
Method of Lagrange multipliers for exploitation of the entropy principle
β Scribed by I-Shih Liu
- Publisher
- Springer
- Year
- 1972
- Tongue
- English
- Weight
- 734 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0003-9527
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
In this paper we consider a general class of variational and programming problems which consist in the minimization of a real functional on a locally convex topological space subject to equality and inequality constraints. LIUSTERNIK [8] and GOLDSTINE [5] seem to have been the first who proved an ab