			Home About us Contact

Quadrature Scheme (quadrature + scheme)

Distribution by Scientific Domains

Engineering	100%

Selected Abstracts

A three dimensional surface-to-surface projection algorithm for non-coincident domains,

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN BIOMEDICAL ENGINEERING, Issue 6 2003
M. W. Heinstein
Abstract A numerical procedure is outlined to achieve the least squares projection of a finite dimensional representation from one surface to another in three dimensions. Although the applications of such an algorithm are many, the specific problem considered is the mortar tying of dissimilarly meshed grids in large deformation solid mechanics. The algorithm includes a nearest neighbour search, a systematic subdivision of the surface of intersection into smooth subdomains (termed segments), and a robust numerical quadrature scheme for evaluation of the spatial integrals defining the mortar projection. The procedure outlined, while discussed for the mesh tying problem, is directly applicable to the study of contact-impact. Published in 2003 by John Wiley & Sons, Ltd. [source]

Strong and weak arbitrary discontinuities in spectral finite elements

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 8 2005
A. Legay
Abstract Methods for constructing arbitrary discontinuities within spectral finite elements are described and studied. We use the concept of the eXtended Finite Element Method (XFEM), which introduces the discontinuity through a local partition of unity, so there is no requirement for the mesh to be aligned with the discontinuities. A key aspect of the implementation of this method is the treatment of the blending elements adjacent to the local partition of unity. We found that a partition constructed from spectral functions one order lower than the continuous approximation is optimal and no special treatment is needed for higher order elements. For the quadrature of the Galerkin weak form, since the integrand is discontinuous, we use a strategy of subdividing the discontinuous elements into 6- and 10-node triangles; the order of the element depends on the order of the spectral method for curved discontinuities. Several numerical examples are solved to examine the accuracy of the methods. For straight discontinuities, we achieved the optimal convergence rate of the spectral element. For the curved discontinuity, the convergence rate in the energy norm error is suboptimal. We attribute the suboptimality to the approximations in the quadrature scheme. We also found that modification of the adjacent elements is only needed for lower order spectral elements. Copyright © 2005 John Wiley & Sons, Ltd. [source]

Self-regular boundary integral equation formulations for Laplace's equation in 2-D

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 1 2001
A. B. Jorge
Abstract The purpose of this work is to demonstrate the application of the self-regular formulation strategy using Green's identity (potential-BIE) and its gradient form (flux-BIE) for Laplace's equation. Self-regular formulations lead to highly effective BEM algorithms that utilize standard conforming boundary elements and low-order Gaussian integrations. Both formulations are discussed and implemented for two-dimensional potential problems, and numerical results are presented. Potential results show that the use of quartic interpolations is required for the flux-BIE to show comparable accuracy to the potential-BIE using quadratic interpolations. On the other hand, flux error results in the potential-BIE implementation can be dominated by the numerical integration of the logarithmic kernel of the remaining weakly singular integral. Accuracy of these flux results does not improve beyond a certain level when using standard quadrature together with a special transformation, but when an alternative logarithmic quadrature scheme is used these errors are shown to reduce abruptly, and the flux results converge monotonically to the exact answer. In the flux-BIE implementation, where all integrals are regularized, flux results accuracy improves systematically, even with some oscillations, when refining the mesh or increasing the order of the interpolating function. The flux-BIE approach presents a great numerical sensitivity to the mesh generation scheme and refinement. Accurate results for the potential and the flux were obtained for coarse-graded meshes in which the rate of change of the tangential derivative of the potential was better approximated. This numerical sensitivity and the need for graded meshes were not found in the elasticity problem for which self-regular formulations have also been developed using a similar approach. Logarithmic quadrature to evaluate the weakly singular integral is implemented in the self-regular potential-BIE, showing that the magnitude of the error is dependent only on the standard Gauss integration of the regularized integral, but not on this logarithmic quadrature of the weakly singular integral. The self-regular potential-BIE is compared with the standard (CPV) formulation, showing the equivalence between these formulations. The self-regular BIE formulations and computational algorithms are established as robust alternatives to singular BIE formulations for potential problems. Copyright © 2001 John Wiley & Sons, Ltd. [source]

Development of a genetic algorithm-based lookup table approach for efficient numerical integration in the method of finite spheres with application to the solution of thin beam and plate problems

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 12 2006
Suleiman BaniHani
Abstract It is observed that for the solution of thin beam and plate problems using the meshfree method of finite spheres, Gaussian and adaptive quadrature schemes are computationally inefficient. In this paper, we develop a novel technique in which the integration points and weights are generated using genetic algorithms and stored in a lookup table using normalized coordinates as part of an offline computational step. During online computations, this lookup table is used much like a table of Gaussian integration points and weights in the finite element computations. This technique offers significant reduction of computational time without sacrificing accuracy. Example problems are solved which demonstrate the effectiveness of the procedure. Copyright © 2006 John Wiley & Sons, Ltd. [source]