{"title":"解析三维边界元实现的平面三角形和四边形单元的潜在和线性弹性问题","authors":"N. Dumont, Tatiana Galvão Kurz","doi":"10.2495/BE420011","DOIUrl":null,"url":null,"abstract":"This paper introduces a formulation for 3D potential and linear elasticity problems that end up with the analytical handling of all regular, improper, quasi-singular, singular and hypersingular integrals of an implementation using linear triangle (T3) elements. The extension to flat Q4 and T6 elements is almost straightforward. Results at arbitrarily located internal points are also given analytically. The formulation is based on a generalized transformation to subtriangle coordinates that simplifies the problem’s description and enables the adequate interpretation of all relevant geometric features of a discretized boundary segment, so that it becomes possible to arrive at manageable analytical expressions of all integrals. The paper outlines the main concepts and computational features of the proposed formulation, based on an array with all pre-evaluated integrals required in an implementation. An example of 3D potential problems illustrates all particular cases and the most challenging topological configurations one might deal with in practical applications. The procedure may be easily implemented in a general boundary element code, as the usual numerical quadrature schemes for source points sufficiently far from the integration field remain applicable. There is a work in progress for the implementation of the procedure in the frame of a fast multipole algorithm.","PeriodicalId":429597,"journal":{"name":"Boundary Elements and other Mesh Reduction Methods XLII","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"ANALYTICAL 3D BOUNDARY ELEMENT IMPLEMENTATION OF FLAT TRIANGLE AND QUADRILATERAL ELEMENTS FOR POTENTIAL AND LINEAR ELASTICITY PROBLEMS\",\"authors\":\"N. Dumont, Tatiana Galvão Kurz\",\"doi\":\"10.2495/BE420011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a formulation for 3D potential and linear elasticity problems that end up with the analytical handling of all regular, improper, quasi-singular, singular and hypersingular integrals of an implementation using linear triangle (T3) elements. The extension to flat Q4 and T6 elements is almost straightforward. Results at arbitrarily located internal points are also given analytically. The formulation is based on a generalized transformation to subtriangle coordinates that simplifies the problem’s description and enables the adequate interpretation of all relevant geometric features of a discretized boundary segment, so that it becomes possible to arrive at manageable analytical expressions of all integrals. The paper outlines the main concepts and computational features of the proposed formulation, based on an array with all pre-evaluated integrals required in an implementation. An example of 3D potential problems illustrates all particular cases and the most challenging topological configurations one might deal with in practical applications. The procedure may be easily implemented in a general boundary element code, as the usual numerical quadrature schemes for source points sufficiently far from the integration field remain applicable. There is a work in progress for the implementation of the procedure in the frame of a fast multipole algorithm.\",\"PeriodicalId\":429597,\"journal\":{\"name\":\"Boundary Elements and other Mesh Reduction Methods XLII\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Boundary Elements and other Mesh Reduction Methods XLII\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2495/BE420011\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Boundary Elements and other Mesh Reduction Methods XLII","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2495/BE420011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ANALYTICAL 3D BOUNDARY ELEMENT IMPLEMENTATION OF FLAT TRIANGLE AND QUADRILATERAL ELEMENTS FOR POTENTIAL AND LINEAR ELASTICITY PROBLEMS
This paper introduces a formulation for 3D potential and linear elasticity problems that end up with the analytical handling of all regular, improper, quasi-singular, singular and hypersingular integrals of an implementation using linear triangle (T3) elements. The extension to flat Q4 and T6 elements is almost straightforward. Results at arbitrarily located internal points are also given analytically. The formulation is based on a generalized transformation to subtriangle coordinates that simplifies the problem’s description and enables the adequate interpretation of all relevant geometric features of a discretized boundary segment, so that it becomes possible to arrive at manageable analytical expressions of all integrals. The paper outlines the main concepts and computational features of the proposed formulation, based on an array with all pre-evaluated integrals required in an implementation. An example of 3D potential problems illustrates all particular cases and the most challenging topological configurations one might deal with in practical applications. The procedure may be easily implemented in a general boundary element code, as the usual numerical quadrature schemes for source points sufficiently far from the integration field remain applicable. There is a work in progress for the implementation of the procedure in the frame of a fast multipole algorithm.