Home About us Contact
|
Home About us Contact | ||
|
|
||
Residual Method (residual + method)
Selected AbstractsPesticide illness among flight attendants due to aircraft disinsection,AMERICAN JOURNAL OF INDUSTRIAL MEDICINE, Issue 5 2007Patrice M. Sutton MPH Abstract Background Aircraft "disinsection" is the application of pesticides inside an aircraft to kill insects that may be on board. Over a 1-year period, California's tracking system received 17 reports of illness involving flight attendants exposed to pesticides following disinsection. Methods Interviews, work process observations, and a records review were conducted. Illness reports were evaluated according to the case definition established by the National Institute for Occupational Safety and Health. Results Twelve cases met the definition for work-related pesticide illness. Eleven cases were attributed to the "Residual" method of disinsection, i.e., application of a solution of permethrin (2.2% w/w), solvents (0.8%), and a surfactant (1.4%); the method of disinsection could not be determined for one case. Conclusions The aerosol application of a pesticide in the confined space of an aircraft cabin poses a hazard to flight attendants. Nontoxic alternative methods, such as air curtains, should be used to minimize disease vector importation via aircraft cabins. Employers should mitigate flight attendant pesticide exposure in the interim. Am. J. Ind. Med. 50:345,356, 2007. © 2007 Wiley-Liss, Inc. [source] Numerical investigation of the reliability of a posteriori error estimation for advection,diffusion equationsINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN BIOMEDICAL ENGINEERING, Issue 9 2008A. H. ElSheikh Abstract A numerical investigation of the reliability of a posteriori error estimation for advection,diffusion equations is presented. The estimator used is based on the solution of local problems subjected to Neumann boundary conditions. The estimated errors are calculated in a weighted energy norm, a stability norm and an approximate fractional order norm in order to study the effect of the error norm on both the effectivity index of the estimated errors and the mesh adaptivity process. The reported numerical results are in general better than what is available in the literature. The results reveal that the reliability of the estimated errors depends on the relation between the mesh size and the size of local features in the solution. The stability norm is found to have some advantages over the weighted energy norm in terms of producing effectivity indices closer to the optimal unit value, especially for problems with internal sharp layers. Meshes adapted by the element residual method measured in the stability norm conform to the sharp layers and are shown to be less dependent on the wind direction. Copyright © 2007 John Wiley & Sons, Ltd. [source] Large-scale topology optimization using preconditioned Krylov subspace methods with recyclingINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 12 2007Shun Wang Abstract The computational bottleneck of topology optimization is the solution of a large number of linear systems arising in the finite element analysis. We propose fast iterative solvers for large three-dimensional topology optimization problems to address this problem. Since the linear systems in the sequence of optimization steps change slowly from one step to the next, we can significantly reduce the number of iterations and the runtime of the linear solver by recycling selected search spaces from previous linear systems. In addition, we introduce a MINRES (minimum residual method) version with recycling (and a short-term recurrence) to make recycling more efficient for symmetric problems. Furthermore, we discuss preconditioning to ensure fast convergence. We show that a proper rescaling of the linear systems reduces the huge condition numbers that typically occur in topology optimization to roughly those arising for a problem with constant density. We demonstrate the effectiveness of our solvers by solving a topology optimization problem with more than a million unknowns on a fast PC. Copyright © 2006 John Wiley & Sons, Ltd. [source] An efficient diagonal preconditioner for finite element solution of Biot's consolidation equationsINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 4 2002K. K. Phoon Abstract Finite element simulations of very large-scale soil,structure interaction problems (e.g. excavations, tunnelling, pile-rafts, etc.) typically involve the solution of a very large, ill-conditioned, and indefinite Biot system of equations. The traditional preconditioned conjugate gradient solver coupled with the standard Jacobi (SJ) preconditioner can be very inefficient for this class of problems. This paper presents a robust generalized Jacobi (GJ) preconditioner that is extremely effective for solving very large-scale Biot's finite element equations using the symmetric quasi-minimal residual method. The GJ preconditioner can be formed, inverted, and implemented within an ,element-by-element' framework as readily as the SJ preconditioner. It was derived as a diagonal approximation to a theoretical form, which can be proven mathematically to possess an attractive eigenvalue clustering property. The effectiveness of the GJ preconditioner over a wide range of soil stiffness and permeability was demonstrated numerically using a simple three-dimensional footing problem. This paper casts a new perspective on the potentialities of the simple diagonal preconditioner, which has been commonly perceived as being useful only in situations where it can serve as an approximate inverse to a diagonally dominant coefficient matrix. Copyright © 2002 John Wiley & Sons, Ltd. [source] Toward large scale F.E. computation of hot forging process using iterative solvers, parallel computation and multigrid algorithmsINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 5-6 2001K. Mocellin Abstract The industrial simulation code Forge3® is devoted to three-dimensional metal forming applications. This finite element software is based on an implicit approach. It is able to carry out the large deformations of viscoplastic incompressible materials with unilateral contact conditions. The finite element discretization is based on a stable mixed velocity,pressure formulation and tetrahedral unstructured meshes. Central to the Newton iterations dealing with the non-linearities, a preconditioned conjugate residual method (PCR) is used. The parallel version of the code uses an SPMD programming model and several results on complex applications have been published. In order to reduce the CPU time computation, a new solver has been developed which is based on multigrid theory. A detailed presentation of the different elements of the method is given: the geometrical approach based on embedded meshes, the direct resolution of the velocity,pressure system, the use of PCR method as an original smoother and for solving the coarse problem, the full multigrid method and the required preconditioning by an incomplete Cholesky factorization for problems with complex contact conditions. By considering different forging cases, the theoretical properties of the multigrid method are numerically verified, optimizations of the solver are presented and finally, the results obtained on several industrial problems are given, showing the efficiency of the new solver that provides speed-up larger than 5. Copyright © 2001 John Wiley & Sons, Ltd. [source] A Petrov,Galerkin finite element model for one-dimensional fully non-linear and weakly dispersive wave propagationINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS, Issue 5 2001Seung-Buhm Woo Abstract A new finite element method is presented to solve one-dimensional depth-integrated equations for fully non-linear and weakly dispersive waves. For spatial integration, the Petrov,Galerkin weighted residual method is used. The weak forms of the governing equations are arranged in such a way that the shape functions can be piecewise linear, while the weighting functions are piecewise cubic with C2 -continuity. For the time integration an implicit predictor,corrector iterative scheme is employed. Within the framework of linear theory, the accuracy of the scheme is discussed by considering the truncation error at a node. The leading truncation error is fourth-order in terms of element size. Numerical stability of the scheme is also investigated. If the Courant number is less than 0.5, the scheme is unconditionally stable. By increasing the number of iterations and/or decreasing the element size, the stability characteristics are improved significantly. Both Dirichlet boundary condition (for incident waves) and Neumann boundary condition (for a reflecting wall) are implemented. Several examples are presented to demonstrate the range of applicabilities and the accuracy of the model. Copyright © 2001 John Wiley & Sons, Ltd. [source] Flexible GMRES-FFT method for fast matrix solution: application to 3D dielectric bodies electromagnetic scatteringINTERNATIONAL JOURNAL OF NUMERICAL MODELLING: ELECTRONIC NETWORKS, DEVICES AND FIELDS, Issue 6 2004R. S. Chen Abstract In this paper, the electromagnetic wave scattering is analysed by the efficient Krylov subspace iterative fast Fourier transform (FFT) technique in terms of the electric field integral equation (EFIE) for a dielectric body of general shape, inhomogeneity, and anisotropy. However, when the permittivity of the scatter becomes large, the convergence rate of Krylov subspace iterative methods slow down. Therefore, the inner,outer flexible generalized minimum residual method (FGMRES) is used to accelerate the iteration. As a result, nearly 10 times convergence improvement is achieved for high permittivity cases. Copyright © 2004 John Wiley & Sons, Ltd. [source] Adaptive integral method combined with the loose GMRES algorithm for planar structures analysisINTERNATIONAL JOURNAL OF RF AND MICROWAVE COMPUTER-AIDED ENGINEERING, Issue 1 2009W. Zhuang Abstract In this article, the adaptive integral method (AIM) is used to analyze large-scale planar structures. Discretization of the corresponding integral equations by method of moment (MoM) with Rao-Wilton-Glisson (RWG) basis functions can model arbitrarily shaped planar structures, but usually leads to a fully populated matrix. AIM could map these basis functions onto a rectangular grid, where the Toeplitz property of the Green's function would be utilized, which enables the calculation of the matrix-vector multiplication by use of the fast Fourier transform (FFT) technique. It reduces the memory requirement from O(N2) to O(N) and the operation complexity from O(N2) to O(N log N), where N is the number of unknowns. The resultant equations are then solved by the loose generalized minimal residual method (LGMRES) to accelerate iteration, which converges much faster than the conventional conjugate gradient method (CG). Furthermore, several preconditioning techniques are employed to enhance the computational efficiency of the LGMRES. Some typical microstrip circuits and microstrip antenna array are analyzed and numerical results show that the preconditioned LGMRES can converge much faster than conventional LGMRES. © 2008 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009. [source] Application of the preconditioned GMRES to the Crank-Nicolson finite-difference time-domain algorithm for 3D full-wave analysis of planar circuitsMICROWAVE AND OPTICAL TECHNOLOGY LETTERS, Issue 6 2008Y. Yang Abstract The increase of the time step size significantly deteriorates the property of the coefficient matrix generated from the Crank-Nicolson finite-difference time-domain (CN-FDTD) method. As a result, the convergence of classical iterative methods, such as generalized minimal residual method (GMRES) would be substantially slowed down. To address this issue, this article mainly concerns efficient computation of this large sparse linear equations using preconditioned generalized minimal residual (PGMRES) method. Some typical preconditioning techniques, such as the Jacobi preconditioner, the sparse approximate inverse (SAI) preconditioner, and the symmetric successive over-relaxation (SSOR) preconditioner, are introduced to accelerate the convergence of the GMRES iterative method. Numerical simulation shows that the SSOR preconditioned GMRES method can reach convergence five times faster than GMRES for some typical structures. © 2008 Wiley Periodicals, Inc. Microwave Opt Technol Lett 50: 1458,1463, 2008; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.23396 [source] Fast solvers with block-diagonal preconditioners for linear FEM,BEM couplingNUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, Issue 5 2009Stefan A. Funken Abstract The purpose of this paper is to present optimal preconditioned iterative methods to solve indefinite linear systems of equations arising from symmetric coupling of finite elements and boundary elements. This is a block-diagonal preconditioner together with a conjugate residual method and a preconditioned inner,outer iteration. We prove the efficiency of these methods by showing that the number of iterations to preserve a given accuracy is bounded independent of the number of unknowns. Numerical examples underline the efficiency of these methods. Copyright © 2008 John Wiley & Sons, Ltd. [source] | ||||||||||||||||||||||