Approximate methods for step function response of undamped non-linear spring mass systems with arbitrary hardening type spring characteristic

The possibility of applying two approximate methods for determining the salient features of response of undamped non-linear spring mass systems subjected to a step input, is examined. The results obtained on the basis of these approximate methods are compared with the exact results that are available for some particular types of spring characteristics. The extension of the approximate methods for non-linear systems with general polynomial restoring force characteristics is indicated.

Approximate solutions for the structure of shock waves

Approximate solutions of the B-G-K model equation are obtained for the structure of a plane shock, using various moment methods and a least squares technique. Comparison with available exact solution shows that while none of the methods is uniformly satisfactory, some of them can provide accurate values for the density slope shock thickness delta n . A detailed error analysis provides explanations for this result. An asymptotic analysis of delta n for largeMach numbers shows that it scales with theMaxwell mean free path on the hot side of the shock, and that their ratio is relatively insensitive to the viscosity law for the gas.

An approximate analysis of non-linear non-conservative systems subjected to step function excitation

This paper deals with the approximate analysis of the step response of non-linear nonconservative systems by the application of ultraspherical polynomials. From the differential equations for amplitude and phase, set up by the method of variation of parameters, the approximate solutions are obtained by a generalized averaging technique based on ultraspherical polynomial expansions. The Krylov-Bogoliubov results are given by a particular set of these polynomials. The method has been applied to study the step response of a cubic spring mass system in presence of viscous, material, quadratic, and mixed types of damping. The approximate results are compared with the digital and analogue computer solutions and a close agreement has been found between the analytical and the exact results.

An approximate algorithm for the minimal vertex nested polygon problem

Given two simple polygons, the Minimal Vertex Nested Polygon Problem is one of finding a polygon nested between the given polygons having the minimum number of vertices. In this paper, we suggest efficient approximate algorithms for interesting special cases of the above using the shortest-path finding graph algorithms.

Approximate linear time ML decoding on tail-biting trellises in two rounds

A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an algorithm proposed earlier with the advantage that it reduces the time complexity from O(m log m) to O(m) where m is the number of nodes in the tail-biting trellis. A necessary condition for the output of the algorithm to differ from the output of the ideal ML decoder is deduced and simulation results on an AWGN channel using tail-biting trellises for two rate 1/2 convolutional codes with memory 4 and 6 respectively, are reported.

A simple technique for approximate solutions of the Falkner-Skan equation

A simple, sufficiently accurate and efficient method for approximate solutions of the Falkner-Skan equation is proposed here for a wide range of the pressure gradient parameter. The proposed approximate solutions are obtained utilising a known solution of another differential equation.

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

Let G - (V, E) be a weighted undirected graph having nonnegative edge weights. An estimate (delta) over cap (u, v) of the actual distance d( u, v) between u, v is an element of V is said to be of stretch t if and only if delta(u, v) <= (delta) over cap (u, v) <= t . delta(u, v). Computing all-pairs small stretch distances efficiently ( both in terms of time and space) is a well-studied problem in graph algorithms. We present a simple, novel, and generic scheme for all-pairs approximate shortest paths. Using this scheme and some new ideas and tools, we design faster algorithms for all-pairs t-stretch distances for a whole range of stretch t, and we also answer an open question posed by Thorup and Zwick in their seminal paper [J. ACM, 52 (2005), pp. 1-24].

Approximate multipole coefficients of RF ion traps as functions of aperture size

In this study we present approximate analytical expressions for estimating the variation in multipole expansion coefficients as a function of the size of the apertures in the electrodes in axially symmetric (3D) and two-dimensional (2D) ion trap ion traps. Following the approach adopted in our earlier studies which focused on the role of apertures to fields within the traps, here too, the analytical expression we develop is a sum of two terms, A(n,noAperiure), the multipole expansion coefficient for a trap with no apertures and A(n,dueToAperture), the multipole expansion coefficient contributed by the aperture. A(n,noAperture) has been obtained numerically and A(n,dueToAperture) is obtained from the n th derivative of the potential within the trap. The expressions derived have been tested on two 3D geometries and two 2D geometries. These include the quadrupole ion trap (QIT) and the cylindrical ion trap (CIT) for 3D geometries and the linear ion trap (LIT) and the rectilinear ion trap (RIT) for the 2D geometries. Multipole expansion coefficients A(2) to A(12), estimated by our analytical expressions, were compared with the values obtained numerically (using the boundary element method) for aperture sizes varying up to 50% of the trap dimension. In all the plots presented, it is observed that our analytical expression for the variation of multipole expansion coefficients versus aperture size closely follows the trend of the numerical evaluations for the range of aperture sizes considered. The maximum relative percentage errors, which provide an estimate of the deviation of our values from those obtained numerically for each multipole expansion coefficient, are seen to be largely in the range of 10-15%. The leading multipole expansion coefficient, A(2), however, is seen to be estimated very well by our expressions, with most values being within 1% of the numerically determined values, with larger deviations seen for the QIT and the LIT for large aperture sizes. (C) 2010 Elsevier B.V. All rights reserved.

Approximate VB-MO schemes for excitation gaps in Hubbard models

The excitation gaps in the singlet and triplet manifolds for finite Hubbard models in one, two and three dimensions have been obtained using different approximate configuration interaction (CI) schemes, as a function of the correlation strength, by using valence bond (VB) functions constructed over the molecular orbital (MO) basis. These are compared with numerically exact results and it is found that the scheme in which all particle hole excitations below a given threshold are included is the method of choice. The excitation energies are well reproduced, in trend as well as magnitude, particularly when the threshold equals the bandwidth of the corresponding noninteracting system.

The approximate parametrization of the curve of intersection of implicit surfaces

A clear definition of an approximate parametrization of the curve of intersection of (n-1) implicit surfaces in Rn is given. It is justified that marching methods yield such an approximation.

Constant pressure laminar, transitional and turbulent flows - An approximate unified treatment

A nondimensional number that is constant in two-dimensional, incompressible and constant pressure laminar and fully turbulent boundary, layer flows has been proposed. An extension of this to constant pressure transitional flow is discussed.

Large eddy simulation of a premixed flame with approximate deconvolution modeling

Approximate deconvolution modeling is a very recent approach to large eddy simulation of turbulent flows. It has been applied to compressible flows with success. Here, a premixed flame which forms in the wake of a flameholder has been selected to examine the subgrid-scale modeling of reaction rate by this new method because a previous plane two-dimensional simulation of this wake flame, using a wrinkling function and artificial flame thickening, had revealed discrepancies when compared with experiment. The present simulation is of the temporal evolution of a round wakelike flow at two Reynolds numbers, Re = 2000 and 10,000, based on wake defect velocity and wake diameter. A Fourier-spectral code has been used. The reaction is single-step and irreversible, and the rate follows an Arrhenius law. The reference simulation at the lower Reynolds number is fully resolved. At Re = 10,000, subgrid-scale contributions are significant. It was found that subgrid-scale modeling in the present simulation agrees more closely with unresolved subgrid-scale effects observed in experiment. Specifically, the highest contributions appeared in thin folded regions created by vortex convection. The wrinkling function approach had not selected subgrid-scale effects in these regions.