On the performance of strain smoothing for quadratic and enriched finite element approximations (XFEM/GFEM/PUFEM)

By using the strain smoothing technique proposed by Chen et al. (Comput. Mech. 2000; 25: 137-156) for meshless methods in the context of the finite element method (FEM), Liu et al. (Comput. Mech. 2007; 39(6): 859-877) developed the Smoothed FEM (SFEM). Although the SFEM is not yet well understood mathematically, numerical experiments point to potentially useful features of this particularly simple modification of the FEM. To date, the SFEM has only been investigated for bilinear and Wachspress approximations and is limited to linear reproducing conditions. The goal of this paper is to extend the strain smoothing to higher order elements and to investigate numerically in which condition strain smoothing is beneficial to accuracy and convergence of enriched finite element approximations. We focus on three widely used enrichment schemes, namely: (a) weak discontinuities; (b) strong discontinuities; (c) near-tip linear elastic fracture mechanics functions. The main conclusion is that strain smoothing in enriched approximation is only beneficial when the enrichment functions are polynomial (cases (a) and (b)), but that non-polynomial enrichment of type (c) lead to inferior methods compared to the standard enriched FEM (e.g. XFEM). Copyright (C) 2011 John Wiley & Sons, Ltd.

Hybrid stiff-string-polynomial basis functions for vibration analysis of high speed rotating beams

A new finite element is developed for free vibration analysis of high speed rotating beams using basis functions which use a linear combination of the solution of the governing static differential equation of a stiff-string and a cubic polynomial. These new shape functions depend on rotation speed and element position along the beam and account for the centrifugal stiffening effect. The natural frequencies predicted by the proposed element are compared with an element with stiff-string, cubic polynomial and quintic polynomial shape functions. It is found that the new element exhibits superior convergence compared to the other basis functions.

Topology-Guided Tessellation Of Quadratic Elements

Topology-based methods have been successfully used for the analysis and visualization of piecewise-linear functions defined on triangle meshes. This paper describes a mechanism for extending these methods to piecewise-quadratic functions defined on triangulations of surfaces. Each triangular patch is tessellated into monotone regions, so that existing algorithms for computing topological representations of piecewise-linear functions may be applied directly to the piecewise-quadratic function. In particular, the tessellation is used for computing the Reeb graph, a topological data structure that provides a succinct representation of level sets of the function.

Fast Iterative Division of p-adic Numbers

A fast iterative scheme based on the Newton method is described for finding the reciprocal of a finite segment p-adic numbers (Hensel code). The rate of generation of the reciprocal digits per step can be made quadratic or higher order by a proper choice of the starting value and the iterating function. The extension of this method to find the inverse transform of the Hensel code of a rational polynomial over a finite field is also indicated.

Comment on path integration of a quadratic action with a generalized memory

Using the promeasure technique, we give an alternative evaluation of a path integral corresponding to a quadratic action with a generalized memory.

Comment on “path integration of a quadratic action with a generalized memory

Using the promeasure technique, we give an alternative evaluation of a path integral corresponding to a quadratic action with a generalized memory.

Microprocessor-based polynomial generator

A new method of generating polynomials using microprocessors is proposed. The polynomial is generated as a 16-bit digital word. The algorithm for generating a variety of basic 'building block' functions and its implementation is discussed. A technique for generating a generalized polynomial based on the proposed algorithm is indicated. The performance of the proposed generator is evaluated using a commercially available microprocessor kit.

On the sufficient conditions for the equality of the unassignable polynomial and Davison's fixed polynomial of strongly connected systems

In this technical note, it is established that the unassignable polynomial defined for a not strongly connected decentralized control system is not equal to Davison's fixed polynomial. This leads to a "sufficient condition" for the equality of the unassignable polynomial and Davison's fixed polynomial for strongly connected systems.

A parallel wilf algorithm for complex zeros of a polynomial

A global recursive bisection algorithm is described for computing the complex zeros of a polynomial. It has complexityO(n 3 p) wheren is the degree of the polynomial andp the bit precision requirement. Ifn processors are available, it can be realized in parallel with complexityO(n 2 p); also it can be implemented using exact arithmetic. A combined Wilf-Hansen algorithm is suggested for reduction in complexity.

Microprocessor-based polynomial generator

A new method of generating polynomials using microprocessors is proposed. The polynomial is generated as a 16-bit digital word. The algorithm for generating a variety of basic 'building block' functions and its implementation is discussed. A technique for generating a generalized polynomial based on the proposed algorithm is indicated. The performance of the proposed generator is evaluated using a commercially available microprocessor kit.

Non-linear systems with quadratic and cubic damping - an analytical approach

The possible equivalence of second-order non-linear systems having quadratic and cubic damping with third-order linear systems is studied in this paper. It is shown that this equivalence can be established through transformation techniques under certain constraints on the form of the non-linearity of the given system.

Multi-Tone Testing of Linear and Nonlinear Analog Circuits using Polynomial Coefficients

A method of testing for parametric faults of analog circuits based on a polynomial representation of fault-free function of the circuit is presented. The response of the circuit under test (CUT) is estimated as a polynomial in the applied input voltage at relevant frequencies in addition to DC. Classification or Cur is based on a comparison of the estimated polynomial coefficients with those of the fault free circuit. This testing method requires no design for test hardware as might be added to the circuit fly some other methods. The proposed method is illustrated for a benchmark elliptic filter. It is shown to uncover several parametric faults causing deviations as small as 5% from the nominal values.

Quadratic Nonlinearity of One- and Two-Electron Oxidized Metalloporphyrins and Their Switching in Solution

We report the quadratic nonlinearity of one- and two-electron oxidation products of the first series of transition metal complexes of meso-tetraphenylporphyrin (TPP). Among many MTPP complexes, only CuTPP and ZnTPP show reversible oxidation/reduction cycles as seen from cyclic voltammetry experiments. While centrosymmetric neutral metalloporphyrins have zero first hyperpolarizability, β, as expected, the cation radicals and dications of CuTPP and ZnTPP have very high β values. The one- and two-electron oxidation of the MTPPs leads to symmetry-breaking of the metal−porphyrin core, resulting in a large β value that is perhaps aided in part by contributions from the two-photon resonance enhancement. The calculated static first hyperpolarizabilities, β0, which are evaluated in the framework of density functional theory by a coupled perturbed Hartree−Fock method, support the experimental trend. The switching of optical nonlinearity has been achieved between the neutral and the one-electron oxidation products but not between the one- and the two-electron oxidation products since dications that are electrochemically reversible are unstable due to the formation of stable isoporphyrins in the presence of nucleophiles such as halides.

The effect of halogen atom on the molecular quadratic nonlinearity of half sandwich complexes in the presence of an acceptor

Half sandwich complexes of the type [CpM(CO)(n)X] {X=Cl, Br, I; If, M=Fe, Ru; n=2 and if M=Mo; n=3} and [CpNiPPh3X] {X=Cl, Br, I} have been synthesized and their second order molecular nonlinearity (beta) measured at 1064 nm in CHCl3 by the hyper-Rayleigh scattering technique. Iron complexes consistently display larger beta values than ruthenium complexes while nickel complexes have marginally larger beta values than iron complexes. In the presence of an acceptor ligand such as CO or PPh3, the role of the halogen atom is that of a pi donor. The better overlap of Cl orbitals with Fe and Ni metal centres make Cl a better pi donor than Br or I in the respective complexes. Consequently, M-pi interaction is stronger in Fe/Ni-Cl complexes. The value of beta decreases as one goes down the halogen group. For the complexes of 4d metal ions where the metal-ligand distance is larger, the influence of pi orbital overlap appears to be less important, resulting in moderate changes in beta as a function of halogen substitution. (C) 2006 Elsevier B.V. All rights reserved.