The boundary element method with programming for engineers and scientists - phần 4 pot

142 The Boundary Element Method with Programming INTEGER FUNCTION Ngaus(RonL,ne,RLIM) ! ! Function returns number of Gauss points needed ! to integrate a function o(1/rne) ! according to Eberwien et al ! -REAL , INTENT(IN) :: RonL ! R/L INTEGER , INTENT(IN) :: ne ! order of Kernel (1,2,3) REAL, INTENT(OUT) :: Rlim(2) ! array to store values of table SELECT CASE(ne) CASE(1) Rlim= (/1.4025, 0.7926/) CASE(2) Rlim= (/4.1029, 1.6776/) CASE(3) Rlim= (/3.4170, 1.2908/) CASE DEFAULT END SELECT DO N=1,2 ! Determine minimum no of Gauss points needed IF(RonL >= Rlim(N)) THEN Ngaus= N+2 EXIT END IF END DO IF(Ngaus == 0) THEN ! Point is too close to the surface Ngaus=5 ! this value will trigger subdivision END IF RETURN END FUNCTION Ngaus 6.3.4 Numerical integration over one-dimensional elements In the integration of Kernel-shape function products care has to be taken because in some cases the function has a singularity or is discontinuous over the element depending on the location of Pi Therefore, we have to distinguish integration schemes for the case where Pi is one of the element nodes and where it is not The integrals which have to be evaluated over the isoparametric element, shown in Figure 6.8, are for potential problems e U ni Nn U Pi , J d , e Tni Nn T Pi , J d (6.33) 143 NUMERICAL IMPLEMENTATION where U(Pi, ) and T(Pi, ) are the fundamental solutions at Q( ) for a source at point Pi , J( ) is the Jacobian and Nn( ) are linear or quadratic shape functions When point Pi is not one of the element nodes, both integrals can be evaluated by Gauss Quadrature and the integrals in equation (6.33) can be replaced by two sums M e Tni Nn m T Pi , m J m Wm m M e U ni (6.34) Nn m U Pi , m J m Wm m where the number of integration points M is determined as a function of the proximity of Pi to the integration region as explained previously If Pi is close to the integration region a subdivision will be necessary R L Pi Figure 6.8 One dimensional element, integration where Pi is not one of the element nodes When Pi is one of the element nodes, functions U and T tend to infinity within the integration region Consider the two cases in Figure 6.9: (a) Pi is located at point and n in the equation (6.33) is 2: This means that although Kernels T and U tend to infinity as point is approached, the shape function tends to zero, so the integral of product Nn( )U(Pi ) and Nn( )T(Pi ) tend to a finite value Thus, for the case where Pi is not at node n of the element, the integral can be evaluated with the formulae (6.34) without any problems (b) Pi is located at point and n in the equation (6.33) is 2: In this case, Kernels T and U tend to infinity and the shape function to unity and products Nn( )U(Pi ) and Nn( )T(Pi ) also tend to infinity Since Kernel U has a singularity of order ln(1/r), the first product cannot be integrated using Gauss 144 The Boundary Element Method with Programming Quadrature The integral of the second product only exists as a Cauchy principal value However, these are the diagonal terms of the coefficient matrix that can be evaluated using equation (6.18), (6.19) or (6.27) T,U N2 N2 T,U Pi Pi 1 3 L (b) L (a) Figure 6.9 Integration when Pi is one of the element nodes For the integration of the product with ln(1/r), we can use a modified Gauss Quadrature called Gauss-Laguerre8 integration M f ( ) ln( )d Wm f ( m ) (6.35) m where M is the number of integration points The weights and coordinates are given by the Subroutine Gauss_Laguerre_coor, which at the is listed at the end of this section Note that for this integration scheme singular point and the limits are from to 1, so a change in coordinates has to be made before equation (6.35) can be applied This change in coordinate is given by (see Figure 6.10): 2 when Pi is at node when Pi is at node (6.36) For the case where we integrate over a quadratic element, the integrand is discontinuous if Pi is located at the midside node The integration has to be split into two regions, one over -1< 1) THEN Xsi2= Xsi1+2/NDIVS Gauss_points: & DO m=1,Mi xsi= Glcor(m) IF(NDIVS > 1) Xsi= 0.5*(Xsi1+Xsi2)+xsi/NDIVS CALL Serendip_func(Ni,xsi,eta,ldim,Nodel,Inci) Call Normal_Jac(Vnorm,Jac,xsi,eta,ldim,Nodel,Inci,elcor) CALL Cartesian(GCcor,Ni,ldim,elcor) ! Coords of Gauss pt r= Dist(GCcor,xP(:,i),cdim) ! Dist P,Q dxr= (GCcor-xP(:,i))/r ! rx/r , ry/r UP= U(r,k,cdim) ; TP= T(r,dxr,Vnorm,cdim) ! Kernels Node_points: & DO n=1,Nodel IF(Dist(Elcor(:,n),xP(:,i),cdim) < epsi) EXIT ! Pi is n dUe(i,n)= dUe(i,n) + Ni(n)*UP*Jac*Wi(m)*RJACB dTe(i,n)= dTe(i,n) + Ni(n)*TP*Jac*Wi(m)*RJACB END DO & Node_points END DO & Gauss_points END DO & Subregions END DO & Colloc_points ! -! Diagonal terms of dUe ! -c1= 1/(2.0*pi*k) Colloc_points1: & DO i=1,Ncol Node_points1: & DO n=1,Nodel IF(Dist(Elcor(:,n),xP(:,i),cdim) > Epsi) CYCLE ! Pi not n Nreg=1 IF(n == 3) nreg= ! ! Integration of logarithmic term ! -Subregions: & DO nr=1,Nreg Mi= Call Gauss_Laguerre_coor(Glcor,Wi,Mi) Gauss_points1: & DO m=1,Mi SELECT CASE (n) CASE (1) 149 150 The Boundary Element Method with Programming xsi= 2.0*Glcor(m)-1.0 dxdxb= 2.0 CASE (2) xsi= 1.0 -2.0*Glcor(m) dxdxb= 2.0 CASE (3) dxdxb= 1.0 IF(nr == 1) THEN xsi= -Glcor(m) ELSE xsi= Glcor(m) END IF CASE DEFAULT END SELECT CALL Serendip_func(Ni,xsi,eta,1,Nodel,Inci) Call Normal_Jac(Vnorm,Jac,xsi,eta,1,Nodel,Inci,elcor) dUe(i,n)= dUe(i,n) + Ni(n)*c1*Jac*dxdxb*Wi(m) END DO & Gauss_points1 END DO & Subregions ! -! Integration of non logarithmic term ! Mi= Call Gauss_coor(Glcor,Wi,Mi) ! Assign coords/Weights Gauss_points2: & DO m=1,Mi SELECT CASE (n) CASE (1:2) c2=-LOG(Eleng)*c1 CASE (3) c2=LOG(2/Eleng)*c1 CASE DEFAULT END SELECT xsi= Glcor(m) CALL Serendip_func(Ni,xsi,eta,ldim,Nodel,Inci) Call Normal_Jac(Vnorm,Jac,xsi,eta,ldim,nodel,Inci,elcor) dUe(i,n)= dUe(i,n) + Ni(n)*c2*Jac*Wi(m) END DO & Gauss_points2 END DO & Node_points1 END DO & Colloc_points1 RETURN END SUBROUTINE Integ2P The above integration scheme is equally applicable to elasticity problems, except that when integrating functions with Kernel U when Pi is one of the nodes of the element we 151 NUMERICAL IMPLEMENTATION have to consider that only Uxx and Uyy have a logarithmic and non-logarithmic part The logarithmic part is integrated with Gauss-Laguerre, for example: Nn (1 )(3 ) ln E Pi , Nn (1 )(3 ) J E Wm e U xxni M m m m J d d d d d (6.44) The non-logarithmic part is integrated using Gauss Quadrature Zero coefficient arrays [ U] and [ T] Colloc_Points: DO i=1,Number of points Pi Determine distance of Pi to Element, R/L and No of Gauss points Gauss_Points: DO m=1,Number of Gauss points Determine r,dsxr,Jacobian etc for kernel computation Node_Points: DO n=1,Number of Element Nodes Direction_P: DO j=1,2 (direction of force at P) Direction_Q: DO k=1,2 (direction of U,T at Q) Sum coefficients [ U] and [ T] Figure 6.12 Structure chart for SUBROUTINE Integ2E A SUBROUTINE for integrating over one-dimensional elements for elasticity is written The main differences to the previous subroutine are that the Kernels U and T are 177 ASSEMBLY AND SOLUTION Note that the sequence of nodes for all mirrored elements is reversed This is important because it affects the direction of the outward normal vector n The coordinates of nodes at the left of the symmetry plane can be computed from those on the right by: Node 21 31 41 x -x2 -x3 -x4 y y2 y3 y4 Substantial savings in computational effort can be made, if during assembly we consider that the unknowns on the left hand side of the symmetry plane can be determined from the ones on the right For potential problems we simply have u21= u2 , u31= u3 and u41= u4 y 1 2 1 2 2 2 3 2 x 3 Figure 7.6 Example with two planes of symmetry For elasticity problems we have (see displaced shape in Figure 7.5 (a)) Node 21 31 41 ux - ux2 - ux3 - ux4 uy uy2 uy3 uy4 178 The Boundary Element Method with Programming For assembly of the system of equations this means that the coefficients of the mirrored nodes are assembled in the same location as for the un-primed nodes For elasticity problems, the negative signs of the x-component of the displacement have to be considered during assembly If this assembly procedure is used, then the number of unknowns for the problem is reduced to the nodes on the right hand side of the symmetry plane and on the plane itself The only additional computational effort will be the integration of the Kernel shape function products over the mirrored elements If conditions of symmetry exist about the x and y axis, then the elements are “mirrored” twice, as shown in Figure 7.6 The incidence vectors are now Element 11 21 i 21 j 21 11 Element 12 22 13 23 i 22 12 31 23 j 32 22 23 Note that for all elements, except 12 and 22, the incidences are reversed The coordinates of the “mirrored” nodes are Node x y 1 -x1 y1 x3 -y3 -x2 y2 22 -x2 -y2 x2 -y2 For potential problems we have u21= u22= u23= u2 , u11= u1 and u31= u3 For elasticity problems the displacements at the primed nodes are given by Node ux uy 1 - ux1 -uy3 - ux2 uy2 2 - ux2 -uy2 ux2 -uy2 179 ASSEMBLY AND SOLUTION z n 1 1 3 y 3 x 5 1 3 n Figure 7.7 Three-dimensional BE mesh with planes of symmetry The method can be extended to three-dimensional problems Up to three planes of symmetry are possible and an element has to be projected seven times For the mesh in Figure 7.7, we determine the incidences for the mirrored elements keeping a consistent outward normal, as shown (anti-clockwise numbering of element 1) Element 11 12 13 14 15 16 17 i 1 1 11 11 11 11 j 21 41 43 22 42 23 k 31 32 33 37 34 35 36 l 21 41 23 43 22 42 180 The Boundary Element Method with Programming We note that for mirror image number n= 1,3,4 and 6, the incidences have to be reversed to maintain a consistent outward normal, as shown We now discuss the computer implementation of up to symmetry planes We specify a symmetry code Symmetry code Symmetry about m y-z plane y-z and x-z plane All planes No of mirrored elements For the mirrored nodes we can compute coordinates x, displacements u and tractions t from the original nodes by x n n T x ; u n n T u ; t n n (7.15) T t where superscript n denotes the mirror image number, as used in Figures 7.5 to 7.7 Transformation matrices T are computed as follows First we define three matrices Tm ; T2 T1 0 0 0 0 ; T3 0 0 0 (7.16) In terms of these, the transformation matrices are defined as T T T1 T3 ; T ; T T2 T1T3 ; T ; T T1T2 ; T2 T3 ; T (7.17) T1T2 T3 For implementation we provide an additional loop for each element which, depending on the symmetry code, is executed 1,2,4 or times For no symmetry (code 0) we consider only the original element For code (symmetry about y-z plane) we consider one mirrored image of the element For symmetry codes and 3, three and seven mirrored images of the element are considered 7.2.2 Subroutine MIRROR Subroutine MIRROR has been written to generate elements across symmetry planes It returns the incidence, destination and coordinate vector of the mirrored element, as well as multiplication factors for the assembly In the subroutine we assume that if points are on the symmetry plane, then they have exactly zero coordinate and one must ensure that 181 ASSEMBLY AND SOLUTION this is actually the case We note that for subroutines INTEG to work for the mirrored elements, we must change the mirrored node numbers to some arbitrary value Here we have chosen to add the maximum node number to the incidences Note that some numbers of the original node must not be changed if they lie on a specified symmetry plane Table 7.3 gives an overview of the node number that must not be changed if it lies on a specified symmetry plane Table 7.3 List of node numbers that should not be changed during “mirroring” Node is on x-z plane y-z plane x-y plane planes Mirror image (n) which must not be changed to Destination vectors of the mirrored elements used for the assembly remain the same as for the original element, except that if incidences are reversed to maintain a consistent outward normal, then the destination vector must also be reversed Subroutine Reverse is used and it has been put in the Utility Library Note that in the implementation of the transformation matrices (equation 7.17), only the diagonal terms are considered SUBROUTINE Mirror(Isym,nsy,Nodes,Elcor,Fac,Incie,Ldeste & Elres_te,Elres_ue,,Nodel,Ndof,Cdim) ! -! Creates mirror image of an element ! -INTEGER, INTENT(IN) :: Isym ! symmetry indicator INTEGER, INTENT(IN) :: nsy ! symmetry count INTEGER, INTENT(IN) :: nodes ! highest node no REAL, INTENT(IN OUT):: Elcor(:,:) ! Coords (will be modified) REAL, INTENT(OUT) :: Fac(:) ! Multiplication factors INTEGER, INTENT(IN OUT):: Incie(:)! Incidences (will be INTEGER, INTENT(IN OUT):: Ldeste(:)! Destinations modified) REAL, INTENT(IN OUT) :: Elres_te(:) ! Element tractions REAL, INTENT(IN OUT) :: Elres_ue(:) ! Element displacements INTEGER, INTENT(IN) :: Nodel ! Nodes per element INTEGER, INTENT(IN) :: Ndof ! d.o.F per Node INTEGER, INTENT(IN) :: Cdim ! Cartesian dimension REAL :: TD(3) ! Transformation vector (diagonal elements of T) INTEGER :: n,m,Ison1,Ison2,Ison3,i Fac(1:nodel*ndof)= 1.0 IF(nsy == 1) RETURN SELECT CASE (nsy-1) CASE(1) TD=(/-1.0,1.0,1.0/) CASE(2) TD=(/-1.0,-1.0,1.0/) 182 The Boundary Element Method with Programming CASE(3) TD=(/1.0,-1.0,1.0/) CASE(4) TD=(/1.0,1.0,-1.0/) CASE(5) TD=(/-1.0,1.0,-1.0/) CASE(6) TD=(/1.0,-1.0,-1.0/) CASE(7) TD=(/-1.0,-1.0,-1.0/) END SELECT ! generate coordinates and incidences Nodes0: & DO n=1,nodel Elcor(:,n)= Elcor(:,n)*TD(m) ! Check if point is on any symmetry plane Ison1= ; Ison2= ; Ison3= IF(Elcor(1,n)==0.0) Ison1=1 IF(Elcor(2,n)==0.0) Ison2=1 IF(Cdim > AND Elcor(3,n)==0.0) Ison3=1 ! only change incidences for unprimed nodes IF(ison1==1 AND nsy-1 ==1) CYCLE IF(ison2==1 AND nsy-1 ==3) CYCLE IF(ison1+ison2+ison3 > AND nsy-1 1) THEN I=0 Nodes1: & DO n=1,nodel Degrees_of_freedom: & DO m=1,Ndof I=I+1 Fac(I)= TD(m) END DO & Degrees_of_freedom END DO & Nodes1 END IF ! Reverse destination vector for selected elements SELECT CASE (nsy-1) CASE (1,3,4,6) CALL & Reverse(Incie,elcor,ldeste,Elres_te,Elres_ue,Ndof,Cdim,nodel) CASE DEFAULT END SELECT RETURN END SUBROUTINE Mirror ASSEMBLY AND SOLUTION 183 7.2.3 Subroutine Assembly A sub-program for assembling the coefficient matrices using a vector of incidences or destinations, as well as information about the type of boundary and symmetry condition, is presented The information about the boundary condition is supplied for each node or each degree of freedom of an element and the code is for Neuman and for the Dirichlet condition Care has to be taken where the boundary condition is discontinuous For example, in Figure 7.3, both temperature and flow values are known at the first node of element 1, but only temperature is known at the second node of element (both nodes equal in global numbering) For the assembly we must therefore specify a global code, in addition to a boundary code for each element Then, if Neuman BC is specified and the global code is Dirichlet, both T and U are assembled on the right hand side In the parameter list vectors, Elres_u and Elres_t are introduced These will eventually contain all results of an element At the stage when the SUBROUTINE is called, however, they contain only known (prescribed) values with all other values being zero SUBROUTINE Assembly can be used for the assembly of two or three-dimensional problems in potential flow or elasticity The incidence vector in potential flow problems and the destination vector in elasticity problems is defined as LDEST SUBROUTINE Assembly(Lhs,Rhs,DTe,DUe,Ldest,BCode,Ncode & ,Elres_ue,Elres_te,Diag,Ndofe,Ndof,Nodel,Fac) ! ! Assembles Element contributions DTe , DUe ! into global matrix Lhs and vector Rhs ! Also sums off-diagonal coefficients ! for the computation of diagonal coefficients ! REAL(KIND=8) :: Lhs(:,:),Rhs(:) ! Global arrays REAL(KIND=8), INTENT(IN):: DTe(:,:),DUe(:,:) ! Element arrays INTEGER , INTENT(IN) :: LDest(:) ! Element destination vector INTEGER , INTENT(IN) :: BCode(:) ! Boundary code(local) INTEGER , INTENT(IN) :: NCode(:) ! Boundary code (global) INTEGER , INTENT(IN) :: Ndofe ! D.o.F´s / Elem INTEGER , INTENT(IN) :: Ndof ! D.o.F´s / Node INTEGER , INTENT(IN) :: Nodel ! Nodes/Element REAL , INTENT(IN) :: Elres_ue(:) ! vector u for element REAL , INTENT(IN) :: Elres_te(:) ! vector t for element REAL , INTENT(IN) :: Fac(:) ! Mult factor for symmetry REAL(KIND=8) :: Diag(:,:) ! Array containing diagonal coeff of DT INTEGER :: n,Ncol DoF_per_Element:& DO m=1,Ndofe Ncol=Ldest(m) ! Column number IF(BCode(m) == 0) THEN ! Neumann BC Rhs(:) = Rhs(:) + DUe(:,m)*Elres_te(m)*Fac(m) ! The assembly of dTe depends on the global BC IF (NCode(Ldest(m)) == 0) THEN Lhs(:,Ncol)= Lhs(:,Ncol) + DTe(:,m)*Fac(m) 184 The Boundary Element Method with Programming END IF IF (NCode(Ldest(m)) == 1) THEN Rhs(:) = Rhs(:) - DTe(:,m) * Elres_ue(m)*Fac(m) END IF END IF IF(BCode(m) == 1) THEN ! Dirichlet BC Lhs(:,Ncol) = Lhs(:,Ncol) - DUe(:,m)*Fac(m) Rhs(:)= Rhs(:) - DTe(:,m) * Elres_ue(m)*Fac(m) END IF END DO & DoF_per_Element ! Sum of off-diagonal coefficients DO n=1,Nodel DO k=1,Ndof l=(n-1)*Ndof+k Diag(:,k)= Diag(:,k) - DTe(:,l)*Fac(m) END DO END DO RETURN END SUBROUTINE Assembly Element contributions to the coefficient matrix, which have been computed numerically with SUBROUTINE Integ, have zero values for coefficients Teni when g(n) is point I, because these coefficients are not computed using numerical integration In the assembled matrix [ T], these coefficients correspond to diagonal elements Equation (6.17) or (6.18) can be applied to compute these coefficients For example, the assembled diagonal coefficient Tii is given by E N e Tni Tii e A (7.18) n g( n ) i where A is the azimuthal integral (see section 6.3.2) The double sum is computed by SUBROUTINE Assembly and stored in an array Diag for later use 7.3 SOLUTION OF SYSTEM OF EQUATIONS After assembly and adding the azimuthal integral as required, a system of simultaneous equations is obtained The difference to the system of equations obtained for the FEM is that it is not symmetric and fully populated The non-symmetry of the coefficient matrix had engineers, who were used to symmetric stiffness matrices, baffled for a while The question was why, since we have used the theorem by Betti, which Maxwell used to prove reciprocity and therefore the symmetry of the stiffness matrix, are we not getting a symmetric coefficient matrix? The answer lies in the fact that we are not solving the integral equations exactly but by numerical approximation Instead of enforcing the Betti theorem at an infinite number of points, as we should, we select a limited number of 185 ASSEMBLY AND SOLUTION points which are nodal points of the mesh It can be shown that as the fineness of the mesh increases, the coefficient matrices become more and more symmetric Indeed, in the limit with an infinite number of elements, full symmetry should be attained Another fact that has been discovered is that if boundary elements with linear functions are used, then the non-symmetry is much less pronounced than if elements with quadratic variation are used The reason for this is not quite clear The fact that coefficient matrices are fully populated makes things easier in the sense that we not need to worry about sparse solvers at this stage We will see later that when we introduce multiple regions, for example, to cater for non-homogenities or to model cracks or faults, we will also introduce sparseness The lack of sparseness of course means that no savings can be made by using special schemes, such as band or skyline storage The number of degrees of freedom, however, should be considerably smaller, especially for soil or rock mechanics problems where the domain can be assumed to extend to infinity 7.3.1 Gauss elimination The Gauss elimination method is probably the oldest and most used for solving the system of equations Consider the following system of equations Au (7.19) F The solution for unknowns u involve two steps STEP 1: Reduction Here we introduce zeroes below the diagonal elements, so that we end up with an upper triangular coefficient matrix For example, consider the n-th and i-th equation of a system a nn u n a nju j Fn a in u n a iju j Fi (7.20) To introduce a zero in the n-th column of the i-th equation, we subtract (ain/ ann) times the equation n from equation i : a nn u n a nju j Fn a* u j ij F* i (7.21) where a* ij a ij a in a nj a nn Fi* Fi a in Fn a nn (7.22) 186 The Boundary Element Method with Programming The procedure, which is sometimes referred to as elimination of variable n, can be visualised as a repeated modification of the coefficients a to a* , sometimes referred to as starring operation We continue doing the procedure for all the equations until all the coefficients of A below the diagonal are zero STEP 2: Backsubstitution The results may now be obtained by computing the unknown from the last equation, which involves one unknown only The formula for computing the n-th unknown is given by N un a ni u i Fn (7.23) a nn i n The above procedure is easily converted to a subroutine Subroutine SOLVE shown here assumes that coefficient matrix Lhs can be stored in memory SUBROUTINE Solve(Lhs,Rhs,u) ! ! Solution of system of equations ! by Gauss Elimination ! REAL(KIND=8) :: Lhs(:,:) ! Equation Left hand side REAL(KIND=8) :: Rhs(:) ! Equation right hand side REAL(KIND=8) :: u(:) ! Unknown INTEGER M ! Size of system REAL(KIND=8) :: FAC M= UBOUND(Rhs,1) ! Reduction Equation_n: & DO n=1,M-1 IF(Lhs(n,n) < 1.0E-10 AND Lhs(n,n) > -1.0E-10) THEN CALL Error_Message('Singular Matrix') END IF Equation_i: & DO I= n + 1,M FAC= Lhs(i,n)/Lhs(n,n) Lhs(i, n+1 : M)= Lhs(i, n+1 : M) - Lhs(n, n+1 : M)*FAC Rhs(i)= Rhs(i) - Rhs(n)*FAC END DO & Equation_i END DO & Equation_n ! Backsubstitution Unknown_n: & DO n= M,1,-1 u(n)= -1.0/Lhs(n,n)*(SUM(Lhs(n,n + 1:M)*u(n + 1:M)) - Rhs(n)) END DO Unknown_n RETURN ; END SUBROUTINE Solve ASSEMBLY AND SOLUTION 187 As already mentioned previously for the solution of equations involving many subtractions, it is necessary to use REAL (KIND=8) for the arrays, to avoid an accumulation of round-off error For a 3-D elasticity problem involving 1000 nodes, the space required for storing the coefficient matrix in REAL (KIND=8) is 72 Mbytes For the solution on small computers this space may not be available and special algorithms must be devised, where part of the matrix is written onto disk Methods for the partitioned solution of large systems are presented, for example by Beer and Watson2 For the reduction of the system of equations we need three implied DO-loops In the implementation the innermost DO-loop is written implicitly using the new feature available in FORTRAN 90 The innermost DO-loop involves one multiplication and one subtraction and is executed (M – n) times, where M is the number of unknowns The DO loop above it involves a division and is also executed (M – n) times Finally the outermost DO-loop is executed M – times It can be shown, therefore, that the total number of operations required is 2/3M3 + ½M2 + 1/6M For large systems the first term is dominant This means that, for example, for a problem in three-dimensional elasticity involving 1000 nodes, approx 2x1010 operations are necessary for the reduction If we want to analyse these problems in a reasonable time there is clearly a need for more efficient solvers Recently there has been a resurgence of iterative solvers1 The advantage of these solvers is that the number of operations and hence the solution time is only proportional to M2 and that they can be adapted easily to run on parallel computers This will be discussed in the next chapter 7.3.2 Scaling When we look at the fundamental solutions for elasticity we note that kernel U contains the modulus of elasticity whereas T does not Depending on the chosen units used we expect a large difference in values As we have seen at the beginning of this chapter, if there is a mixed boundary value problem then there is a mixture of U and T terms in the assembled coefficient matrix This may cause problems in the solution of equations, since very small terms would be subtracted from very large ones Additionally, we note that for 2-D problems kernel U varies with ln(1/r) which gives value as r For the above reasons scaling of the data is recommended Scaling is applied in such a way that all tractions are divided by E and all coordinates by the largest difference between coordinates (which results in a scaled problem size of unity) 7.4 PROGRAM 7.1: GENERAL PURPOSE PROGRAM, DIRECT METHOD, ONE REGION We now have developed all necessary tools for writing a general purpose computer program for computing two and three-dimensional problems in potential flow and elasticity The first part of the program reads input data There are three types of data: 188 The Boundary Element Method with Programming job specification, geometry and boundary data They are read in by calling three separate subroutines Jobin, Geomin and BCinput The job information consists of the Cartesian dimension of the problem (2-D or 3-D), type of region (finite or infinite), whether it is a potential or elasticity problem, type of elements used (linear or quadratic), properties, that is conductivity for potential problems and modulus of elasticity and Poisson's ratio for elasticity problems and number of elements/nodes The geometrical information consists of the coordinates of nodes and element incidences Finally the boundary conditions are input In the program we assume that all nodes have Neuman boundary condition with zero prescribed value by default All nodes with Dirichlet boundary conditions and all nodes having Neumann BC, with non-zero prescribed values have to be input After the specification of the BC´s element, destination vectors can be set up by a call to Subroutine Destination contained in the utility library As explained previously destinations are the addresses of the coefficients in the global arrays Note that for symmetry it is of advantage to exclude those degrees of freedom which have zero value and a node destination vector (Ndest) has been included to consider this As explained previously a global boundary code vector is needed to cater for the case where the boundary code is discontinuous at a node Scaling, as described above, is applied by a call to SUBROUTINE Scal The assembly is made by calling SUBROUTINE Assemb Since the diagonal coefficients are not computed using numerical integration but are determined using the 'rigid body mode' method, all off-diagonal coefficients are summed and, if the region is infinite, the azimuthal integral is added Diagonal coefficients are stored in a vector Diag and the boundary condition codes will determine if these are assembled into the left or right hand side The system of equations is solved next Using the element destination vector, results Elres_u and Elres_t are gathered from global vector u1 As will seen later, it is convenient for postprocessing to store results element by element PROGRAM General_purpose_BEM ! -! General purpose BEM program ! for solving elasticity and potential problems ! -USE Utility_lib ; USE Elast_lib ; USE Laplace_lib USE Integration_lib IMPLICIT NONE INTEGER, ALLOCATABLE :: Inci(:,:) ! Element Incidences INTEGER, ALLOCATABLE :: BCode(:,:), NCode(:) ! Element BC´s INTEGER, ALLOCATABLE :: Ldest(:,:) ! Element dest vector INTEGER, ALLOCATABLE :: Ndest(:,:) ! Node destination vector REAL, ALLOCATABLE :: Elres_u(:,:) ! Results , u REAL, ALLOCATABLE :: Elres_t(:,:) ! Results , t REAL, ALLOCATABLE :: Elcor(:,:) ! Element coordinates REAL, ALLOCATABLE :: xP(:,:) ! Node co-ordinates REAL(KIND=8), ALLOCATABLE :: dUe(:,:),dTe(:,:),Diag(:,:) REAL(KIND=8), ALLOCATABLE :: Lhs(:,:),F(:) REAL(KIND=8), ALLOCATABLE :: u1(:) ! global vector of unknown CHARACTER (LEN=80) :: Title INTEGER :: Cdim,Node,m,n,Istat,Nodel,Nel,Ndof,Toa ASSEMBLY AND SOLUTION INTEGER :: Nreg,Ltyp,Nodes,Maxe,Ndofe,Ndofs,ndg,NE_u,NE_t INTEGER :: nod,nd,i,j,k,l,DoF,Pos,Isym,nsym,nsy REAL,ALLOCATABLE :: Fac(:) ! Factors for symmetry REAL,ALLOCATABLE :: Elres_te(:),Elres_ue(:) INTEGER,ALLOCATABLE :: Incie(:) ! Incidences element INTEGER,ALLOCATABLE :: Ldeste(:) ! Destination vector REAL :: Con,E,ny,Scat,Scad ! ! Read job information ! OPEN (UNIT=1,FILE='INPUT',FORM='FORMATTED') ! Input OPEN (UNIT=2,FILE='OUTPUT',FORM='FORMATTED')! Output Call Jobin(Title,Cdim,Ndof,Toa,Nreg,Ltyp,Con,E,ny,& Isym,nodel,nodes,maxe) Nsym= 2**Isym ! number of symmetry loops ALLOCATE(xP(Cdim,Nodes)) ! Array for node coordinates ALLOCATE(Inci(Maxe,Nodel)) ! Array for incidences CALL Geomin(Nodes,Maxe,xp,Inci,Nodel,Cdim) Ndofe= Nodel*Ndof ! Total degrees of freedom of element ALLOCATE(BCode(Maxe,Ndofe)) ! Element Boundary codes ALLOCATE(Elres_u(Maxe,Ndofe),Elres_t(Maxe,Ndofe)) CALL BCinput(Elres_u,Elres_t,Bcode,nodel,ndofe,ndof) ALLOCATE(Ldest(maxe,Ndofe)) ! Elem destination vector ALLOCATE(Ndest(Nodes,Ndof)) ! ! Determine Node and Element destination vectors ! CALL Destination(Isym,Ndest,Ldest,xP,& Inci,Ndofs,nodes,Ndof,Nodel,Maxe) ! -! Determine global Boundary code vector ! ALLOCATE(NCode(Ndofs)) DoF_o_System: & DO nd=1,Ndofs DO Nel=1,Maxe DO m=1,Ndofe IF (nd == Ldest(Nel,m) and NCode(nd) == 0) THEN NCode(nd)= NCode(nd)+BCode(Nel,m) END IF END DO END DO END DO & DoF_o_System CALL Scal(E,xP(:,:),Elres_u(:,:),Elres_t(:,:),Cdim,Scad,Scat) ALLOCATE(dTe(Ndofs,Ndofe),dUe(Ndofs,Ndofe)) ! Elem coef ALLOCATE(Diag(Ndofs,Ndof)) ! Diagonal coefficients ALLOCATE(Lhs(Ndofs,Ndofs),F(Ndofs),u1(Ndofs)) ! global arrays ALLOCATE(Elcor(Cdim,Nodel)) ! Elem Coordinates ALLOCATE(Fac(Ndofe)) ! Factor symmetry ALLOCATE(Incie(Nodel)) ! Element incidences 189 190 The Boundary Element Method with Programming ALLOCATE(Ldeste(Ndofe)) ! Element destination ALLOCATE(Elres_te(Ndofe),Elres_ue(Ndofe)) ! -! Compute element coefficient matrices ! -Lhs(:,:) = 0.0; F(:) = 0.0; u1(:) = 0.0 Elements_1:& DO Nel=1,Maxe Symmetry_loop:& DO nsy= 1,Nsym Elcor(:,:)= xP(:,Inci(Nel,:)) ! gather element coordinates Incie= Inci(nel,:) ! incidences Ldeste= Ldest(nel,:) ! and destinations Fac(1:nodel*ndof)= 1.0 Elres_te(:)=Elres_t(Nel,:) IF(Isym > 0) THEN CALL Mirror(Isym,nsy,Nodes,Elcor,Fac,& Incie,Ldeste,Elres_te,Elres_ue & ,nodel,ndof,Cdim) END IF IF(Cdim == 2) THEN IF(Ndof == 1) THEN CALL Integ2P(Elcor,Incie,Nodel,Nodes& ,xP,Con,dUe,dTe,Ndest,Isym) ELSE CALL Integ2E(Elcor,Incie,Nodel,Nodes& ,xP,E,ny,dUe,dTe,Ndest,Isym) END IF ELSE CALL Integ3(Elcor,Incie,Nodel,Nodes,xP,Ndof & ,E,ny,Con,dUe,dTe,Ndest,Isym) END IF CALL Assembly(Lhs,F,DTe,DUe,Ldeste,BCode(Nel,:),Ncode & ,Elres_u(Nel,:),Elres_te,Diag& ,Ndofe,Ndof,Nodel,Fac) END DO & Symmetry_loop END DO & Elements_1 ! -! Add azimuthal integral for infinite regions ! -IF(Nreg == 2) THEN DO m=1, Nodes DO n=1, Ndof IF(Ndest(m,n) == 0)CYCLE k=Ndest(m,n) Diag(k,n) = Diag(k,n) + 1.0 END DO END DO END IF ASSEMBLY AND SOLUTION ! ! Add Diagonal coefficients ! Collocation_points: & DO m=1,Ndofs Nod=0 DO n=1, Nodes DO l=1,Ndof IF (m == Ndest(n,l))THEN Nod=n EXIT END IF END DO IF (Nod /= 0)EXIT END DO DO k=1,Ndof DoF=Ndest(Nod,k) IF(DoF /= 0) THEN IF(NCode(DoF) == 1) THEN Nel=0 Pos=0 DO i=1,Maxe DO j=1,Ndofe IF(DoF == Ldest(i,j))THEN Nel=i Pos=j EXIT END IF END DO IF(Nel /= 0)EXIT END DO F(m) = F(m) - Diag(m,k) * Elres_u(Nel,Pos) ELSE Lhs(m,DoF)= Lhs(m,DoF) + Diag(m,k) END IF END IF END DO END DO & Collocation_points ! ! Solve system of equations ! CALL Solve(Lhs,F,u1) CLOSE(UNIT=2) OPEN (UNIT=2,FILE='BERESULTS',FORM='FORMATTED') ! Gather Element results from global result vector u1 Elements_2:& DO nel=1,maxe D_o_F1: & DO nd=1,Ndofe IF(Ldest(nel,nd) /= 0)THEN 191 ... region and (-1 , 0) for sub region If a uniform subdivision is assumed the Jacobian J for the transformation from to is for all regions J K (6 .43 ) 148 The Boundary Element Method with Programming The. .. 11 11 11 11 j 21 41 43 22 42 23 k 31 32 33 37 34 35 36 l 21 41 23 43 22 42 180 The Boundary Element Method with Programming We note that for mirror image number n= 1,3 ,4 and 6, the incidences have... 182 The Boundary Element Method with Programming CASE(3) TD=(/1.0 ,-1 .0,1.0/) CASE (4) TD=(/1.0,1.0 ,-1 .0/) CASE(5) TD=( /-1 .0,1.0 ,-1 .0/) CASE(6) TD=(/1.0 ,-1 .0 ,-1 .0/) CASE(7) TD=( /-1 .0 ,-1 .0 ,-1 .0/)