Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
PurposeThis article aims to present a direct solution to handle linear constraints in finite element (FE) analysis without penalties or the Lagrange multipliers introduced.Design/methodology/approachFirst, the system of linear equations corresponding to the linear constraints is solved for the leading variables in terms of the free variables and the constants. Then, the reduced system of equilibrium equations with respect to the free variables is derived from the finite-dimensional virtual work equation. Finally, the algorithm is designed.FindingsThe proposed procedure is promising in three typical cases: (1) to enforce displacement constraints in any direction; (2) to implement local refinements by allowing hanging nodes from element subdivision and (3) to treat non-matching grids of distinct parts of the problem domain. The procedure is general and suitable for 3D non-linear analyses.Research limitations/implicationsThe algorithm is fitted only to the Galerkin-based numerical methods.Originality/valueThe proposed procedure does not need Lagrange multipliers or penalties. The tangential stiffness matrix of the reduced system of equilibrium equations reserves positive definiteness and symmetry. Besides, many contemporary Galerkin-based numerical methods need to tackle the enforcement of the essential conditions, whose weak forms reduce to linear constraints. As a result, the proposed procedure is quite promising.
PurposeThis article aims to present a direct solution to handle linear constraints in finite element (FE) analysis without penalties or the Lagrange multipliers introduced.Design/methodology/approachFirst, the system of linear equations corresponding to the linear constraints is solved for the leading variables in terms of the free variables and the constants. Then, the reduced system of equilibrium equations with respect to the free variables is derived from the finite-dimensional virtual work equation. Finally, the algorithm is designed.FindingsThe proposed procedure is promising in three typical cases: (1) to enforce displacement constraints in any direction; (2) to implement local refinements by allowing hanging nodes from element subdivision and (3) to treat non-matching grids of distinct parts of the problem domain. The procedure is general and suitable for 3D non-linear analyses.Research limitations/implicationsThe algorithm is fitted only to the Galerkin-based numerical methods.Originality/valueThe proposed procedure does not need Lagrange multipliers or penalties. The tangential stiffness matrix of the reduced system of equilibrium equations reserves positive definiteness and symmetry. Besides, many contemporary Galerkin-based numerical methods need to tackle the enforcement of the essential conditions, whose weak forms reduce to linear constraints. As a result, the proposed procedure is quite promising.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.