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.

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.

Development of Very High Frequency Damped Sine Wave Generator

In order to protect the critical electronic equipment/system against damped sine transient currents induced into its cables due to transient electromagnetic fields, switching phenomena, platform resonances, etc. it is necessary to provide proper hardening. The hardness assurance provided can be evaluated as per the test CS 116 of MIL STD 461E/F in laboratory by generating & inducing the necessary damped sine currents into the cables of the Equipment Under Test (EUT). The need and the stringent requirements for building a damped sine wave current generator for generation of damped sine current transients of very high frequencies (30 MHz & 100 MHz) have been presented. A method using LC discharge for the generation has been considered in the development. This involves building of extremely low & nearly loss less inductors (about 5 nH & 14 nH) as well as a capacitor & a switch with much lower inductances. A technique for achieving this has been described. Two units (I No for 30 MHz. & 100 MHz each) have been built. Experiments to verify the output are being conducted.

Manifolds with nonnegative isotropic curvature

We prove that if (M-n, g), n >= 4, is a compact, orientable, locally irreducible Riemannian manifold with nonnegative isotropic curvature,then one of the following possibilities hold: (i) M admits a metric with positive isotropic curvature. (ii) (M, g) is isometric to a locally symmetric space. (iii) (M, g) is Kahler and biholomorphic to CPn/2. (iv) (M, g) is quaternionic-Kahler. This is implied by the following result: Let (M-2n, g) be a compact, locally irreducible Kahler manifold with nonnegative isotropic curvature. Then either M is biholomorphic to CPn or isometric to a compact Hermitian symmetric space. This answers a question of Micallef and Wang in the affirmative. The proof is based on the recent work of Brendle and Schoen on the Ricci flow.

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.

A weighted mean square method of linearization in non-linear oscillations

The paper deals with a linearization technique in non-linear oscillations for systems which are governed by second-order non-linear ordinary differential equations. The method is based on approximation of the non-linear function by a linear function such that the error is least in the weighted mean square sense. The method has been applied to cubic, sine, hyperbolic sine, and odd polynomial types of non-linearities and the results obtained are more accurate than those given by existing linearization methods.

Nonnegative integral solution of linear equations

A method to obtain a nonnegative integral solution of a system of linear equations, if such a solution exists is given. The method writes linear equations as an integer programming problem and then solves the problem using a combination of artificial basis technique and a method of integer forms.

Local polynomial convexity of the union of two totally-real surfaces at their intersection

We consider the following question: Let S (1) and S (2) be two smooth, totally-real surfaces in C-2 that contain the origin. If the union of their tangent planes is locally polynomially convex at the origin, then is S-1 boolean OR S-2 locally polynomially convex at the origin? If T (0) S (1) a (c) T (0) S (2) = {0}, then it is a folk result that the answer is yes. We discuss an obstruction to the presumed proof, and provide a different approach. When dim(R)(T0S1 boolean AND T0S2) = 1, we present a geometric condition under which no consistent answer to the above question exists. We then discuss conditions under which we can expect local polynomial convexity.

Optimization of Helicopter Rotor Using Polynomial and Neural Network Metamodels

This study aims to determine optimal locations of dual trailing-edge flaps and blade stiffness to achieve minimum hub vibration levels in a helicopter, with low penalty in terms of required trailing-edge flap control power. An aeroelastic analysis based on finite elements in space and time is used in conjunction with an optimal control algorithm to determine the flap time history for vibration minimization. Using the aeroelastic analysis, it is found that the objective functions are highly nonlinear and polynomial response surface approximations cannot describe the objectives adequately. A neural network is then used for approximating the objective functions for optimization. Pareto-optimal points minimizing both helicopter vibration and flap power ale obtained using the response surface and neural network metamodels. The two metamodels give useful improved designs resulting in about 27% reduction in hub vibration and about 45% reduction in flap power. However, the design obtained using response surface is less sensitive to small perturbations in the design variables.

A polynomial bound on the number of light cycles in an undirected graph

Let G be an undirected graph with a positive real weight on each edge. It is shown that the number of minimum-weight cycles of G is bounded above by a polynomial in the number of edges of G. A similar bound holds if we wish to count the number of cycles with weight at most a constant multiple of the minimum weight of a cycle of G.

Vector summed sine wave tailored waveforms for dipolar excitation of ions in Paul trap mass spectrometers

A simple method to generate time domain tailored waveforms for excitation of ion axial amplitude in Paul trap mass spectrometers is described. The method is based on vector summation of sine waves followed by time domain sampling to obtain the discrete time domain data. A smoothing technique based on the time domain Kaiser window is then applied to the data so as to minimize the frequency domain Gibb's oscillations. The dynamic range of the time domain signal is controlled by phase modulation and time extension of the time domain waveform. Copyright (C) 1999 John Wiley & Sons, Ltd.