Home About us Contact
|
Home About us Contact | ||
|
|
||
Linear Elasticity Problems (linear + elasticity_problem)
Selected AbstractsOn parallel solution of linear elasticity problems.NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, Issue 3 2002Part II: Methods, some computer experiments Abstract This is the second part of a trilogy on parallel solution of the linear elasticity problem. We consider the plain case of the problem with isotropic material, including discontinuous coefficients, and with homogeneous Dirichlet boundary condition. The discretized problem is solved by the preconditioned conjugate gradient (pcg) method. In the first part of the trilogy block- diagonal preconditioners based on the separate displacement component part of the elasticity equations were analysed. The preconditioning systems were solved by the pcg-method, i.e. inner iterations were performed. As preconditioner, we used modified incomplete factorization MIC(0), where possibly the element matrices were modified in order to give M -matrices, i.e. in order to guarantee the existence of the MIC(0) factorization. In the present paper, the second part, full block incomplete factorization preconditioners are presented and analysed. In order to avoid inner/outer iterations we also study a variant of the block-diagonal method and of the full block method, where the matrices of the inner systems are just replaced by their MIC(0)-factors. A comparison is made between the various methods with respect to rate of convergence and work per unknown. The fastest methods are implemented by message passing utilizing the MPI system. In the third part of the trilogy, we will focus on the use of higher-order finite elements. Copyright © 2002 John Wiley & Sons, Ltd. [source] A node-based agglomeration AMG solver for linear elasticity in thin bodiesINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN BIOMEDICAL ENGINEERING, Issue 3 2009Prasad S. Sumant Abstract This paper describes the development of an efficient and accurate algebraic multigrid finite element solver for analysis of linear elasticity problems in two-dimensional thin body elasticity. Such problems are commonly encountered during the analysis of thin film devices in micro-electro-mechanical systems. An algebraic multigrid based on element interpolation is adopted and streamlined for the development of the proposed solver. A new node-based agglomeration scheme is proposed for computationally efficient, aggressive and yet effective generation of coarse grids. It is demonstrated that the use of appropriate finite element discretization along with the proposed algebraic multigrid process preserves the rigid body modes that are essential for good convergence of the multigrid solution. Several case studies are taken up to validate the approach. The proposed node-based agglomeration scheme is shown to lead to development of sparse and efficient intergrid transfer operators making the overall multigrid solution process very efficient. The proposed solver is found to work very well even for Poisson's ratio >0.4. Finally, an application of the proposed solver is demonstrated through a simulation of a micro-electro-mechanical switch. Copyright © 2008 John Wiley & Sons, Ltd. [source] A hybridizable discontinuous Galerkin method for linear elasticityINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 8 2009S.-C. Soon Abstract This paper describes the application of the so-called hybridizable discontinuous Galerkin (HDG) method to linear elasticity problems. The method has three significant features. The first is that the only globally coupled degrees of freedom are those of an approximation of the displacement defined solely on the faces of the elements. The corresponding stiffness matrix is symmetric, positive definite, and possesses a block-wise sparse structure that allows for a very efficient implementation of the method. The second feature is that, when polynomials of degree k are used to approximate the displacement and the stress, both variables converge with the optimal order of k+1 for any k,0. The third feature is that, by using an element-by-element post-processing, a new approximate displacement can be obtained that converges at the order of k+2, whenever k,2. Numerical experiments are provided to compare the performance of the HDG method with that of the continuous Galerkin (CG) method for problems with smooth solutions, and to assess its performance in situations where the CG method is not adequate, that is, when the material is nearly incompressible and when there is a crack. Copyright © 2009 John Wiley & Sons, Ltd. [source] Smooth finite element methods: Convergence, accuracy and propertiesINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 2 2008Hung Nguyen-Xuan Abstract A stabilized conforming nodal integration finite element method based on strain smoothing stabilization is presented. The integration of the stiffness matrix is performed on the boundaries of the finite elements. A rigorous variational framework based on the Hu,Washizu assumed strain variational form is developed. We prove that solutions yielded by the proposed method are in a space bounded by the standard, finite element solution (infinite number of subcells) and a quasi-equilibrium finite element solution (a single subcell). We show elsewhere the equivalence of the one-subcell element with a quasi-equilibrium finite element, leading to a global a posteriori error estimate. We apply the method to compressible and incompressible linear elasticity problems. The method can always achieve higher accuracy and convergence rates than the standard finite element method, especially in the presence of incompressibility, singularities or distorted meshes, for a slightly smaller computational cost. It is shown numerically that the one-cell smoothed four-noded quadrilateral finite element has a convergence rate of 2.0 in the energy norm for problems with smooth solutions, which is remarkable. For problems with rough solutions, this element always converges faster than the standard finite element and is free of volumetric locking without any modification of integration scheme. Copyright © 2007 John Wiley & Sons, Ltd. [source] A geometric-based algebraic multigrid method for higher-order finite element equations in two-dimensional linear elasticityNUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, Issue 7 2009Yingxiong Xiao Abstract In this paper, we will discuss the geometric-based algebraic multigrid (AMG) method for two-dimensional linear elasticity problems discretized using quadratic and cubic elements. First, a two-level method is proposed by analyzing the relationship between the linear finite element space and higher-order finite element space. And then a geometric-based AMG method is obtained with the existing solver used as a solver on the first coarse level. The resulting AMG method is applied to some typical elasticity problems including the plane strain problem with jumps in Young's modulus. The results of various numerical experiments show that the proposed AMG method is much more robust and efficient than a classical AMG solver that is applied directly to the high-order systems alone. Moreover, we present the corresponding theoretical analysis for the convergence of the proposed AMG algorithms. These theoretical results are also confirmed by some numerical tests. Copyright © 2008 John Wiley & Sons, Ltd. [source] Eigenvalue estimates for preconditioned saddle point matricesNUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, Issue 4 2006Owe Axelsson Abstract New accurate eigenvalue bounds for symmetric matrices of saddle point form are derived and applied for both unpreconditioned and preconditioned versions of the matrices. The estimates enable a better understanding of how preconditioners should be chosen. The preconditioners provide efficient iterative solution of the corresponding linear systems with, for some important applications, an optimal order of computational complexity. The methods are applied for Stokes problem and for linear elasticity problems. Copyright © 2005 John Wiley & Sons, Ltd. [source] Using the modified 2nd order incomplete Cholesky decomposition as the conjugate gradient preconditioningNUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, Issue 6-7 2002I. E. Kaporin Abstract In this paper, the ,second-order' incomplete triangular factorization (Kaporin, 1998) is considered as a preconditioner for the CG method. Some refinements of the original algorithm are proposed and investigated, which give rise to a more efficient modified incomplete Cholesky 2nd-order (MIC2) type preconditionings. Numerical results are given for a set of real-life large-scale SPD linear systems arising in the finite element modelling of linear elasticity problems which clearly indicate the superiority of the MIC2 preconditionings. Copyright © 2002 John Wiley & Sons, Ltd. [source] On parallel solution of linear elasticity problems.NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, Issue 3 2002Part II: Methods, some computer experiments Abstract This is the second part of a trilogy on parallel solution of the linear elasticity problem. We consider the plain case of the problem with isotropic material, including discontinuous coefficients, and with homogeneous Dirichlet boundary condition. The discretized problem is solved by the preconditioned conjugate gradient (pcg) method. In the first part of the trilogy block- diagonal preconditioners based on the separate displacement component part of the elasticity equations were analysed. The preconditioning systems were solved by the pcg-method, i.e. inner iterations were performed. As preconditioner, we used modified incomplete factorization MIC(0), where possibly the element matrices were modified in order to give M -matrices, i.e. in order to guarantee the existence of the MIC(0) factorization. In the present paper, the second part, full block incomplete factorization preconditioners are presented and analysed. In order to avoid inner/outer iterations we also study a variant of the block-diagonal method and of the full block method, where the matrices of the inner systems are just replaced by their MIC(0)-factors. A comparison is made between the various methods with respect to rate of convergence and work per unknown. The fastest methods are implemented by message passing utilizing the MPI system. In the third part of the trilogy, we will focus on the use of higher-order finite elements. Copyright © 2002 John Wiley & Sons, Ltd. [source] A parallel block overlap preconditioning with inexact submatrix inversion for linear elasticity problemsNUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, Issue 2 2002Igor E. Kaporin We present a parallel preconditioned iterative solver for large sparse symmetric positive definite linear systems. The preconditioner is constructed as a proper combination of advanced preconditioning strategies. It can be formally seen as being of domain decomposition type with algebraically constructed overlap. Similar to the classical domain decomposition technique, inexact subdomain solvers are used, based on incomplete Cholesky factorization. The proper preconditioner is shown to be near optimal in minimizing the so-called K -condition number of the preconditioned matrix. The efficiency of both serial and parallel versions of the solution method is illustrated on a set of benchmark problems in linear elasticity. Copyright © 2002 John Wiley & Sons, Ltd. [source] | ||||||||||