Search results

The initial stiffness method has been extensively adopted for elasto‐plastic finite element analysis. The main problem associated with the initial stiffness method, however, is its slow convergence, even when it is used in conjunction with acceleration techniques. The Newton‐Raphson method has a rapid convergence rate, but its implementation resorts to non‐symmetric linear solvers, and hence the memory requirement may be high. The purpose of this paper is to develop more advanced solution techniques which may overcome the above problems associated with the initial stiffness method and the Newton‐Raphson method.

In this work, the accelerated symmetric stiffness matrix methods, which cover the accelerated initial stiffness methods as special cases, are proposed for non‐associated plasticity. Within the computational framework for the accelerated symmetric stiffness matrix techniques, some symmetric stiffness matrix candidates are investigated and evaluated.

Numerical results indicate that for the accelerated symmetric stiffness methods, the elasto‐plastic constitutive matrix, which is constructed by mapping the yield surface of the equivalent material to the plastic potential surface, appears to be appealing. Even when combined with the Krylov iterative solver using a loose convergence criterion, they may still provide good nonlinear convergence rates.

Compared to the work by Sloan et al., the novelty of this study is that a symmetric stiffness matrix is proposed to be used in conjunction with acceleration schemes and it is shown to be more appealing; it is assembled from the elasto‐plastic constitutive matrix by mapping the yield surface of the equivalent material to the plastic potential surface. The advantage of combining the proposed accelerated symmetric stiffness techniques with the Krylov subspace iterative methods for large‐scale applications is also emphasized.

This paper presents a preliminary analysis of the effects of kinetic healing at supersonic speeds on the torsional and flexural stiffnesses of thin solid wings. The main investigation is based on the small deflexion theory, but the scope of the analysis for torsion is extended to cover the effects of large deformations.

Structural topology optimization is computationally expensive due to the involvement of high-resolution mesh and repetitive use of finite element analysis (FEA) for computing the structural response. Since FEA consumes most of the computational time in each optimization iteration, a novel GPU-based parallel strategy for FEA is presented and applied to the large-scale structural topology optimization of 3D continuum structures.

A matrix-free solver based on preconditioned conjugate gradient (PCG) method is proposed to minimize the computational time associated with solution of linear system of equations in FEA. The proposed solver uses an innovative strategy to utilize only symmetric half of elemental stiffness matrices for implementation of the element-by-element matrix-free solver on GPU.

Using solid isotropic material with penalization (SIMP) method, the proposed matrix-free solver is tested over three 3D structural optimization problems that are discretized using all hexahedral structured and unstructured meshes. Results show that the proposed strategy demonstrates 3.1× –3.3× speedup for the FEA solver stage and overall speedup of 2.9× –3.3× over the standard element-by-element strategy on the GPU. Moreover, the proposed strategy requires almost 1.8× less GPU memory than the standard element-by-element strategy.

The proposed GPU-based matrix-free element-by-element solver takes a more general approach to the symmetry concept than previous works. It stores only symmetric half of the elemental matrices in memory and performs matrix-free sparse matrix-vector multiplication (SpMV) without any inter-thread communication. A customized data storage format is also proposed to store and access only symmetric half of elemental stiffness matrices for coalesced read and write operations on GPU over the unstructured mesh.

The free vibration analysis of cyclic symmetric structures is considered as a Hermitian eigenvalue problem in semi‐complex domain using subspace iteration method is presented. The trial vectors are selected using a modified Ritz vector scheme. A modified convergence criterion which gives true error estimates which is suited for clustered eigenvalue problems is presented. Also the effect of purification of trial vectors on convergence is considered.

The computational efficiency of subspace iteration is addressed relative to the data structures adopted for the very large and generally sparse coefficient matrices. The frequent triangulations and matrix multiplications demand that access to the terms in the coefficient matrices be unbiased. Reliance on virtual memory (paging) operating systems with no special considerations for localized data access is not adequate. Specific data structures must be designed that accommodate the needs of the numerical algorithm yet eliminate unnecessary paging. An implementation of the subspace iteration method using hypermatrix data structures is presented. Use of hypermatrices is shown to provide unbiased and localized data access. The various modifications to the conventional formulation are described and an example problem illustrates the potential benefits of the hypermatrix formulation. Possibilities for adapting hypermatrix data structures to new supercomputer architectures are discussed.

This paper seeks to present a new solution algorithm for updating of finite element models in structural dynamics. A random search method is applied to improving the correlation between the numerical simulation and the measured experimental data.

Dynamic finite element model updating may be considered as an optimization process. It is solved using modified accelerated random search (MARS) algorithm. The effectiveness of the approach is first tested on benchmark problems. Next, several objective function formulations for dynamic model updating in modal and frequency domains are investigated for numerically simulated vibrating beam. Finally, the algorithm is applied to a real beam‐like structure using measured modal data.

The MARS algorithm is able to provide very good results in a reduced time even for hard optimization problems. It behaves very well also for the FE dynamic model updating, highly coupled problems. The efficient updating criterion has been proposed and the approach has been validated experimentally.

The method is supposed to be time consuming for large size or complicated objective function problems but the choice of optimization parameters can accelerate the convergence.

The MARS algorithm can be applied to model updating in civil and mechanical engineering.

This paper is the first to apply the MARS algorithm to the problem of FE model updating in dynamics and enables one to obtain very good results. Efficient criteria for model updating have been proposed.

This paper presents a solder joint engineering reliability model — Solder Reliability Solutions** (SRS) — and its application to surface mount area‐array and chip‐scale assemblies. The model is validated by failure data from 33 accelerated thermal cycling tests, and test vehicles covering several generations of component, assembly and circuit board technologies and a variety of test conditions. The SRS model has been implemented as a PC‐based design‐for‐reliabilltytool that enables rapid assessment of assembly reliability in the early stages of product development.

The present paper aims to describe the model updating of a small aircraft dynamic finite element model (FEM) to improve its agreement with ground vibration test (GVT) data.

An automatic updating method using an optimization procedure is carried out. Instead of using dedicated updating tools, the procedure is implemented using standard MSC/NASTRAN because of wide availability of the software in small aircraft industries. The objective function is defined to minimize the differences in the natural frequency and the differences in the mode shape between the analytical model and the GVT data. Provision has been made to include the quantification of confidence in both the GVT data and in the initial model. Parameter grouping is carried out to reduce the number of design parameters during the optimization process.

The optimization module of standard finite element (FE) software can be effectively used to reduce the differences between the GVT and the FEM in terms of frequency and mode shape satisfactorily. The strategy to define the objective function based on minimizing the mode shape error can reduce the improvement in the frequency error. The required user interference can be kept low.

The most important contribution of the present paper concerns the combination of strategies to define the objective function and selection of the parameters.

The purpose of this paper is to make a theoretical comprehensive efficiency evaluation of a nonlinear analysis method based on the Woodbury formula from the efficiency of the solution of linear equations in each incremental step and the selected iterative algorithms.

First, this study employs the time complexity theory to quantitatively compare the efficiency of the Woodbury formula and the LDLT factorization method which is a commonly used method to solve linear equations. Moreover, the performance of iterative algorithms also significantly effects the efficiency of the analysis. Thus, the three-point method with a convergence order of eight is employed to solve the equilibrium equations of the nonlinear analysis method based on the Woodbury formula, aiming to improve the iterative performance of the Newton–Raphson (N–R) method.

First, the result shows that the asymptotic time complexity of the Woodbury formula is much lower than that of the LDLT factorization method when the number of inelastic degrees of freedom (IDOFs) is much less than that of DOFs, indicating that the Woodbury formula is more efficient for local nonlinear problems. Moreover, the time complexity comparison of the N–R method and the three-point method indicates that the three-point method is more efficient than the N–R method for local nonlinear problems with large-scale structures or a larger ratio of IDOFs number to the DOFs number.

This study theoretically evaluates the efficiency of nonlinear analysis method based on the Woodbury formula, and quantitatively shows the application condition of the comparative methods. The comparison result provides a theoretical basis for the selection of algorithms for different nonlinear problems.

The purpose of this paper is to propose an efficient iterative method for large-scale finite element equations of bad numerical stability arising from deformation analysis with multi-point constraint using Lagrange multiplier method.

In this paper, taking warpage analysis of polymer injection molding based on surface model as an example, the performance of several popular Krylov subspace methods, including conjugate gradient, BiCGSTAB and generalized minimal residual (GMRES), with diffident Incomplete LU (ILU)-type preconditions is investigated and compared. For controlling memory usage, GMRES(m) is also considered. And the ordering technique, commonly used in the direct method, is introduced into the presented iterative method to improve the preconditioner.

It is found that the proposed preconditioned GMRES method is robust and effective for solving problems considered in this paper, and approximate minimum degree (AMD) ordering is most beneficial for the reduction of fill-ins in the ILU preconditioner and acceleration of the convergence, especially for relatively accurate ILU-type preconditioning. And because of concerns about memory usage, GMRES(m) is a good choice if necessary.

In this paper, for overcoming difficulties of bad numerical stability resulting from Lagrange multiplier method, together with increasing scale of problems in engineering applications and limited hardware conditions of computer, a stable and efficient preconditioned iterative method is proposed for practical purpose. Before the preconditioning, AMD reordering, commonly used in the direct method, is introduced to improve the preconditioner. The numerical experiments show the good performance of the proposed iterative method for practical cases, which is implemented in in-house and commercial codes on PC.