{"title":"具有非单调摩擦的双边接触问题的解析和数值方法","authors":"M. Barboteu, K. Bartosz, Piotr Kalita","doi":"10.2478/amcs-2013-0020","DOIUrl":null,"url":null,"abstract":"We consider a mathematical model which describes the contact between a linearly elastic body and an obstacle, the so-called foundation. The process is static and the contact is bilateral, i.e., there is no loss of contact. The friction is modeled with a nonmotonone law. The purpose of this work is to provide an error estimate for the Galerkin method as well as to present and compare two numerical methods for solving the resulting nonsmooth and nonconvex frictional contact problem. The first approach is based on the nonconvex proximal bundle method, whereas the second one deals with the approximation of a nonconvex problem by a sequence of nonsmooth convex programming problems. Some numerical experiments are realized to compare the two numerical approaches.","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"41","resultStr":"{\"title\":\"An analytical and numerical approach to a bilateral contact problem with nonmonotone friction\",\"authors\":\"M. Barboteu, K. Bartosz, Piotr Kalita\",\"doi\":\"10.2478/amcs-2013-0020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a mathematical model which describes the contact between a linearly elastic body and an obstacle, the so-called foundation. The process is static and the contact is bilateral, i.e., there is no loss of contact. The friction is modeled with a nonmotonone law. The purpose of this work is to provide an error estimate for the Galerkin method as well as to present and compare two numerical methods for solving the resulting nonsmooth and nonconvex frictional contact problem. The first approach is based on the nonconvex proximal bundle method, whereas the second one deals with the approximation of a nonconvex problem by a sequence of nonsmooth convex programming problems. Some numerical experiments are realized to compare the two numerical approaches.\",\"PeriodicalId\":253470,\"journal\":{\"name\":\"International Journal of Applied Mathematics and Computer Sciences\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"41\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Applied Mathematics and Computer Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/amcs-2013-0020\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Applied Mathematics and Computer Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/amcs-2013-0020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An analytical and numerical approach to a bilateral contact problem with nonmonotone friction
We consider a mathematical model which describes the contact between a linearly elastic body and an obstacle, the so-called foundation. The process is static and the contact is bilateral, i.e., there is no loss of contact. The friction is modeled with a nonmotonone law. The purpose of this work is to provide an error estimate for the Galerkin method as well as to present and compare two numerical methods for solving the resulting nonsmooth and nonconvex frictional contact problem. The first approach is based on the nonconvex proximal bundle method, whereas the second one deals with the approximation of a nonconvex problem by a sequence of nonsmooth convex programming problems. Some numerical experiments are realized to compare the two numerical approaches.