A general algorithm for limit solutions of plane stress problems
dc.contributor.author | Hoon Huh, | en_US |
dc.contributor.author | Yang, Wei H. | en_US |
dc.date.accessioned | 2006-04-10T14:55:47Z | |
dc.date.available | 2006-04-10T14:55:47Z | |
dc.date.issued | 1991 | en_US |
dc.identifier.citation | Hoon Huh, , Yang, Wei H. (1991)."A general algorithm for limit solutions of plane stress problems." International Journal of Solids and Structures 28(6, Supplement 1): 727-738. <http://hdl.handle.net/2027.42/29642> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6VJS-482GPY3-N1/2/95b784a2039ae416aab8de4b5763b8cd | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/29642 | |
dc.description.abstract | A computational approach to limit solutions is considered most challenging for two major reasons. A limit solution is likely to be non-smooth such that certain non-differentiable functions are perfectly admissible and make physical and mathematical sense. Moreover, the possibility of non-unique solutions makes it difficult to analyze the convergence of an iterative algorithm or even to define a criterion of convergence. In this paper, we use two mathematical tools to resolve these difficulties. A duality theorem defines convergence from above and from below the exact solution. A combined smoothing and successive approximation applied to the upper bound formulation perturbs the original problem into a smooth one by a small parameter [var epsilon]. As [var epsilon] --> 0, the solution of the original problem is recovered. This general computational algorithm is robust such that from any initial trial solution, the first iteration falls into a convex hull that contains the exact solution(s) of the problem. Unlike an incremental method thut invariably renders the limit problem ill-conditioned, the algorithm is numerically stable. Limit analysis itself is a highly efficient concept which bypasses the tedium of the intermediate elastic-plastic deformation and seeks the most important information directly. With the said algorithm, we have produced many limit solutions of plane stress problems. Certain non-smooth characters of the limit solutions are shown in the examples presented. Two well-known as well as one parametric family of yield functions are used to allow comparison with some classical solutions. | en_US |
dc.format.extent | 928277 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | A general algorithm for limit solutions of plane stress problems | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mechanical Engineering | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mechanical Engineering and Applied Mechanics, The University of Michigan., Ann Arbor, MI 48109, U.S.A. | en_US |
dc.contributor.affiliationum | Department of Mechanical Engineering and Applied Mechanics, The University of Michigan., Ann Arbor, MI 48109, U.S.A. | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/29642/1/0000731.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0020-7683(91)90152-6 | en_US |
dc.identifier.source | International Journal of Solids and Structures | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.