Skip Navigation

The Quarterly Journal of Mechanics and Applied Mathematics 1981 34(4):415-429; doi:10.1093/qjmam/34.4.415
© 1981 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by PIPKIN, A. C.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

PLANE TRACTION PROBLEMS FOR INEXTENSIBLE NETWORKS

A. C. PIPKIN

( Division of Applied Mathematics, Brown University, Providence Rhode Island 02912, U.S.A. )

Finite, plane deformations of sheets or nets formed from two intersecting families of fibres are considered. The fibres are treated as inextensible and the network resists shearing. In dead-loading traction boundary-value problems, the vectors representing the directions of the fibres satisfy a pair of coupled integral equations, which are highly nonlinear. Solutions that can represent minimum-energy states are considered. Under conditions on the boundary loads designed to ensure that the deformed network is not folded, and with restriction to sufficiently large loads, it is proved that the integral equations have exactly one solution with no folds. The proof is based on an iterative energy-minimization procedure, which can be used to compute approximate solutions.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.